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-171690531800182.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-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531800182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 12M 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717233108111

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:11:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:11:49] [INFO ] Load time of PNML (sax parser for PT used): 668 ms
[2024-06-01 09:11:50] [INFO ] Transformed 2443 places.
[2024-06-01 09:11:50] [INFO ] Transformed 15956 transitions.
[2024-06-01 09:11:50] [INFO ] Found NUPN structural information;
[2024-06-01 09:11:50] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 854 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (270 resets) in 1907 ms. (20 steps per ms) remains 7/12 properties
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 283 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 477 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
// Phase 1: matrix 15956 rows 2443 cols
[2024-06-01 09:11:51] [INFO ] Computed 9 invariants in 373 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2343/2443 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2443 variables, 2343/2452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2443 variables, 0/2452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18399/18399 variables, and 4895 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5050 ms.
Refiners :[Domain max(s): 2443/2443 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 2443/2443 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2343/2443 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2443 variables, 2343/2452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:12:04] [INFO ] Deduced a trap composed of 488 places in 6186 ms of which 113 ms to minimize.
SMT process timed out in 12533ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2239 edges and 2443 vertex of which 154 / 2443 are part of one of the 23 SCC in 13 ms
Free SCC test removed 131 places
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 3990 edges and 2312 vertex of which 2296 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.91 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1620 transitions
Trivial Post-agglo rules discarded 1620 transitions
Performed 1620 trivial Post agglomeration. Transition count delta: 1620
Iterating post reduction 0 with 1628 rules applied. Total rules applied 1630 place count 2296 transition count 14153
Reduce places removed 1620 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 1659 rules applied. Total rules applied 3289 place count 676 transition count 14114
Reduce places removed 17 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 2 with 90 rules applied. Total rules applied 3379 place count 659 transition count 14041
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 76 rules applied. Total rules applied 3455 place count 586 transition count 14038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3456 place count 585 transition count 14038
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 88 Pre rules applied. Total rules applied 3456 place count 585 transition count 13950
Deduced a syphon composed of 88 places in 9 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 176 rules applied. Total rules applied 3632 place count 497 transition count 13950
Discarding 76 places :
Symmetric choice reduction at 5 with 76 rule applications. Total rules 3708 place count 421 transition count 13874
Iterating global reduction 5 with 76 rules applied. Total rules applied 3784 place count 421 transition count 13874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3784 place count 421 transition count 13873
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3786 place count 420 transition count 13873
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 3819 place count 387 transition count 1676
Iterating global reduction 5 with 33 rules applied. Total rules applied 3852 place count 387 transition count 1676
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 3857 place count 387 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 3867 place count 377 transition count 1661
Iterating global reduction 6 with 10 rules applied. Total rules applied 3877 place count 377 transition count 1661
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 3883 place count 371 transition count 1655
Iterating global reduction 6 with 6 rules applied. Total rules applied 3889 place count 371 transition count 1655
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3893 place count 371 transition count 1651
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3953 place count 341 transition count 1621
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3954 place count 341 transition count 1620
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3962 place count 333 transition count 1612
Iterating global reduction 8 with 8 rules applied. Total rules applied 3970 place count 333 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3975 place count 328 transition count 1607
Iterating global reduction 8 with 5 rules applied. Total rules applied 3980 place count 328 transition count 1607
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3985 place count 323 transition count 1602
Iterating global reduction 8 with 5 rules applied. Total rules applied 3990 place count 323 transition count 1602
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3996 place count 320 transition count 1620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3997 place count 320 transition count 1619
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4001 place count 320 transition count 1615
Free-agglomeration rule applied 77 times.
Iterating global reduction 9 with 77 rules applied. Total rules applied 4078 place count 320 transition count 1538
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 9 with 77 rules applied. Total rules applied 4155 place count 243 transition count 1538
Drop transitions (Redundant composition of simpler transitions.) removed 454 transitions
Redundant transition composition rules discarded 454 transitions
Iterating global reduction 10 with 454 rules applied. Total rules applied 4609 place count 243 transition count 1084
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 4618 place count 243 transition count 1084
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 4623 place count 243 transition count 1079
Applied a total of 4623 rules in 2930 ms. Remains 243 /2443 variables (removed 2200) and now considering 1079/15956 (removed 14877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2947 ms. Remains : 243/2443 places, 1079/15956 transitions.
RANDOM walk for 40000 steps (1605 resets) in 1176 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (159 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (175 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (171 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (174 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (168 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (176 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (167 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 578313 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 7
Probabilistic random walk after 578313 steps, saw 98215 distinct states, run finished after 3005 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 1079 rows 243 cols
[2024-06-01 09:12:10] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 09:12:10] [INFO ] State equation strengthened by 694 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1322 variables, 243/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 694/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1322 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 946 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 694/694 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/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:12:12] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 2 ms to minimize.
[2024-06-01 09:12:12] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 2 ms to minimize.
[2024-06-01 09:12:12] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 2 ms to minimize.
[2024-06-01 09:12:13] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 1 ms to minimize.
[2024-06-01 09:12:13] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 1 ms to minimize.
[2024-06-01 09:12:13] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2024-06-01 09:12:13] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 1 ms to minimize.
[2024-06-01 09:12:14] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 1 ms to minimize.
[2024-06-01 09:12:14] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:12:14] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:12:14] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 1 ms to minimize.
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-07b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 16/25 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 1 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 1 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1079/1322 variables, 243/272 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1322 variables, 694/966 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1322 variables, 6/972 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2024-06-01 09:12:19] [INFO ] Deduced a trap composed of 58 places in 276 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1322 variables, 3/975 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1322 variables, 0/975 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 1 ms to minimize.
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 1 ms to minimize.
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 2 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 1 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 1 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-06-01 09:12:23] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1322 variables, 11/986 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 09:12:24] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2024-06-01 09:12:24] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:12:24] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 1 ms to minimize.
[2024-06-01 09:12:25] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1322 variables, 4/990 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 09:12:25] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1322 variables, 1/991 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1322 variables, 0/991 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1322 variables, 0/991 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1322/1322 variables, and 991 constraints, problems are : Problem set: 1 solved, 6 unsolved in 15081 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 694/694 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 39/39 constraints]
After SMT, in 16325ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 0 properties in 1586 ms.
Support contains 71 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 1079/1079 transitions.
Graph (trivial) has 64 edges and 243 vertex of which 2 / 243 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 242 transition count 1052
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 31 rules applied. Total rules applied 57 place count 217 transition count 1046
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 213 transition count 1046
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 213 transition count 1044
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 211 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 209 transition count 1042
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 209 transition count 1042
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 85 place count 201 transition count 1034
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 94 place count 201 transition count 1025
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 98 place count 197 transition count 1021
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 197 transition count 1021
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 108 place count 197 transition count 1015
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 113 place count 197 transition count 1010
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 119 place count 197 transition count 1004
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 125 place count 191 transition count 1004
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 127 place count 191 transition count 1004
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 191 transition count 1002
Applied a total of 129 rules in 364 ms. Remains 191 /243 variables (removed 52) and now considering 1002/1079 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 191/243 places, 1002/1079 transitions.
RANDOM walk for 40000 steps (1609 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (178 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (188 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (186 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (178 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (189 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (189 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 652344 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 6
Probabilistic random walk after 652344 steps, saw 115767 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
// Phase 1: matrix 1002 rows 191 cols
[2024-06-01 09:12:32] [INFO ] Computed 9 invariants in 15 ms
[2024-06-01 09:12:32] [INFO ] State equation strengthened by 693 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 120/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1002/1193 variables, 191/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1193 variables, 693/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1193 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1193 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1193/1193 variables, and 893 constraints, problems are : Problem set: 0 solved, 6 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 191/191 constraints, ReadFeed: 693/693 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 120/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:33] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2024-06-01 09:12:33] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
[2024-06-01 09:12:33] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 1 ms to minimize.
[2024-06-01 09:12:34] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:12:34] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2024-06-01 09:12:34] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 1 ms to minimize.
[2024-06-01 09:12:34] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:12:34] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 0 ms to minimize.
[2024-06-01 09:12:35] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:35] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:12:35] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 2 ms to minimize.
[2024-06-01 09:12:35] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 1 ms to minimize.
[2024-06-01 09:12:36] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:36] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2024-06-01 09:12:36] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 0 ms to minimize.
[2024-06-01 09:12:36] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 1 ms to minimize.
[2024-06-01 09:12:36] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:37] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2024-06-01 09:12:37] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:37] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:37] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 0 ms to minimize.
[2024-06-01 09:12:38] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2024-06-01 09:12:38] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1002/1193 variables, 191/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1193 variables, 693/916 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1193 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1193 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:39] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1193 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:40] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 1 ms to minimize.
[2024-06-01 09:12:40] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1193 variables, 2/925 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 09:12:41] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:12:41] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1193 variables, 2/927 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1193 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1193 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1193/1193 variables, and 927 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10572 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 191/191 constraints, ReadFeed: 693/693 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 11525ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1426 ms.
Support contains 56 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 1002/1002 transitions.
Graph (trivial) has 39 edges and 191 vertex of which 4 / 191 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 189 transition count 987
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 178 transition count 984
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 175 transition count 984
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 172 transition count 981
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 172 transition count 981
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 45 place count 167 transition count 976
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 3 with 129 rules applied. Total rules applied 174 place count 167 transition count 847
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 178 place count 163 transition count 843
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 163 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 163 transition count 842
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 162 transition count 841
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 162 transition count 841
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 162 transition count 840
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 162 transition count 838
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 191 place count 162 transition count 835
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 194 place count 159 transition count 835
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 195 place count 159 transition count 835
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 196 place count 159 transition count 834
Applied a total of 196 rules in 315 ms. Remains 159 /191 variables (removed 32) and now considering 834/1002 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 159/191 places, 834/1002 transitions.
RANDOM walk for 40000 steps (1693 resets) in 327 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (191 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (198 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (187 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (191 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (194 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 725235 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 5
Probabilistic random walk after 725235 steps, saw 123188 distinct states, run finished after 3002 ms. (steps per millisecond=241 ) properties seen :0
// Phase 1: matrix 834 rows 159 cols
[2024-06-01 09:12:48] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 09:12:48] [INFO ] State equation strengthened by 659 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 834/993 variables, 159/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 659/827 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/993 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 827 constraints, problems are : Problem set: 0 solved, 5 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 159/159 constraints, ReadFeed: 659/659 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:12:49] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:12:49] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 0 ms to minimize.
[2024-06-01 09:12:50] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 834/993 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 659/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/993 variables, 5/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/993 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/993 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 835 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 159/159 constraints, ReadFeed: 659/659 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 2550ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 315 ms.
Support contains 31 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 834/834 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 159 transition count 809
Reduce places removed 25 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 1 with 29 rules applied. Total rules applied 54 place count 134 transition count 805
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 132 transition count 805
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 132 transition count 804
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 58 place count 131 transition count 804
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 129 transition count 801
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 801
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 125 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 125 transition count 796
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 122 transition count 793
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 122 transition count 793
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 81 place count 122 transition count 789
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 121 transition count 795
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 86 place count 121 transition count 792
Free-agglomeration rule applied 9 times with reduction of 64 identical transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 95 place count 121 transition count 719
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 5 with 74 rules applied. Total rules applied 169 place count 112 transition count 654
Applied a total of 169 rules in 260 ms. Remains 112 /159 variables (removed 47) and now considering 654/834 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 112/159 places, 654/834 transitions.
RANDOM walk for 40000 steps (2031 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (266 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (281 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (280 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1011698 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 3
Probabilistic random walk after 1011698 steps, saw 175362 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
// Phase 1: matrix 654 rows 112 cols
[2024-06-01 09:12:54] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 09:12:55] [INFO ] State equation strengthened by 551 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/112 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 654/766 variables, 112/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 551/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/766 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 766/766 variables, and 672 constraints, problems are : Problem set: 0 solved, 3 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 551/551 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/112 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:12:55] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:12:55] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2024-06-01 09:12:56] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2024-06-01 09:12:56] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 654/766 variables, 112/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 551/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 3/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:12:56] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 6 ms to minimize.
[2024-06-01 09:12:56] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/766 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 766/766 variables, and 681 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 551/551 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 2255ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 100 ms.
Support contains 31 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 654/654 transitions.
Applied a total of 0 rules in 34 ms. Remains 112 /112 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 112/112 places, 654/654 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 654/654 transitions.
Applied a total of 0 rules in 34 ms. Remains 112 /112 variables (removed 0) and now considering 654/654 (removed 0) transitions.
[2024-06-01 09:12:57] [INFO ] Invariant cache hit.
[2024-06-01 09:12:57] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 09:12:57] [INFO ] Invariant cache hit.
[2024-06-01 09:12:57] [INFO ] State equation strengthened by 551 read => feed constraints.
[2024-06-01 09:12:58] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-06-01 09:12:58] [INFO ] Redundant transitions in 35 ms returned []
Running 638 sub problems to find dead transitions.
[2024-06-01 09:12:58] [INFO ] Invariant cache hit.
[2024-06-01 09:12:58] [INFO ] State equation strengthened by 551 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-06-01 09:13:08] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:13:09] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2024-06-01 09:13:10] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2024-06-01 09:13:10] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:13:10] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-06-01 09:13:10] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:22] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:13:23] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 8 (OVERLAPS) 654/766 variables, 112/200 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/766 variables, 551/751 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/766 variables, and 751 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 551/551 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:37] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:13:37] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-06-01 09:13:37] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:13:37] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:13:37] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 638 unsolved
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:13:41] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 6 (OVERLAPS) 654/766 variables, 112/212 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 551/763 constraints. Problems are: Problem set: 0 solved, 638 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 638/1401 constraints. Problems are: Problem set: 0 solved, 638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 1401 constraints, problems are : Problem set: 0 solved, 638 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 551/551 constraints, PredecessorRefiner: 638/638 constraints, Known Traps: 91/91 constraints]
After SMT, in 66851ms problems are : Problem set: 0 solved, 638 unsolved
Search for dead transitions found 0 dead transitions in 66859ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67844 ms. Remains : 112/112 places, 654/654 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 637
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 22 rules applied. Total rules applied 39 place count 95 transition count 632
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 91 transition count 632
Performed 13 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 69 place count 78 transition count 604
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 76 place count 78 transition count 597
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 76 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 76 transition count 591
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 87 place count 76 transition count 588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 90 place count 73 transition count 588
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 73 transition count 587
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 92 place count 73 transition count 587
Applied a total of 92 rules in 70 ms. Remains 73 /112 variables (removed 39) and now considering 587/654 (removed 67) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 587 rows 73 cols
[2024-06-01 09:14:05] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 09:14:05] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 09:14:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 09:14:05] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 09:14:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 09:14:05] [INFO ] After 76ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 802 ms
TRAPS : Iteration 1
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
TRAPS : Iteration 2
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
TRAPS : Iteration 3
[2024-06-01 09:14:07] [INFO ] After 1507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 09:14:07] [INFO ] After 1794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1916 ms.
[2024-06-01 09:14:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-06-01 09:14:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 654 transitions and 8736 arcs took 9 ms.
[2024-06-01 09:14:07] [INFO ] Flatten gal took : 133 ms
Total runtime 138266 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-07b-ReachabilityCardinality-2024-05
Could not compute solution for formula : StigmergyCommit-PT-07b-ReachabilityCardinality-2024-12
Could not compute solution for formula : StigmergyCommit-PT-07b-ReachabilityCardinality-2024-15

BK_STOP 1717233247769

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name StigmergyCommit-PT-07b-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/1101/inv_0_
rfs formula name StigmergyCommit-PT-07b-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1101/inv_1_
rfs formula name StigmergyCommit-PT-07b-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/1101/inv_2_
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-07b"
export BK_EXAMINATION="ReachabilityCardinality"
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-07b, examination is ReachabilityCardinality"
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-171690531800182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07b.tgz
mv StigmergyCommit-PT-07b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;