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.r399-tall-171690529700135.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 greatspnxred
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 r399-tall-171690529700135
=====================================================================

--------------------
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 1716988058095

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:07:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 13:07:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:07:39] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-29 13:07:39] [INFO ] Transformed 1534 places.
[2024-05-29 13:07:39] [INFO ] Transformed 2136 transitions.
[2024-05-29 13:07:39] [INFO ] Found NUPN structural information;
[2024-05-29 13:07:39] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 274 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 (423 resets) in 1675 ms. (23 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 40002 steps (76 resets) in 765 ms. (52 steps per ms) remains 13/14 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (82 resets) in 1095 ms. (36 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 314 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (77 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (78 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (76 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (75 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (79 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (64 resets) in 136 ms. (291 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (77 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
// Phase 1: matrix 2136 rows 1534 cols
[2024-05-29 13:07:41] [INFO ] Computed 6 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1340/1534 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1340/1540 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2136/3670 variables, 1534/3074 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 13:07:44] [INFO ] Deduced a trap composed of 399 places in 455 ms of which 59 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3670 variables, 1/3075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3670 variables, 0/3075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/3670 variables, 0/3075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3670/3670 variables, and 3075 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4989 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1534/1534 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1340/1534 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1340/1540 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 13:07:48] [INFO ] Deduced a trap composed of 399 places in 528 ms of which 9 ms to minimize.
[2024-05-29 13:07:48] [INFO ] Deduced a trap composed of 399 places in 441 ms of which 6 ms to minimize.
[2024-05-29 13:07:49] [INFO ] Deduced a trap composed of 398 places in 377 ms of which 5 ms to minimize.
[2024-05-29 13:07:49] [INFO ] Deduced a trap composed of 399 places in 391 ms of which 5 ms to minimize.
[2024-05-29 13:07:50] [INFO ] Deduced a trap composed of 399 places in 478 ms of which 7 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityFireability-2024-09 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 13:07:50] [INFO ] Deduced a trap composed of 399 places in 354 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1534 variables, 6/1547 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-29 13:07:51] [INFO ] Deduced a trap composed of 399 places in 453 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1534 variables, 1/1548 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1534/3670 variables, and 1548 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5017 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/1534 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 8/8 constraints]
After SMT, in 10539ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1118 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.8 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 788 transitions
Trivial Post-agglo rules discarded 788 transitions
Performed 788 trivial Post agglomeration. Transition count delta: 788
Iterating post reduction 0 with 789 rules applied. Total rules applied 791 place count 1482 transition count 1287
Reduce places removed 788 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 795 rules applied. Total rules applied 1586 place count 694 transition count 1280
Reduce places removed 3 places and 0 transitions.
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Iterating post reduction 2 with 125 rules applied. Total rules applied 1711 place count 691 transition count 1158
Reduce places removed 122 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 126 rules applied. Total rules applied 1837 place count 569 transition count 1154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1839 place count 567 transition count 1154
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 70 Pre rules applied. Total rules applied 1839 place count 567 transition count 1084
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 1979 place count 497 transition count 1084
Discarding 80 places :
Symmetric choice reduction at 5 with 80 rule applications. Total rules 2059 place count 417 transition count 1004
Iterating global reduction 5 with 80 rules applied. Total rules applied 2139 place count 417 transition count 1004
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2142 place count 417 transition count 1001
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2151 place count 408 transition count 983
Iterating global reduction 6 with 9 rules applied. Total rules applied 2160 place count 408 transition count 983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2161 place count 408 transition count 982
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2164 place count 405 transition count 979
Iterating global reduction 7 with 3 rules applied. Total rules applied 2167 place count 405 transition count 979
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2169 place count 403 transition count 977
Iterating global reduction 7 with 2 rules applied. Total rules applied 2171 place count 403 transition count 977
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2215 place count 381 transition count 955
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2220 place count 376 transition count 950
Iterating global reduction 7 with 5 rules applied. Total rules applied 2225 place count 376 transition count 950
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2227 place count 374 transition count 948
Iterating global reduction 7 with 2 rules applied. Total rules applied 2229 place count 374 transition count 948
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2239 place count 369 transition count 948
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2241 place count 369 transition count 946
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2245 place count 369 transition count 942
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2246 place count 369 transition count 941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2247 place count 368 transition count 941
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2251 place count 368 transition count 941
Applied a total of 2251 rules in 353 ms. Remains 368 /1534 variables (removed 1166) and now considering 941/2136 (removed 1195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 368/1534 places, 941/2136 transitions.
RANDOM walk for 40000 steps (1317 resets) in 697 ms. (57 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (224 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (229 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (228 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (227 resets) in 62 ms. (634 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (234 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (232 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (224 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (229 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (222 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (226 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (223 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 449282 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 11
Probabilistic random walk after 449282 steps, saw 93412 distinct states, run finished after 3021 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 941 rows 368 cols
[2024-05-29 13:07:55] [INFO ] Computed 3 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 75/250 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 939/1189 variables, 250/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 119/1308 variables, 117/370 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1308 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/1309 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1309 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 371 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 368/368 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/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 75/250 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 939/1189 variables, 250/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 13:07:58] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1189 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 119/1308 variables, 117/371 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1308 variables, 11/382 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1308 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/1309 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 383 constraints, problems are : Problem set: 0 solved, 11 unsolved in 8680 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 10395ms problems are : Problem set: 0 solved, 11 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 5297 ms.
Support contains 141 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 941/941 transitions.
Graph (trivial) has 66 edges and 368 vertex of which 9 / 368 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 362 transition count 908
Reduce places removed 22 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 34 rules applied. Total rules applied 57 place count 340 transition count 896
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 71 place count 328 transition count 894
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 328 transition count 887
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 321 transition count 887
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 319 transition count 885
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 319 transition count 885
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 318 transition count 884
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 318 transition count 884
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 105 place count 311 transition count 877
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 311 transition count 874
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 309 transition count 872
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 309 transition count 872
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 307 transition count 870
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 307 transition count 870
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 307 transition count 864
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 128 place count 301 transition count 864
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 129 place count 301 transition count 864
Applied a total of 129 rules in 161 ms. Remains 301 /368 variables (removed 67) and now considering 864/941 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 301/368 places, 864/941 transitions.
RANDOM walk for 40000 steps (1509 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (249 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (254 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (249 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (255 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (256 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (268 resets) in 35 ms. (1111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (259 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (248 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (246 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 476066 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :1 out of 9
Probabilistic random walk after 476066 steps, saw 107894 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :1
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 864 rows 301 cols
[2024-05-29 13:08:15] [INFO ] Computed 3 invariants in 13 ms
[2024-05-29 13:08:15] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 79/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 821/1013 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 131/1144 variables, 94/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 16/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 20/1164 variables, 14/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/1165 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1165 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1165 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 320 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 301/301 constraints, ReadFeed: 16/16 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/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 79/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 13:08:16] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 13:08:16] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 821/1013 variables, 192/197 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1013 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 131/1144 variables, 94/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1144 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 20/1164 variables, 14/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/1165 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1165 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1165 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 330 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 301/301 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 6397ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 3748 ms.
Support contains 113 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 864/864 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 301 transition count 840
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 34 rules applied. Total rules applied 58 place count 278 transition count 829
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 68 place count 268 transition count 829
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 268 transition count 826
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 74 place count 265 transition count 826
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 78 place count 261 transition count 822
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 261 transition count 822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 261 transition count 821
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 260 transition count 820
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 260 transition count 820
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 258 transition count 818
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 257 transition count 817
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 257 transition count 817
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 place count 255 transition count 835
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 255 transition count 832
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 109 place count 255 transition count 821
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 120 place count 244 transition count 821
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 122 place count 244 transition count 819
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 123 place count 244 transition count 819
Applied a total of 123 rules in 140 ms. Remains 244 /301 variables (removed 57) and now considering 819/864 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 244/301 places, 819/864 transitions.
RANDOM walk for 40000 steps (1914 resets) in 728 ms. (54 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (285 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (291 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (293 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (289 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (284 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (310 resets) in 34 ms. (1142 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (285 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (282 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
// Phase 1: matrix 819 rows 244 cols
[2024-05-29 13:08:25] [INFO ] Computed 4 invariants in 15 ms
[2024-05-29 13:08:25] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 71/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 817/1000 variables, 183/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 24/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 62/1062 variables, 60/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1062 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/1063 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1063 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 272 constraints, problems are : Problem set: 0 solved, 7 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 24/24 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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 71/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 13:08:26] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2024-05-29 13:08:27] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 817/1000 variables, 183/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 24/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 62/1062 variables, 60/273 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1062 variables, 7/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1062 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1062 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/1063 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1063 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1063 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 282 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4689 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 5580ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3312 ms.
Support contains 73 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 819/819 transitions.
Graph (trivial) has 90 edges and 244 vertex of which 4 / 244 are part of one of the 2 SCC in 0 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 242 transition count 785
Reduce places removed 30 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 37 rules applied. Total rules applied 68 place count 212 transition count 778
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 76 place count 205 transition count 777
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 76 place count 205 transition count 772
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 86 place count 200 transition count 772
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 196 transition count 688
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 196 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 196 transition count 687
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 195 transition count 686
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 195 transition count 686
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 189 transition count 680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 189 transition count 678
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 114 place count 186 transition count 675
Iterating global reduction 5 with 3 rules applied. Total rules applied 117 place count 186 transition count 675
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 118 place count 186 transition count 674
Free-agglomeration rule applied 28 times.
Iterating global reduction 5 with 28 rules applied. Total rules applied 146 place count 186 transition count 646
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 174 place count 158 transition count 646
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 203 place count 158 transition count 617
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 158 transition count 616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 205 place count 157 transition count 616
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 207 place count 157 transition count 616
Applied a total of 207 rules in 151 ms. Remains 157 /244 variables (removed 87) and now considering 616/819 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 157/244 places, 616/819 transitions.
RANDOM walk for 40000 steps (2477 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (348 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (356 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (337 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (386 resets) in 44 ms. (888 steps per ms) remains 4/5 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (349 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
// Phase 1: matrix 616 rows 157 cols
[2024-05-29 13:08:35] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 13:08:35] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 616/735 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 83/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 38/773 variables, 38/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/773 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 244 constraints, problems are : Problem set: 0 solved, 4 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:08:35] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 616/735 variables, 119/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 83/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/773 variables, 38/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:08:36] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:08:36] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/773 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 773/773 variables, and 251 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1835 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2276ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 598 ms.
Support contains 73 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 616/616 transitions.
Applied a total of 0 rules in 15 ms. Remains 157 /157 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 157/157 places, 616/616 transitions.
RANDOM walk for 40000 steps (2434 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (363 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (352 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (339 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (346 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 745944 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 4
Probabilistic random walk after 745944 steps, saw 140025 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
[2024-05-29 13:08:41] [INFO ] Invariant cache hit.
[2024-05-29 13:08:41] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 616/735 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 83/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 38/773 variables, 38/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/773 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 244 constraints, problems are : Problem set: 0 solved, 4 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 616/735 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 83/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:08:41] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/773 variables, 38/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:08:42] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:08:43] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:08:43] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 2 ms to minimize.
[2024-05-29 13:08:43] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/773 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/773 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 773/773 variables, and 253 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2551 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 3044ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 686 ms.
Support contains 73 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 616/616 transitions.
Applied a total of 0 rules in 16 ms. Remains 157 /157 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 157/157 places, 616/616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 616/616 transitions.
Applied a total of 0 rules in 14 ms. Remains 157 /157 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2024-05-29 13:08:44] [INFO ] Invariant cache hit.
[2024-05-29 13:08:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 13:08:44] [INFO ] Invariant cache hit.
[2024-05-29 13:08:45] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-29 13:08:45] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-29 13:08:45] [INFO ] Redundant transitions in 50 ms returned []
Running 589 sub problems to find dead transitions.
[2024-05-29 13:08:45] [INFO ] Invariant cache hit.
[2024-05-29 13:08:45] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 0 ms to minimize.
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:08:53] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-29 13:08:55] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 616/773 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 83/257 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-29 13:09:06] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-29 13:09:06] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 0 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:09:09] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:09:10] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-29 13:09:15] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 270 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 616/773 variables, 157/187 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 83/270 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 589/859 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-29 13:09:33] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:09:39] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 861 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 28/28 constraints]
After SMT, in 62427ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 62435ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62779 ms. Remains : 157/157 places, 616/616 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 157 /157 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 13:09:47] [INFO ] Invariant cache hit.
[2024-05-29 13:09:47] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:09:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-29 13:09:48] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-29 13:09:48] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
TRAPS : Iteration 1
[2024-05-29 13:09:49] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2024-05-29 13:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
TRAPS : Iteration 2
[2024-05-29 13:09:49] [INFO ] After 1661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:49] [INFO ] After 1969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2075 ms.
[2024-05-29 13:09:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-29 13:09:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 616 transitions and 4743 arcs took 8 ms.
[2024-05-29 13:09:50] [INFO ] Flatten gal took : 110 ms
Total runtime 130801 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-04b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 157
TRANSITIONS: 616
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.002s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 763
MODEL NAME: /home/mcc/execution/403/model
157 places, 616 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716989844949

--------------------
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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r399-tall-171690529700135"
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 ;