About the Execution of LTSMin+red for Peterson-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3250.964 | 155357.00 | 202594.00 | 450.80 | FTTFTTTTF?FTFTFF | 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-171654407200223.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-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200223
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 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 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K 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-COL-4-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717261528180
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:05:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:05:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:05:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:05:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:05:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 983 ms
[2024-06-01 17:05:31] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 53 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:05:31] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 10 ms.
[2024-06-01 17:05:31] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 226 steps (0 resets) in 14 ms. (15 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 17:05:31] [INFO ] Flatten gal took : 46 ms
[2024-06-01 17:05:31] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 17:05:31] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 89 ms.
[2024-06-01 17:05:31] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
FORMULA Peterson-COL-4-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2757 ms. (14 steps per ms) remains 4/10 properties
FORMULA Peterson-COL-4-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2095 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4754 ms. (8 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1780 ms. (22 steps per ms) remains 4/4 properties
[2024-06-01 17:05:34] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 17:05:35] [INFO ] Computed 19 invariants in 33 ms
[2024-06-01 17:05:35] [INFO ] State equation strengthened by 116 read => feed constraints.
Problem Peterson-COL-4-ReachabilityFireability-2024-02 is UNSAT
FORMULA Peterson-COL-4-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 17:05:39] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 55 ms to minimize.
[2024-06-01 17:05:39] [INFO ] Deduced a trap composed of 44 places in 352 ms of which 6 ms to minimize.
[2024-06-01 17:05:40] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 5 ms to minimize.
[2024-06-01 17:05:40] [INFO ] Deduced a trap composed of 92 places in 317 ms of which 5 ms to minimize.
[2024-06-01 17:05:40] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 5 ms to minimize.
[2024-06-01 17:05:41] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 5 ms to minimize.
[2024-06-01 17:05:41] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 4 ms to minimize.
[2024-06-01 17:05:41] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 5 ms to minimize.
[2024-06-01 17:05:42] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 5 ms to minimize.
[2024-06-01 17:05:42] [INFO ] Deduced a trap composed of 114 places in 282 ms of which 5 ms to minimize.
[2024-06-01 17:05:42] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 5 ms to minimize.
[2024-06-01 17:05:42] [INFO ] Deduced a trap composed of 88 places in 270 ms of which 5 ms to minimize.
[2024-06-01 17:05:43] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 5 ms to minimize.
[2024-06-01 17:05:43] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:05:43] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 4 ms to minimize.
SMT process timed out in 8958ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 440 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 39 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 480/480 places, 690/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 1178 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1624 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2487 ms. (16 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 268650 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :1 out of 3
Probabilistic random walk after 268650 steps, saw 63533 distinct states, run finished after 3011 ms. (steps per millisecond=89 ) properties seen :1
FORMULA Peterson-COL-4-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 17:05:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 17:05:48] [INFO ] Invariant cache hit.
[2024-06-01 17:05:48] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:05:50] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:05:51] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 4 ms to minimize.
[2024-06-01 17:05:51] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 4 ms to minimize.
[2024-06-01 17:05:51] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:05:51] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 4 ms to minimize.
[2024-06-01 17:05:52] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 4 ms to minimize.
[2024-06-01 17:05:52] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:05:52] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 6 ms to minimize.
[2024-06-01 17:05:53] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 5 ms to minimize.
[2024-06-01 17:05:53] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:05:53] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 4 ms to minimize.
[2024-06-01 17:05:53] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:05:54] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 5 ms to minimize.
[2024-06-01 17:05:54] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 5 ms to minimize.
[2024-06-01 17:05:54] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 5 ms to minimize.
[2024-06-01 17:05:54] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:05:55] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 4 ms to minimize.
[2024-06-01 17:05:55] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:05:55] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 5 ms to minimize.
[2024-06-01 17:05:56] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:05:56] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:05:56] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:05:56] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 4 ms to minimize.
[2024-06-01 17:05:57] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:05:57] [INFO ] Deduced a trap composed of 69 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:05:57] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:05:58] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:05:58] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:05:58] [INFO ] Deduced a trap composed of 61 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:05:59] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:05:59] [INFO ] Deduced a trap composed of 83 places in 245 ms of which 4 ms to minimize.
[2024-06-01 17:05:59] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:05:59] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:06:00] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:06:00] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:06:00] [INFO ] Deduced a trap composed of 58 places in 208 ms of which 4 ms to minimize.
[2024-06-01 17:06:01] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 4 ms to minimize.
[2024-06-01 17:06:01] [INFO ] Deduced a trap composed of 66 places in 570 ms of which 4 ms to minimize.
[2024-06-01 17:06:02] [INFO ] Deduced a trap composed of 103 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:06:02] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:06:02] [INFO ] Deduced a trap composed of 152 places in 244 ms of which 4 ms to minimize.
[2024-06-01 17:06:03] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 4 ms to minimize.
[2024-06-01 17:06:03] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 4 ms to minimize.
[2024-06-01 17:06:03] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:06:04] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 4 ms to minimize.
[2024-06-01 17:06:04] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:06:05] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:06:05] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 4 ms to minimize.
[2024-06-01 17:06:05] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:06:05] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:06:06] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:06:06] [INFO ] Deduced a trap composed of 79 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:06:06] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:06:07] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 4 ms to minimize.
[2024-06-01 17:06:07] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:06:07] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:06:07] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:06:08] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:06:08] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 4 ms to minimize.
[2024-06-01 17:06:08] [INFO ] Deduced a trap composed of 104 places in 224 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:06:08] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 4 ms to minimize.
[2024-06-01 17:06:09] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:06:10] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-06-01 17:06:12] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:06:12] [INFO ] Deduced a trap composed of 94 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:06:12] [INFO ] Deduced a trap composed of 98 places in 225 ms of which 4 ms to minimize.
[2024-06-01 17:06:13] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 4 ms to minimize.
[2024-06-01 17:06:13] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 4 ms to minimize.
[2024-06-01 17:06:13] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:06:15] [INFO ] Deduced a trap composed of 84 places in 226 ms of which 4 ms to minimize.
[2024-06-01 17:06:15] [INFO ] Deduced a trap composed of 85 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:06:15] [INFO ] Deduced a trap composed of 58 places in 223 ms of which 4 ms to minimize.
[2024-06-01 17:06:16] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 3 ms to minimize.
Problem Peterson-COL-4-ReachabilityFireability-2024-00 is UNSAT
FORMULA Peterson-COL-4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 17:06:19] [INFO ] Deduced a trap composed of 81 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:06:20] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 4 ms to minimize.
[2024-06-01 17:06:20] [INFO ] Deduced a trap composed of 96 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:06:20] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 17/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:06:20] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 3 ms to minimize.
[2024-06-01 17:06:21] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:06:21] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:06:21] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 630/1110 variables, 480/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 116/696 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 1/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 0/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1110 variables, 0/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 697 constraints, problems are : Problem set: 1 solved, 1 unsolved in 38741 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 81/81 constraints]
After SMT, in 40405ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1062 ms.
Support contains 435 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 21 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 480/480 places, 690/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1930 ms. (20 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548976 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548976 steps, saw 111433 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-06-01 17:06:33] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 17:06:33] [INFO ] Invariant cache hit.
[2024-06-01 17:06:33] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:06:35] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 4 ms to minimize.
[2024-06-01 17:06:35] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 4 ms to minimize.
[2024-06-01 17:06:35] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 5 ms to minimize.
[2024-06-01 17:06:36] [INFO ] Deduced a trap composed of 71 places in 274 ms of which 4 ms to minimize.
[2024-06-01 17:06:36] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:06:36] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:06:37] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 4 ms to minimize.
[2024-06-01 17:06:37] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 5 ms to minimize.
[2024-06-01 17:06:37] [INFO ] Deduced a trap composed of 36 places in 304 ms of which 5 ms to minimize.
[2024-06-01 17:06:37] [INFO ] Deduced a trap composed of 59 places in 310 ms of which 4 ms to minimize.
[2024-06-01 17:06:38] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 6 ms to minimize.
[2024-06-01 17:06:38] [INFO ] Deduced a trap composed of 93 places in 415 ms of which 4 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 4 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 80 places in 247 ms of which 4 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 3 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 3 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 3 ms to minimize.
[2024-06-01 17:06:41] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:06:41] [INFO ] Deduced a trap composed of 60 places in 426 ms of which 4 ms to minimize.
[2024-06-01 17:06:41] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 4 ms to minimize.
[2024-06-01 17:06:42] [INFO ] Deduced a trap composed of 96 places in 216 ms of which 4 ms to minimize.
[2024-06-01 17:06:42] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 4 ms to minimize.
[2024-06-01 17:06:42] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 4 ms to minimize.
[2024-06-01 17:06:42] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 4 ms to minimize.
[2024-06-01 17:06:43] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 4 ms to minimize.
[2024-06-01 17:06:43] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:06:43] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-06-01 17:06:43] [INFO ] Deduced a trap composed of 110 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:06:44] [INFO ] Deduced a trap composed of 102 places in 203 ms of which 4 ms to minimize.
[2024-06-01 17:06:44] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 4 ms to minimize.
[2024-06-01 17:06:44] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:06:44] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:06:45] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 4 ms to minimize.
[2024-06-01 17:06:45] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 4 ms to minimize.
[2024-06-01 17:06:45] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:06:45] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-06-01 17:06:46] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 4 ms to minimize.
[2024-06-01 17:06:46] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-06-01 17:06:46] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 4 ms to minimize.
[2024-06-01 17:06:46] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
[2024-06-01 17:06:46] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-06-01 17:06:47] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 3 ms to minimize.
[2024-06-01 17:06:47] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 4 ms to minimize.
[2024-06-01 17:06:47] [INFO ] Deduced a trap composed of 114 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:06:47] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 4 ms to minimize.
[2024-06-01 17:06:47] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:06:48] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-01 17:06:48] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 630/1110 variables, 480/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 116/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:06:53] [INFO ] Deduced a trap composed of 70 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:06:54] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 4 ms to minimize.
[2024-06-01 17:06:55] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:06:56] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:06:57] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-06-01 17:06:58] [INFO ] Deduced a trap composed of 122 places in 172 ms of which 4 ms to minimize.
[2024-06-01 17:06:58] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 4 ms to minimize.
[2024-06-01 17:06:59] [INFO ] Deduced a trap composed of 76 places in 246 ms of which 4 ms to minimize.
[2024-06-01 17:07:00] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-06-01 17:07:01] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 4 ms to minimize.
[2024-06-01 17:07:02] [INFO ] Deduced a trap composed of 130 places in 231 ms of which 4 ms to minimize.
[2024-06-01 17:07:02] [INFO ] Deduced a trap composed of 80 places in 231 ms of which 4 ms to minimize.
[2024-06-01 17:07:03] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
[2024-06-01 17:07:04] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 4 ms to minimize.
[2024-06-01 17:07:05] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-06-01 17:07:06] [INFO ] Deduced a trap composed of 80 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:07:06] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
[2024-06-01 17:07:07] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:07:08] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-06-01 17:07:09] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:07:11] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-06-01 17:07:11] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 17:07:12] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-06-01 17:07:13] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-06-01 17:07:14] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-06-01 17:07:14] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-06-01 17:07:15] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 3 ms to minimize.
[2024-06-01 17:07:17] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 9/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1110 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48059 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 82/82 constraints]
After SMT, in 49092ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 406 ms.
Support contains 435 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 19 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 20 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 17:07:23] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 17:07:23] [INFO ] Invariant cache hit.
[2024-06-01 17:07:23] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 17:07:23] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 17:07:23] [INFO ] Invariant cache hit.
[2024-06-01 17:07:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 17:07:23] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-01 17:07:24] [INFO ] Redundant transitions in 41 ms returned []
Running 685 sub problems to find dead transitions.
[2024-06-01 17:07:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 17:07:24] [INFO ] Invariant cache hit.
[2024-06-01 17:07:24] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 5 ms to minimize.
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 91 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 121 places in 251 ms of which 5 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 3 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 58 places in 364 ms of which 7 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 12 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 4 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 4 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 62 places in 282 ms of which 4 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 87 places in 393 ms of which 7 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 88 places in 278 ms of which 5 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 4 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 70 places in 376 ms of which 6 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 90 places in 351 ms of which 6 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 4 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 159 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 17:07:48] [INFO ] Deduced a trap composed of 80 places in 268 ms of which 4 ms to minimize.
[2024-06-01 17:07:48] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 5 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 2 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 3 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-06-01 17:07:50] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:07:50] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:07:50] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-06-01 17:07:50] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-06-01 17:07:51] [INFO ] Deduced a trap composed of 95 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:07:51] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 5 ms to minimize.
[2024-06-01 17:07:51] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:07:52] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 5 ms to minimize.
[2024-06-01 17:07:52] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 4 ms to minimize.
[2024-06-01 17:07:52] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:07:52] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:07:53] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 17:07:54] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-06-01 17:07:54] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 17:07:54] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
SMT process timed out in 30322ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 30337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31055 ms. Remains : 480/480 places, 690/690 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 480 transition count 630
Applied a total of 60 rules in 25 ms. Remains 480 /480 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 1 properties.
[2024-06-01 17:07:54] [INFO ] Invariant cache hit.
[2024-06-01 17:07:54] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-06-01 17:07:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2024-06-01 17:07:54] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:07:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-06-01 17:07:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2024-06-01 17:07:57] [INFO ] After 2938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:08:00] [INFO ] After 5474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:08:02] [INFO ] After 8123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 8569 ms.
[2024-06-01 17:08:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 17 ms.
[2024-06-01 17:08:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 11 ms.
[2024-06-01 17:08:03] [INFO ] Flatten gal took : 141 ms
Total runtime 153313 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-COL-4-ReachabilityFireability-2024-09
BK_STOP 1717261683537
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name Peterson-COL-4-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/1275/inv_0_
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-COL-4"
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-COL-4, 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-171654407200223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;