Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350700039.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717196152231

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:55:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:55:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:55:53] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-05-31 22:55:53] [INFO ] Transformed 5568 places.
[2024-05-31 22:55:53] [INFO ] Transformed 7799 transitions.
[2024-05-31 22:55:53] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (639 resets) in 1716 ms. (23 steps per ms) remains 10/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (172 resets) in 754 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (172 resets) in 305 ms. (130 steps per ms) remains 9/10 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (172 resets) in 1149 ms. (34 steps per ms) remains 8/9 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (172 resets) in 263 ms. (151 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (172 resets) in 258 ms. (154 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (172 resets) in 309 ms. (129 steps per ms) remains 7/8 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (172 resets) in 295 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (172 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (172 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
[2024-05-31 22:55:55] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2024-05-31 22:55:56] [INFO ] Computed 573 invariants in 316 ms
[2024-05-31 22:55:56] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 693/935 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/935 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/935 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/942 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/942 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 3115/4057 variables, 212/266 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4057 variables, 0/266 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1511/5568 variables, 307/573 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5568 variables, 0/573 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13095/13095 variables, and 6141 constraints, problems are : Problem set: 5 solved, 2 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 523/523 constraints, State Equation: 5568/5568 constraints, ReadFeed: 0/2178 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 728/789 variables, 23/25 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-31 22:56:01] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 22 ms to minimize.
[2024-05-31 22:56:02] [INFO ] Deduced a trap composed of 98 places in 286 ms of which 6 ms to minimize.
[2024-05-31 22:56:02] [INFO ] Deduced a trap composed of 128 places in 259 ms of which 4 ms to minimize.
[2024-05-31 22:56:02] [INFO ] Deduced a trap composed of 139 places in 287 ms of which 5 ms to minimize.
[2024-05-31 22:56:03] [INFO ] Deduced a trap composed of 291 places in 254 ms of which 5 ms to minimize.
[2024-05-31 22:56:03] [INFO ] Deduced a trap composed of 265 places in 251 ms of which 5 ms to minimize.
[2024-05-31 22:56:03] [INFO ] Deduced a trap composed of 181 places in 241 ms of which 4 ms to minimize.
[2024-05-31 22:56:03] [INFO ] Deduced a trap composed of 276 places in 253 ms of which 5 ms to minimize.
[2024-05-31 22:56:04] [INFO ] Deduced a trap composed of 272 places in 243 ms of which 4 ms to minimize.
[2024-05-31 22:56:04] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 5 ms to minimize.
[2024-05-31 22:56:04] [INFO ] Deduced a trap composed of 233 places in 246 ms of which 4 ms to minimize.
[2024-05-31 22:56:05] [INFO ] Deduced a trap composed of 241 places in 250 ms of which 4 ms to minimize.
[2024-05-31 22:56:05] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 4 ms to minimize.
[2024-05-31 22:56:05] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 5 ms to minimize.
[2024-05-31 22:56:05] [INFO ] Deduced a trap composed of 253 places in 247 ms of which 5 ms to minimize.
[2024-05-31 22:56:06] [INFO ] Deduced a trap composed of 265 places in 250 ms of which 4 ms to minimize.
[2024-05-31 22:56:06] [INFO ] Deduced a trap composed of 181 places in 251 ms of which 4 ms to minimize.
[2024-05-31 22:56:06] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 4 ms to minimize.
SMT process timed out in 10796ms, After SMT, problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.20 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1600 transitions
Trivial Post-agglo rules discarded 1600 transitions
Performed 1600 trivial Post agglomeration. Transition count delta: 1600
Iterating post reduction 0 with 1600 rules applied. Total rules applied 1601 place count 5536 transition count 6199
Reduce places removed 1600 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 1624 rules applied. Total rules applied 3225 place count 3936 transition count 6175
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 3249 place count 3912 transition count 6175
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 3249 place count 3912 transition count 5974
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 3651 place count 3711 transition count 5974
Discarding 1417 places :
Symmetric choice reduction at 3 with 1417 rule applications. Total rules 5068 place count 2294 transition count 4557
Iterating global reduction 3 with 1417 rules applied. Total rules applied 6485 place count 2294 transition count 4557
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6485 place count 2294 transition count 4552
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 6495 place count 2289 transition count 4552
Discarding 217 places :
Symmetric choice reduction at 3 with 217 rule applications. Total rules 6712 place count 2072 transition count 3250
Iterating global reduction 3 with 217 rules applied. Total rules applied 6929 place count 2072 transition count 3250
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 6961 place count 2056 transition count 3234
Free-agglomeration rule (complex) applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 7074 place count 2056 transition count 3121
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 3 with 113 rules applied. Total rules applied 7187 place count 1943 transition count 3121
Partial Free-agglomeration rule applied 116 times.
Drop transitions (Partial Free agglomeration) removed 116 transitions
Iterating global reduction 4 with 116 rules applied. Total rules applied 7303 place count 1943 transition count 3121
Applied a total of 7303 rules in 1536 ms. Remains 1943 /5568 variables (removed 3625) and now considering 3121/7799 (removed 4678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1550 ms. Remains : 1943/5568 places, 3121/7799 transitions.
RANDOM walk for 40000 steps (909 resets) in 598 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (184 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (188 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 65227 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 65227 steps, saw 29717 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 22:56:11] [INFO ] Flow matrix only has 2736 transitions (discarded 385 similar events)
// Phase 1: matrix 2736 rows 1943 cols
[2024-05-31 22:56:11] [INFO ] Computed 541 invariants in 62 ms
[2024-05-31 22:56:11] [INFO ] State equation strengthened by 1093 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1222/1283 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1283 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/1286 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1286 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 563/1849 variables, 423/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1849 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/1859 variables, 10/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1859 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 84/1943 variables, 84/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1943 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2736/4679 variables, 1943/2484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4679 variables, 1093/3577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4679 variables, 0/3577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4679 variables, 0/3577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4679/4679 variables, and 3577 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 508/508 constraints, State Equation: 1943/1943 constraints, ReadFeed: 1093/1093 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/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1222/1283 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1283 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:56:14] [INFO ] Deduced a trap composed of 428 places in 488 ms of which 6 ms to minimize.
[2024-05-31 22:56:14] [INFO ] Deduced a trap composed of 532 places in 473 ms of which 6 ms to minimize.
[2024-05-31 22:56:15] [INFO ] Deduced a trap composed of 550 places in 475 ms of which 7 ms to minimize.
[2024-05-31 22:56:15] [INFO ] Deduced a trap composed of 459 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:56:16] [INFO ] Deduced a trap composed of 438 places in 469 ms of which 6 ms to minimize.
[2024-05-31 22:56:16] [INFO ] Deduced a trap composed of 458 places in 463 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1283 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:56:17] [INFO ] Deduced a trap composed of 459 places in 472 ms of which 6 ms to minimize.
[2024-05-31 22:56:17] [INFO ] Deduced a trap composed of 488 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:56:18] [INFO ] Deduced a trap composed of 464 places in 478 ms of which 6 ms to minimize.
[2024-05-31 22:56:18] [INFO ] Deduced a trap composed of 474 places in 462 ms of which 6 ms to minimize.
[2024-05-31 22:56:19] [INFO ] Deduced a trap composed of 448 places in 611 ms of which 8 ms to minimize.
[2024-05-31 22:56:20] [INFO ] Deduced a trap composed of 192 places in 599 ms of which 8 ms to minimize.
[2024-05-31 22:56:20] [INFO ] Deduced a trap composed of 192 places in 615 ms of which 8 ms to minimize.
[2024-05-31 22:56:21] [INFO ] Deduced a trap composed of 209 places in 592 ms of which 7 ms to minimize.
[2024-05-31 22:56:22] [INFO ] Deduced a trap composed of 192 places in 631 ms of which 8 ms to minimize.
[2024-05-31 22:56:22] [INFO ] Deduced a trap composed of 213 places in 630 ms of which 8 ms to minimize.
[2024-05-31 22:56:23] [INFO ] Deduced a trap composed of 447 places in 520 ms of which 10 ms to minimize.
[2024-05-31 22:56:23] [INFO ] Deduced a trap composed of 447 places in 510 ms of which 7 ms to minimize.
[2024-05-31 22:56:24] [INFO ] Deduced a trap composed of 524 places in 512 ms of which 6 ms to minimize.
[2024-05-31 22:56:24] [INFO ] Deduced a trap composed of 522 places in 501 ms of which 7 ms to minimize.
[2024-05-31 22:56:25] [INFO ] Deduced a trap composed of 547 places in 515 ms of which 7 ms to minimize.
[2024-05-31 22:56:25] [INFO ] Deduced a trap composed of 596 places in 486 ms of which 8 ms to minimize.
[2024-05-31 22:56:26] [INFO ] Deduced a trap composed of 557 places in 518 ms of which 7 ms to minimize.
[2024-05-31 22:56:26] [INFO ] Deduced a trap composed of 556 places in 496 ms of which 7 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 577 places in 521 ms of which 7 ms to minimize.
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 554 places in 499 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1283 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:56:28] [INFO ] Deduced a trap composed of 484 places in 457 ms of which 6 ms to minimize.
[2024-05-31 22:56:29] [INFO ] Deduced a trap composed of 485 places in 491 ms of which 6 ms to minimize.
[2024-05-31 22:56:29] [INFO ] Deduced a trap composed of 517 places in 494 ms of which 6 ms to minimize.
[2024-05-31 22:56:30] [INFO ] Deduced a trap composed of 524 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:56:30] [INFO ] Deduced a trap composed of 708 places in 481 ms of which 7 ms to minimize.
[2024-05-31 22:56:31] [INFO ] Deduced a trap composed of 517 places in 495 ms of which 6 ms to minimize.
[2024-05-31 22:56:31] [INFO ] Deduced a trap composed of 484 places in 480 ms of which 6 ms to minimize.
[2024-05-31 22:56:32] [INFO ] Deduced a trap composed of 484 places in 474 ms of which 6 ms to minimize.
[2024-05-31 22:56:32] [INFO ] Deduced a trap composed of 517 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:56:33] [INFO ] Deduced a trap composed of 484 places in 481 ms of which 6 ms to minimize.
[2024-05-31 22:56:33] [INFO ] Deduced a trap composed of 517 places in 474 ms of which 6 ms to minimize.
[2024-05-31 22:56:34] [INFO ] Deduced a trap composed of 517 places in 480 ms of which 9 ms to minimize.
[2024-05-31 22:56:34] [INFO ] Deduced a trap composed of 614 places in 473 ms of which 6 ms to minimize.
[2024-05-31 22:56:35] [INFO ] Deduced a trap composed of 552 places in 482 ms of which 7 ms to minimize.
[2024-05-31 22:56:35] [INFO ] Deduced a trap composed of 484 places in 488 ms of which 7 ms to minimize.
[2024-05-31 22:56:36] [INFO ] Deduced a trap composed of 610 places in 474 ms of which 7 ms to minimize.
[2024-05-31 22:56:36] [INFO ] Deduced a trap composed of 732 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:56:37] [INFO ] Deduced a trap composed of 517 places in 449 ms of which 5 ms to minimize.
[2024-05-31 22:56:37] [INFO ] Deduced a trap composed of 519 places in 479 ms of which 6 ms to minimize.
[2024-05-31 22:56:38] [INFO ] Deduced a trap composed of 484 places in 466 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:56:38] [INFO ] Deduced a trap composed of 517 places in 490 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1283 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/1286 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1286 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 563/1849 variables, 423/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:56:39] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:56:40] [INFO ] Deduced a trap composed of 287 places in 1130 ms of which 13 ms to minimize.
[2024-05-31 22:56:41] [INFO ] Deduced a trap composed of 242 places in 1119 ms of which 12 ms to minimize.
[2024-05-31 22:56:42] [INFO ] Deduced a trap composed of 218 places in 1114 ms of which 12 ms to minimize.
[2024-05-31 22:56:43] [INFO ] Deduced a trap composed of 410 places in 1104 ms of which 12 ms to minimize.
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 270 places in 1115 ms of which 12 ms to minimize.
[2024-05-31 22:56:46] [INFO ] Deduced a trap composed of 218 places in 1101 ms of which 11 ms to minimize.
[2024-05-31 22:56:47] [INFO ] Deduced a trap composed of 220 places in 1095 ms of which 12 ms to minimize.
[2024-05-31 22:56:48] [INFO ] Deduced a trap composed of 258 places in 1085 ms of which 12 ms to minimize.
[2024-05-31 22:56:49] [INFO ] Deduced a trap composed of 262 places in 1084 ms of which 12 ms to minimize.
[2024-05-31 22:56:50] [INFO ] Deduced a trap composed of 299 places in 1072 ms of which 12 ms to minimize.
[2024-05-31 22:56:51] [INFO ] Deduced a trap composed of 263 places in 1102 ms of which 12 ms to minimize.
[2024-05-31 22:56:52] [INFO ] Deduced a trap composed of 269 places in 1073 ms of which 11 ms to minimize.
[2024-05-31 22:56:53] [INFO ] Deduced a trap composed of 252 places in 1058 ms of which 11 ms to minimize.
[2024-05-31 22:56:55] [INFO ] Deduced a trap composed of 347 places in 1084 ms of which 12 ms to minimize.
[2024-05-31 22:56:56] [INFO ] Deduced a trap composed of 394 places in 1056 ms of which 11 ms to minimize.
[2024-05-31 22:56:57] [INFO ] Deduced a trap composed of 392 places in 1093 ms of which 12 ms to minimize.
[2024-05-31 22:56:58] [INFO ] Deduced a trap composed of 418 places in 1093 ms of which 11 ms to minimize.
[2024-05-31 22:56:59] [INFO ] Deduced a trap composed of 413 places in 1092 ms of which 11 ms to minimize.
SMT process timed out in 47988ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 1943 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1943/1943 places, 3121/3121 transitions.
Applied a total of 0 rules in 101 ms. Remains 1943 /1943 variables (removed 0) and now considering 3121/3121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1943/1943 places, 3121/3121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1943/1943 places, 3121/3121 transitions.
Applied a total of 0 rules in 94 ms. Remains 1943 /1943 variables (removed 0) and now considering 3121/3121 (removed 0) transitions.
[2024-05-31 22:56:59] [INFO ] Flow matrix only has 2736 transitions (discarded 385 similar events)
[2024-05-31 22:56:59] [INFO ] Invariant cache hit.
[2024-05-31 22:57:01] [INFO ] Implicit Places using invariants in 2095 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 20, 26, 35, 45, 57, 71, 86, 101, 102, 103, 104, 105, 106, 107, 119, 129, 137, 143, 147, 149, 164, 170, 173, 174, 175, 176, 177, 178, 179, 186, 193, 201, 211, 223, 236, 249, 250, 251, 253, 254, 255, 265, 273, 279, 286, 288, 290, 305, 311, 314, 315, 316, 317, 318, 319, 320, 322, 324, 329, 335, 343, 354, 365, 376, 377, 378, 379, 380, 381, 382, 390, 396, 400, 402, 404, 406, 421, 427, 430, 431, 432, 433, 434, 435, 436, 438, 440, 443, 447, 453, 461, 470, 479, 480, 481, 482, 483, 484, 485, 492, 496, 498, 500, 502, 504, 526, 529, 530, 531, 532, 533, 534, 535, 537, 539, 541, 544, 549, 555, 562, 570, 571, 572, 573, 574, 575, 579, 581, 583, 585, 590, 592, 607, 613, 616, 617, 618, 619, 620, 621, 622, 624, 626, 628, 630, 632, 636, 641, 646, 647, 648, 649, 650, 651, 652, 654, 656, 658, 661, 663, 665, 680, 686, 689, 690, 691, 692, 693, 694, 695, 697, 699, 701, 703, 705, 707, 710, 713, 714, 716, 717, 718, 719, 721, 726, 728, 731, 733, 735, 750, 756, 759, 761, 762, 763, 764, 765, 767, 769, 771, 773, 775, 780, 782, 785, 786, 787, 788, 789, 790, 791, 793, 795, 797, 799, 801, 803, 818, 820, 823, 826, 827, 828, 829, 830, 831, 832, 834, 836, 838, 840, 842, 844, 846, 849, 850, 851, 852, 853, 854, 855, 857, 859, 861, 863, 865, 867, 882, 888, 891, 892, 893, 894, 895, 896, 897, 900, 902, 904, 906, 908, 910, 912, 915, 916, 917, 918, 919, 920, 921, 923, 925, 927, 929, 931, 933, 948, 954, 957, 958, 959, 960, 961, 962, 963, 965, 967, 969, 971, 973, 975, 977, 981, 982, 983, 984, 985, 986, 987, 990, 992, 994, 996, 998, 1000, 1015, 1021, 1024, 1025, 1026, 1027, 1028, 1030, 1032, 1034, 1036, 1038, 1040, 1042, 1049, 1056, 1057, 1058, 1059, 1060, 1061, 1065, 1067, 1069, 1072, 1074, 1078, 1094, 1100, 1103, 1105, 1106, 1107, 1108, 1109, 1111, 1113, 1115, 1117, 1121, 1125, 1131, 1140, 1141, 1142, 1143, 1144, 1145, 1154, 1158, 1160, 1162, 1164, 1167, 1183, 1189, 1192, 1194, 1195, 1196, 1197, 1198, 1200, 1202, 1204, 1210, 1214, 1220, 1228, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1252, 1258, 1262, 1264, 1266, 1268, 1283, 1289, 1293, 1294, 1295, 1296, 1297, 1298, 1302, 1304, 1306, 1311, 1317, 1325, 1335, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1363, 1371, 1377, 1381, 1383, 1385, 1401, 1407, 1410, 1411, 1412, 1415, 1416, 1417, 1421, 1423, 1427, 1434, 1442, 1452, 1464, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1497, 1508, 1516, 1523, 1528, 1530, 1545, 1547, 1550, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1561, 1565, 1571, 1580, 1590, 1602, 1616, 1632, 1633, 1634, 1635, 1636, 1637, 1638, 1652, 1664, 1674, 1682, 1688, 1692, 1707]
[2024-05-31 22:57:01] [INFO ] Actually due to overlaps returned [164, 305, 421, 607, 680, 750, 818, 882, 948, 1015, 1094, 1183, 1283, 1401, 1545, 1707, 4, 10, 11, 12, 13, 14, 15, 20, 101, 102, 103, 104, 105, 106, 173, 174, 175, 176, 177, 178, 249, 250, 251, 253, 254, 314, 315, 316, 317, 318, 319, 322, 376, 377, 378, 379, 380, 381, 430, 431, 432, 433, 434, 435, 479, 480, 481, 482, 483, 484, 529, 530, 531, 532, 533, 534, 539, 570, 571, 572, 573, 574, 616, 617, 618, 619, 620, 621, 626, 646, 647, 648, 649, 650, 651, 689, 690, 691, 692, 693, 694, 699, 713, 714, 716, 717, 718, 759, 761, 762, 763, 764, 769, 785, 786, 787, 788, 789, 790, 820, 826, 827, 828, 829, 830, 831, 836, 849, 850, 851, 852, 853, 854, 891, 892, 893, 894, 895, 896, 902, 915, 916, 917, 918, 919, 920, 957, 958, 959, 960, 961, 962, 967, 981, 982, 983, 984, 985, 986, 1024, 1025, 1026, 1027, 1028, 1034, 1056, 1057, 1058, 1059, 1060, 1103, 1105, 1106, 1107, 1108, 1113, 1140, 1141, 1142, 1143, 1144, 1192, 1194, 1195, 1196, 1197, 1202, 1238, 1239, 1240, 1241, 1242, 1243, 1293, 1294, 1295, 1296, 1297, 1304, 1347, 1348, 1349, 1350, 1351, 1352, 1410, 1411, 1412, 1415, 1416, 1423, 1478, 1479, 1480, 1481, 1482, 1483, 1547, 1553, 1554, 1555, 1556, 1557, 1558, 1565, 1632, 1633, 1634, 1635, 1636, 1637]
Discarding 227 places :
Implicit Place search using SMT only with invariants took 2109 ms to find 227 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1716/1943 places, 3121/3121 transitions.
Discarding 181 places :
Symmetric choice reduction at 0 with 181 rule applications. Total rules 181 place count 1535 transition count 2940
Iterating global reduction 0 with 181 rules applied. Total rules applied 362 place count 1535 transition count 2940
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 542 place count 1355 transition count 2760
Iterating global reduction 0 with 180 rules applied. Total rules applied 722 place count 1355 transition count 2760
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 742 place count 1335 transition count 2640
Iterating global reduction 0 with 20 rules applied. Total rules applied 762 place count 1335 transition count 2640
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 765 place count 1335 transition count 2637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 768 place count 1332 transition count 2637
Applied a total of 768 rules in 244 ms. Remains 1332 /1716 variables (removed 384) and now considering 2637/3121 (removed 484) transitions.
[2024-05-31 22:57:02] [INFO ] Flow matrix only has 2252 transitions (discarded 385 similar events)
// Phase 1: matrix 2252 rows 1332 cols
[2024-05-31 22:57:02] [INFO ] Computed 314 invariants in 36 ms
[2024-05-31 22:57:03] [INFO ] Implicit Places using invariants in 1138 ms returned [6, 9, 18, 27, 37, 49, 63, 78, 93, 105, 115, 123, 129, 133, 135, 154, 156, 163, 170, 178, 188, 200, 213, 227, 237, 245, 251, 258, 260, 262, 271, 273, 276, 281, 287, 295, 306, 317, 327, 335, 341, 345, 347, 349, 351, 359, 361, 363, 365, 368, 372, 378, 386, 395, 403, 410, 414, 416, 418, 420, 422, 432, 435, 437, 440, 443, 448, 454, 461, 469, 473, 475, 477, 479, 484, 486, 496, 498, 500, 503, 505, 507, 511, 516, 520, 522, 524, 526, 529, 531, 533, 541, 543, 545, 548, 550, 552, 554, 557, 561, 563, 568, 570, 573, 575, 577, 586, 590, 592, 595, 597, 599, 604, 606, 608, 610, 612, 614, 616, 618, 620, 627, 629, 631, 634, 636, 638, 640, 642, 644, 646, 648, 650, 652, 654, 656, 663, 665, 668, 671, 673, 675, 677, 679, 681, 683, 685, 687, 689, 691, 693, 701, 703, 705, 708, 710, 712, 714, 716, 720, 722, 724, 726, 728, 730, 732, 740, 744, 746, 749, 751, 753, 755, 762, 769, 773, 775, 777, 780, 782, 786, 797, 801, 803, 806, 808, 812, 816, 822, 831, 840, 844, 846, 848, 850, 853, 864, 868, 870, 873, 879, 883, 889, 897, 906, 914, 920, 924, 926, 928, 930, 939, 943, 947, 950, 955, 961, 969, 979, 990, 1000, 1008, 1014, 1018, 1020, 1022, 1032, 1037, 1041, 1046, 1053, 1061, 1071, 1083, 1096, 1109, 1120, 1128, 1135, 1140, 1142, 1149, 1151, 1153, 1162, 1171, 1181, 1193, 1207, 1222, 1236, 1248, 1258, 1266, 1272, 1276]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1143 ms to find 256 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1076/1943 places, 2637/3121 transitions.
Applied a total of 0 rules in 58 ms. Remains 1076 /1076 variables (removed 0) and now considering 2637/2637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3649 ms. Remains : 1076/1943 places, 2637/3121 transitions.
RANDOM walk for 40000 steps (955 resets) in 424 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (139 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81264 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81264 steps, saw 35043 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-31 22:57:06] [INFO ] Flow matrix only has 2252 transitions (discarded 385 similar events)
// Phase 1: matrix 2252 rows 1076 cols
[2024-05-31 22:57:06] [INFO ] Computed 58 invariants in 23 ms
[2024-05-31 22:57:06] [INFO ] State equation strengthened by 993 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 687/748 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/748 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/751 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 313/1064 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1074 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1074 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/1076 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1076 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2252/3328 variables, 1076/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3328 variables, 993/2127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3328 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3328 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3328/3328 variables, and 2127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1076/1076 constraints, ReadFeed: 993/993 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/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 687/748 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:08] [INFO ] Deduced a trap composed of 254 places in 277 ms of which 4 ms to minimize.
[2024-05-31 22:57:08] [INFO ] Deduced a trap composed of 275 places in 272 ms of which 4 ms to minimize.
[2024-05-31 22:57:08] [INFO ] Deduced a trap composed of 293 places in 288 ms of which 5 ms to minimize.
[2024-05-31 22:57:09] [INFO ] Deduced a trap composed of 312 places in 277 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/748 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/748 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/751 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 313/1064 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:09] [INFO ] Deduced a trap composed of 48 places in 461 ms of which 7 ms to minimize.
[2024-05-31 22:57:10] [INFO ] Deduced a trap composed of 152 places in 471 ms of which 7 ms to minimize.
[2024-05-31 22:57:10] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:57:10] [INFO ] Deduced a trap composed of 157 places in 466 ms of which 6 ms to minimize.
[2024-05-31 22:57:11] [INFO ] Deduced a trap composed of 140 places in 484 ms of which 7 ms to minimize.
[2024-05-31 22:57:11] [INFO ] Deduced a trap composed of 192 places in 452 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1064 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1064 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/1074 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:12] [INFO ] Deduced a trap composed of 173 places in 440 ms of which 6 ms to minimize.
[2024-05-31 22:57:12] [INFO ] Deduced a trap composed of 179 places in 418 ms of which 6 ms to minimize.
[2024-05-31 22:57:13] [INFO ] Deduced a trap composed of 112 places in 461 ms of which 7 ms to minimize.
[2024-05-31 22:57:13] [INFO ] Deduced a trap composed of 210 places in 413 ms of which 6 ms to minimize.
[2024-05-31 22:57:14] [INFO ] Deduced a trap composed of 112 places in 468 ms of which 6 ms to minimize.
[2024-05-31 22:57:14] [INFO ] Deduced a trap composed of 213 places in 450 ms of which 7 ms to minimize.
[2024-05-31 22:57:15] [INFO ] Deduced a trap composed of 135 places in 471 ms of which 6 ms to minimize.
[2024-05-31 22:57:15] [INFO ] Deduced a trap composed of 222 places in 444 ms of which 7 ms to minimize.
[2024-05-31 22:57:16] [INFO ] Deduced a trap composed of 129 places in 470 ms of which 6 ms to minimize.
[2024-05-31 22:57:16] [INFO ] Deduced a trap composed of 274 places in 426 ms of which 7 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 266 places in 435 ms of which 6 ms to minimize.
[2024-05-31 22:57:17] [INFO ] Deduced a trap composed of 101 places in 491 ms of which 7 ms to minimize.
[2024-05-31 22:57:18] [INFO ] Deduced a trap composed of 314 places in 419 ms of which 6 ms to minimize.
[2024-05-31 22:57:18] [INFO ] Deduced a trap composed of 258 places in 430 ms of which 6 ms to minimize.
[2024-05-31 22:57:18] [INFO ] Deduced a trap composed of 234 places in 445 ms of which 7 ms to minimize.
[2024-05-31 22:57:19] [INFO ] Deduced a trap composed of 322 places in 417 ms of which 6 ms to minimize.
[2024-05-31 22:57:19] [INFO ] Deduced a trap composed of 212 places in 437 ms of which 6 ms to minimize.
[2024-05-31 22:57:20] [INFO ] Deduced a trap composed of 142 places in 469 ms of which 6 ms to minimize.
[2024-05-31 22:57:20] [INFO ] Deduced a trap composed of 212 places in 430 ms of which 7 ms to minimize.
[2024-05-31 22:57:21] [INFO ] Deduced a trap composed of 245 places in 415 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1074 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:21] [INFO ] Deduced a trap composed of 189 places in 473 ms of which 6 ms to minimize.
[2024-05-31 22:57:22] [INFO ] Deduced a trap composed of 167 places in 451 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1074 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1076 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1076 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2252/3328 variables, 1076/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3328 variables, 993/2159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3328 variables, 2/2161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:25] [INFO ] Deduced a trap composed of 124 places in 469 ms of which 7 ms to minimize.
[2024-05-31 22:57:26] [INFO ] Deduced a trap composed of 151 places in 452 ms of which 6 ms to minimize.
[2024-05-31 22:57:27] [INFO ] Deduced a trap composed of 145 places in 451 ms of which 6 ms to minimize.
[2024-05-31 22:57:28] [INFO ] Deduced a trap composed of 134 places in 446 ms of which 6 ms to minimize.
[2024-05-31 22:57:29] [INFO ] Deduced a trap composed of 134 places in 437 ms of which 6 ms to minimize.
[2024-05-31 22:57:30] [INFO ] Deduced a trap composed of 125 places in 451 ms of which 6 ms to minimize.
[2024-05-31 22:57:31] [INFO ] Deduced a trap composed of 163 places in 451 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3328 variables, 7/2168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:35] [INFO ] Deduced a trap composed of 147 places in 446 ms of which 6 ms to minimize.
[2024-05-31 22:57:36] [INFO ] Deduced a trap composed of 138 places in 447 ms of which 6 ms to minimize.
[2024-05-31 22:57:37] [INFO ] Deduced a trap composed of 143 places in 451 ms of which 6 ms to minimize.
[2024-05-31 22:57:38] [INFO ] Deduced a trap composed of 132 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:57:38] [INFO ] Deduced a trap composed of 141 places in 441 ms of which 6 ms to minimize.
[2024-05-31 22:57:39] [INFO ] Deduced a trap composed of 201 places in 457 ms of which 6 ms to minimize.
[2024-05-31 22:57:40] [INFO ] Deduced a trap composed of 142 places in 461 ms of which 7 ms to minimize.
[2024-05-31 22:57:42] [INFO ] Deduced a trap composed of 136 places in 463 ms of which 6 ms to minimize.
[2024-05-31 22:57:43] [INFO ] Deduced a trap composed of 146 places in 461 ms of which 6 ms to minimize.
[2024-05-31 22:57:44] [INFO ] Deduced a trap composed of 135 places in 465 ms of which 6 ms to minimize.
[2024-05-31 22:57:46] [INFO ] Deduced a trap composed of 129 places in 478 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3328 variables, 11/2179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 178 places in 443 ms of which 7 ms to minimize.
[2024-05-31 22:57:53] [INFO ] Deduced a trap composed of 152 places in 443 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3328 variables, 2/2181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3328 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/3328 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3328/3328 variables, and 2181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 53974 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1076/1076 constraints, ReadFeed: 993/993 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 52/52 constraints]
After SMT, in 55235ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 61 out of 1076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 2637/2637 transitions.
Applied a total of 0 rules in 57 ms. Remains 1076 /1076 variables (removed 0) and now considering 2637/2637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1076/1076 places, 2637/2637 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1076/1076 places, 2637/2637 transitions.
Applied a total of 0 rules in 56 ms. Remains 1076 /1076 variables (removed 0) and now considering 2637/2637 (removed 0) transitions.
[2024-05-31 22:58:02] [INFO ] Flow matrix only has 2252 transitions (discarded 385 similar events)
[2024-05-31 22:58:02] [INFO ] Invariant cache hit.
[2024-05-31 22:58:02] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-31 22:58:02] [INFO ] Flow matrix only has 2252 transitions (discarded 385 similar events)
[2024-05-31 22:58:02] [INFO ] Invariant cache hit.
[2024-05-31 22:58:03] [INFO ] State equation strengthened by 993 read => feed constraints.
[2024-05-31 22:58:16] [INFO ] Implicit Places using invariants and state equation in 14100 ms returned []
Implicit Place search using SMT with State Equation took 14886 ms to find 0 implicit places.
[2024-05-31 22:58:17] [INFO ] Redundant transitions in 143 ms returned []
Running 2575 sub problems to find dead transitions.
[2024-05-31 22:58:17] [INFO ] Flow matrix only has 2252 transitions (discarded 385 similar events)
[2024-05-31 22:58:17] [INFO ] Invariant cache hit.
[2024-05-31 22:58:17] [INFO ] State equation strengthened by 993 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1074 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2575 unsolved
SMT process timed out in 32993ms, After SMT, problems are : Problem set: 0 solved, 2575 unsolved
Search for dead transitions found 0 dead transitions in 33018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48128 ms. Remains : 1076/1076 places, 2637/2637 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 867 edges and 1076 vertex of which 16 / 1076 are part of one of the 1 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 259 transitions
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 643 transitions.
Graph (complete) has 3320 edges and 1061 vertex of which 1053 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 1037 transition count 1911
Reduce places removed 81 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 1 with 228 rules applied. Total rules applied 313 place count 956 transition count 1764
Reduce places removed 72 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 2 with 186 rules applied. Total rules applied 499 place count 884 transition count 1650
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 132 rules applied. Total rules applied 631 place count 835 transition count 1567
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 97 rules applied. Total rules applied 728 place count 795 transition count 1510
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 5 with 56 rules applied. Total rules applied 784 place count 771 transition count 1478
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 30 rules applied. Total rules applied 814 place count 756 transition count 1463
Reduce places removed 6 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 7 with 21 rules applied. Total rules applied 835 place count 750 transition count 1448
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 853 place count 735 transition count 1445
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 853 place count 735 transition count 1423
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 897 place count 713 transition count 1423
Discarding 177 places :
Symmetric choice reduction at 9 with 177 rule applications. Total rules 1074 place count 536 transition count 1243
Iterating global reduction 9 with 177 rules applied. Total rules applied 1251 place count 536 transition count 1243
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 9 with 100 rules applied. Total rules applied 1351 place count 536 transition count 1143
Performed 246 Post agglomeration using F-continuation condition.Transition count delta: 246
Deduced a syphon composed of 246 places in 0 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 10 with 492 rules applied. Total rules applied 1843 place count 290 transition count 897
Drop transitions (Empty/Sink Transition effects.) removed 218 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 232 transitions.
Iterating post reduction 10 with 232 rules applied. Total rules applied 2075 place count 290 transition count 665
Discarding 40 places :
Symmetric choice reduction at 11 with 40 rule applications. Total rules 2115 place count 250 transition count 585
Iterating global reduction 11 with 40 rules applied. Total rules applied 2155 place count 250 transition count 585
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 2170 place count 250 transition count 570
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 2186 place count 242 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 2223 place count 242 transition count 590
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 2224 place count 242 transition count 589
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 2 rules applied. Total rules applied 2226 place count 241 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2227 place count 240 transition count 588
Discarding 15 places :
Symmetric choice reduction at 15 with 15 rule applications. Total rules 2242 place count 225 transition count 538
Iterating global reduction 15 with 15 rules applied. Total rules applied 2257 place count 225 transition count 538
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 15 with 19 rules applied. Total rules applied 2276 place count 225 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2278 place count 224 transition count 538
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2279 place count 224 transition count 537
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2280 place count 223 transition count 537
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 17 with 13 rules applied. Total rules applied 2293 place count 223 transition count 524
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 17 with 13 rules applied. Total rules applied 2306 place count 210 transition count 524
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 18 with 26 rules applied. Total rules applied 2332 place count 210 transition count 524
Partial Post-agglomeration rule applied 58 times.
Drop transitions (Partial Post agglomeration) removed 58 transitions
Iterating global reduction 18 with 58 rules applied. Total rules applied 2390 place count 210 transition count 524
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 2395 place count 205 transition count 519
Iterating global reduction 18 with 5 rules applied. Total rules applied 2400 place count 205 transition count 519
Applied a total of 2400 rules in 651 ms. Remains 205 /1076 variables (removed 871) and now considering 519/2637 (removed 2118) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 519 rows 205 cols
[2024-05-31 22:58:50] [INFO ] Computed 35 invariants in 7 ms
[2024-05-31 22:58:50] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-31 22:58:50] [INFO ] [Real]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-31 22:58:51] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:58:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 22:58:51] [INFO ] [Nat]Absence check using 12 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-31 22:58:51] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:58:51] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:58:51] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1476 ms.
[2024-05-31 22:58:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 22:58:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1076 places, 2637 transitions and 12298 arcs took 21 ms.
[2024-05-31 22:58:52] [INFO ] Flatten gal took : 211 ms
Total runtime 178747 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-12

BK_STOP 1717196332332

--------------------
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 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2023-07
rfs formula type AG
rfs formula formula --invariant=/tmp/1016/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1016/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350700039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;