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.r536-tall-171690531700135.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 StigmergyCommit-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K 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 StigmergyCommit-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717230003192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:20:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:20:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:20:04] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-01 08:20:04] [INFO ] Transformed 1534 places.
[2024-06-01 08:20:04] [INFO ] Transformed 2136 transitions.
[2024-06-01 08:20:04] [INFO ] Found NUPN structural information;
[2024-06-01 08:20:04] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (418 resets) in 1522 ms. (26 steps per ms) remains 14/16 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (78 resets) in 387 ms. (103 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (82 resets) in 672 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (75 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (77 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (77 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (82 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (63 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (78 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (77 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (75 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
// Phase 1: matrix 2136 rows 1534 cols
[2024-06-01 08:20:06] [INFO ] Computed 6 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1332/1534 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1332/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2136/3670 variables, 1534/3074 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 08:20:09] [INFO ] Deduced a trap composed of 398 places in 485 ms of which 52 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3670 variables, 1/3075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3670 variables, 0/3075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3670/3670 variables, and 3075 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5067 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1534/1534 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1332/1534 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1332/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 399 places in 438 ms of which 8 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 399 places in 437 ms of which 7 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 399 places in 380 ms of which 12 ms to minimize.
[2024-06-01 08:20:14] [INFO ] Deduced a trap composed of 489 places in 430 ms of which 6 ms to minimize.
[2024-06-01 08:20:14] [INFO ] Deduced a trap composed of 483 places in 450 ms of which 6 ms to minimize.
[2024-06-01 08:20:15] [INFO ] Deduced a trap composed of 402 places in 360 ms of which 5 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityFireability-2024-09 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 08:20:15] [INFO ] Deduced a trap composed of 206 places in 412 ms of which 7 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 300 places in 465 ms of which 6 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 399 places in 380 ms of which 5 ms to minimize.
SMT process timed out in 10782ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 184 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1109 edges and 1534 vertex of which 53 / 1534 are part of one of the 9 SCC in 6 ms
Free SCC test removed 44 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 2220 edges and 1490 vertex of which 1482 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 778 transitions
Trivial Post-agglo rules discarded 778 transitions
Performed 778 trivial Post agglomeration. Transition count delta: 778
Iterating post reduction 0 with 779 rules applied. Total rules applied 781 place count 1482 transition count 1297
Reduce places removed 778 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 785 rules applied. Total rules applied 1566 place count 704 transition count 1290
Reduce places removed 3 places and 0 transitions.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Iterating post reduction 2 with 128 rules applied. Total rules applied 1694 place count 701 transition count 1165
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 129 rules applied. Total rules applied 1823 place count 576 transition count 1161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1825 place count 574 transition count 1161
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 68 Pre rules applied. Total rules applied 1825 place count 574 transition count 1093
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 1961 place count 506 transition count 1093
Discarding 80 places :
Symmetric choice reduction at 5 with 80 rule applications. Total rules 2041 place count 426 transition count 1013
Iterating global reduction 5 with 80 rules applied. Total rules applied 2121 place count 426 transition count 1013
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2124 place count 426 transition count 1010
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2132 place count 418 transition count 1002
Iterating global reduction 6 with 8 rules applied. Total rules applied 2140 place count 418 transition count 1002
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2142 place count 416 transition count 1000
Iterating global reduction 6 with 2 rules applied. Total rules applied 2144 place count 416 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2145 place count 415 transition count 999
Iterating global reduction 6 with 1 rules applied. Total rules applied 2146 place count 415 transition count 999
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2176 place count 400 transition count 984
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2181 place count 395 transition count 979
Iterating global reduction 6 with 5 rules applied. Total rules applied 2186 place count 395 transition count 979
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2188 place count 393 transition count 977
Iterating global reduction 6 with 2 rules applied. Total rules applied 2190 place count 393 transition count 977
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 2212 place count 382 transition count 976
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2216 place count 382 transition count 972
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2218 place count 382 transition count 970
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2220 place count 380 transition count 970
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 2224 place count 380 transition count 970
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2225 place count 379 transition count 969
Applied a total of 2225 rules in 391 ms. Remains 379 /1534 variables (removed 1155) and now considering 969/2136 (removed 1167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 379/1534 places, 969/2136 transitions.
RANDOM walk for 40000 steps (1370 resets) in 597 ms. (66 steps per ms) remains 12/13 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (226 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (249 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (233 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (233 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (225 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (228 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (228 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (222 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (233 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (223 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (229 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (232 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 422604 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 12
Probabilistic random walk after 422604 steps, saw 86790 distinct states, run finished after 3006 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 969 rows 379 cols
[2024-06-01 08:20:20] [INFO ] Computed 3 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 78/261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 967/1228 variables, 261/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1228 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 119/1347 variables, 117/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/1348 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1348 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1348 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 382 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 78/261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 08:20:23] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 967/1228 variables, 261/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1228 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 119/1347 variables, 117/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1347 variables, 12/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1347 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/1348 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1348 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/1348 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 395 constraints, problems are : Problem set: 0 solved, 12 unsolved in 9812 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 11627ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 11438 ms.
Support contains 183 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 969/969 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 379 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 378 transition count 968
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 377 transition count 967
Applied a total of 4 rules in 35 ms. Remains 377 /379 variables (removed 2) and now considering 967/969 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 377/379 places, 967/969 transitions.
RANDOM walk for 40000 steps (1397 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (227 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (253 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (222 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (229 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (230 resets) in 90 ms. (439 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (224 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (232 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (230 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (232 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (229 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (226 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 413650 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 11
Probabilistic random walk after 413650 steps, saw 84514 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 967 rows 377 cols
[2024-06-01 08:20:47] [INFO ] Computed 3 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/260 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 964/1224 variables, 260/263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1224 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 119/1343 variables, 116/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1343 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/1344 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1344 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1344 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1344/1344 variables, and 380 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/260 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 964/1224 variables, 260/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1224 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 119/1343 variables, 116/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1343 variables, 11/391 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1343 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/1344 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1344 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1344 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1344/1344 variables, and 392 constraints, problems are : Problem set: 0 solved, 11 unsolved in 8872 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 10646ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 3819 ms.
Support contains 164 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 967/967 transitions.
Graph (trivial) has 32 edges and 377 vertex of which 4 / 377 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 375 transition count 952
Reduce places removed 11 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 364 transition count 941
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 45 place count 353 transition count 941
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 45 place count 353 transition count 940
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 352 transition count 940
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 349 transition count 937
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 349 transition count 934
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 347 transition count 932
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 347 transition count 932
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 347 transition count 930
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 347 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 346 transition count 929
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 346 transition count 929
Applied a total of 65 rules in 93 ms. Remains 346 /377 variables (removed 31) and now considering 929/967 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 346/377 places, 929/967 transitions.
RANDOM walk for 40000 steps (1620 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (251 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (252 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (254 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (252 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (244 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (250 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (251 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (257 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 462260 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 8
Probabilistic random walk after 462260 steps, saw 94265 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
// Phase 1: matrix 929 rows 346 cols
[2024-06-01 08:21:05] [INFO ] Computed 3 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/239 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 929/1168 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 107/1275 variables, 107/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1275 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/1275 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1275/1275 variables, and 349 constraints, problems are : Problem set: 0 solved, 8 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/239 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 929/1168 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:21:07] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 107/1275 variables, 107/350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1275 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1275 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1275 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 358 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4079 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 5161ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1607 ms.
Support contains 156 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 929/929 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 346 transition count 927
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7 rules applied. Total rules applied 9 place count 344 transition count 922
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 14 place count 339 transition count 922
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 339 transition count 921
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 338 transition count 921
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 337 transition count 907
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 337 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 337 transition count 906
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 336 transition count 905
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 22 place count 335 transition count 904
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 335 transition count 904
Applied a total of 23 rules in 52 ms. Remains 335 /346 variables (removed 11) and now considering 904/929 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 335/346 places, 904/929 transitions.
RANDOM walk for 40000 steps (1552 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (248 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (244 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (242 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (242 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (247 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (241 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (241 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 493503 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 7
Probabilistic random walk after 493503 steps, saw 108298 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 904 rows 335 cols
[2024-06-01 08:21:15] [INFO ] Computed 3 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 72/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 904/1132 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 107/1239 variables, 107/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1239 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1239/1239 variables, and 338 constraints, problems are : Problem set: 0 solved, 7 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 72/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 904/1132 variables, 228/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:21:16] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1132 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:21:17] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 107/1239 variables, 107/340 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1239 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1239 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1239 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1239/1239 variables, and 347 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4360 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 5321ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2444 ms.
Support contains 156 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 904/904 transitions.
Applied a total of 0 rules in 15 ms. Remains 335 /335 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 335/335 places, 904/904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 904/904 transitions.
Applied a total of 0 rules in 13 ms. Remains 335 /335 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 08:21:23] [INFO ] Invariant cache hit.
[2024-06-01 08:21:23] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 08:21:23] [INFO ] Invariant cache hit.
[2024-06-01 08:21:23] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-06-01 08:21:23] [INFO ] Redundant transitions in 49 ms returned []
Running 897 sub problems to find dead transitions.
[2024-06-01 08:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (OVERLAPS) 3/333 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-06-01 08:21:35] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:21:40] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:21:41] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-06-01 08:21:48] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 897 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/1239 variables, and 7 constraints, problems are : Problem set: 0 solved, 897 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/335 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (OVERLAPS) 3/333 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 4 (OVERLAPS) 904/1237 variables, 333/340 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1237 variables, 897/1237 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-06-01 08:22:21] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:22:21] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 2 ms to minimize.
[2024-06-01 08:22:21] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1237/1239 variables, and 1240 constraints, problems are : Problem set: 0 solved, 897 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 333/335 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 7/7 constraints]
After SMT, in 62272ms problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 62282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62818 ms. Remains : 335/335 places, 904/904 transitions.
[2024-06-01 08:22:26] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 08:22:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 335 places, 904 transitions and 6080 arcs took 10 ms.
[2024-06-01 08:22:26] [INFO ] Flatten gal took : 164 ms
Total runtime 142221 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 : StigmergyCommit-PT-04b-ReachabilityFireability-2024-00
Could not compute solution for formula : StigmergyCommit-PT-04b-ReachabilityFireability-2024-02
Could not compute solution for formula : StigmergyCommit-PT-04b-ReachabilityFireability-2024-03
Could not compute solution for formula : StigmergyCommit-PT-04b-ReachabilityFireability-2024-04
Could not compute solution for formula : StigmergyCommit-PT-04b-ReachabilityFireability-2024-06
Could not compute solution for formula : StigmergyCommit-PT-04b-ReachabilityFireability-2024-11
Could not compute solution for formula : StigmergyCommit-PT-04b-ReachabilityFireability-2024-15

BK_STOP 1717230146956

--------------------
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 StigmergyCommit-PT-04b-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_0_
rfs formula name StigmergyCommit-PT-04b-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_1_
rfs formula name StigmergyCommit-PT-04b-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_2_
rfs formula name StigmergyCommit-PT-04b-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_3_
rfs formula name StigmergyCommit-PT-04b-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_4_
rfs formula name StigmergyCommit-PT-04b-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/627/inv_5_
rfs formula name StigmergyCommit-PT-04b-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/627/inv_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-04b"
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 StigmergyCommit-PT-04b, 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 r536-tall-171690531700135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04b.tgz
mv StigmergyCommit-PT-04b 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 ;