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.r400-tall-171690531700135.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
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 r400-tall-171690531700135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716986470205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 12:41:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:41:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:41:11] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-29 12:41:11] [INFO ] Transformed 1534 places.
[2024-05-29 12:41:11] [INFO ] Transformed 2136 transitions.
[2024-05-29 12:41:11] [INFO ] Found NUPN structural information;
[2024-05-29 12:41:11] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (424 resets) in 1919 ms. (20 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
[2024-05-29 12:41:12] [INFO ] Flatten gal took : 293 ms
BEST_FIRST walk for 40003 steps (76 resets) in 801 ms. (49 steps per ms) remains 14/14 properties
[2024-05-29 12:41:12] [INFO ] Flatten gal took : 274 ms
[2024-05-29 12:41:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4393304441340387464.gal : 98 ms
[2024-05-29 12:41:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16086405278950622958.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4393304441340387464.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16086405278950622958.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (80 resets) in 1051 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (73 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (75 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (74 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (65 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality16086405278950622958.prop.
BEST_FIRST walk for 40003 steps (75 resets) in 145 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (75 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (76 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
// Phase 1: matrix 2136 rows 1534 cols
[2024-05-29 12:41:13] [INFO ] Computed 6 invariants in 58 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1332/1534 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1332/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :12 after 17
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :17 after 19
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :19 after 192
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :192 after 999
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :999 after 1094
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1094 after 2372
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :2372 after 11199
At refinement iteration 5 (OVERLAPS) 2136/3670 variables, 1534/3074 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :11199 after 1.10618e+06
[2024-05-29 12:41:17] [INFO ] Deduced a trap composed of 398 places in 483 ms of which 48 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3670 variables, 1/3075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3670 variables, 0/3075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/3670 variables, 0/3075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3670/3670 variables, and 3075 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4904 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1534/1534 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1332/1534 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1332/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 399 places in 446 ms of which 8 ms to minimize.
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 399 places in 440 ms of which 7 ms to minimize.
[2024-05-29 12:41:21] [INFO ] Deduced a trap composed of 399 places in 340 ms of which 5 ms to minimize.
[2024-05-29 12:41:21] [INFO ] Deduced a trap composed of 489 places in 451 ms of which 6 ms to minimize.
[2024-05-29 12:41:22] [INFO ] Deduced a trap composed of 483 places in 424 ms of which 6 ms to minimize.
[2024-05-29 12:41:22] [INFO ] Deduced a trap composed of 402 places in 342 ms of which 5 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityFireability-2024-09 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 12:41:22] [INFO ] Deduced a trap composed of 206 places in 370 ms of which 6 ms to minimize.
[2024-05-29 12:41:23] [INFO ] Deduced a trap composed of 300 places in 421 ms of which 6 ms to minimize.
[2024-05-29 12:41:23] [INFO ] Deduced a trap composed of 399 places in 328 ms of which 5 ms to minimize.
[2024-05-29 12:41:24] [INFO ] Deduced a trap composed of 434 places in 428 ms of which 6 ms to minimize.
SMT process timed out in 10800ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 184 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1109 edges and 1534 vertex of which 53 / 1534 are part of one of the 9 SCC in 10 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.14 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 778 transitions
Trivial Post-agglo rules discarded 778 transitions
Performed 778 trivial Post agglomeration. Transition count delta: 778
Iterating post reduction 0 with 779 rules applied. Total rules applied 781 place count 1482 transition count 1297
Reduce places removed 778 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 785 rules applied. Total rules applied 1566 place count 704 transition count 1290
Reduce places removed 3 places and 0 transitions.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Iterating post reduction 2 with 128 rules applied. Total rules applied 1694 place count 701 transition count 1165
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 129 rules applied. Total rules applied 1823 place count 576 transition count 1161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1825 place count 574 transition count 1161
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 68 Pre rules applied. Total rules applied 1825 place count 574 transition count 1093
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 1961 place count 506 transition count 1093
Discarding 80 places :
Symmetric choice reduction at 5 with 80 rule applications. Total rules 2041 place count 426 transition count 1013
Iterating global reduction 5 with 80 rules applied. Total rules applied 2121 place count 426 transition count 1013
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2124 place count 426 transition count 1010
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2132 place count 418 transition count 1002
Iterating global reduction 6 with 8 rules applied. Total rules applied 2140 place count 418 transition count 1002
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2142 place count 416 transition count 1000
Iterating global reduction 6 with 2 rules applied. Total rules applied 2144 place count 416 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2145 place count 415 transition count 999
Iterating global reduction 6 with 1 rules applied. Total rules applied 2146 place count 415 transition count 999
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2176 place count 400 transition count 984
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2181 place count 395 transition count 979
Iterating global reduction 6 with 5 rules applied. Total rules applied 2186 place count 395 transition count 979
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2188 place count 393 transition count 977
Iterating global reduction 6 with 2 rules applied. Total rules applied 2190 place count 393 transition count 977
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 2212 place count 382 transition count 976
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2216 place count 382 transition count 972
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2218 place count 382 transition count 970
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2220 place count 380 transition count 970
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 2224 place count 380 transition count 970
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2225 place count 379 transition count 969
Applied a total of 2225 rules in 507 ms. Remains 379 /1534 variables (removed 1155) and now considering 969/2136 (removed 1167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 379/1534 places, 969/2136 transitions.
RANDOM walk for 40000 steps (1325 resets) in 359 ms. (111 steps per ms) remains 12/13 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (236 resets) in 227 ms. (175 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (247 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (223 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (225 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (221 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (229 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (235 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (228 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (232 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (229 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (232 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (233 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 569516 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 12
Probabilistic random walk after 569516 steps, saw 116279 distinct states, run finished after 3004 ms. (steps per millisecond=189 ) properties seen :0
// Phase 1: matrix 969 rows 379 cols
[2024-05-29 12:41:28] [INFO ] Computed 3 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 78/261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 967/1228 variables, 261/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1228 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 119/1347 variables, 117/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/1348 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1348 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1348 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 382 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 78/261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 12:41:30] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 967/1228 variables, 261/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1228 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 119/1347 variables, 117/382 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1347 variables, 12/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1347 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/1348 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1348 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/1348 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 395 constraints, problems are : Problem set: 0 solved, 12 unsolved in 9228 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 10984ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-08 does not hold.
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :1.10618e+06 after 1.10518e+07
Parikh walk visited 0 properties in 11142 ms.
Support contains 183 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 969/969 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 379 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 378 transition count 968
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 377 transition count 967
Applied a total of 4 rules in 37 ms. Remains 377 /379 variables (removed 2) and now considering 967/969 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 377/379 places, 967/969 transitions.
RANDOM walk for 40000 steps (1383 resets) in 291 ms. (136 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (233 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (241 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (235 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (232 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (236 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (229 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (220 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (229 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (233 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (224 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (229 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 594569 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 11
Probabilistic random walk after 594569 steps, saw 122210 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
// Phase 1: matrix 967 rows 377 cols
[2024-05-29 12:41:54] [INFO ] Computed 3 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/260 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 964/1224 variables, 260/263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1224 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 119/1343 variables, 116/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1343 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/1344 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1344 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1344 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1344/1344 variables, and 380 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 78/260 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 12:41:56] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 964/1224 variables, 260/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1224 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 119/1343 variables, 116/380 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1343 variables, 11/391 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1343 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/1344 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1344 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/1344 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1344/1344 variables, and 392 constraints, problems are : Problem set: 0 solved, 11 unsolved in 8400 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 10062ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 3810 ms.
Support contains 125 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 967/967 transitions.
Graph (trivial) has 117 edges and 377 vertex of which 15 / 377 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 367 transition count 912
Reduce places removed 37 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 62 rules applied. Total rules applied 100 place count 330 transition count 887
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 126 place count 305 transition count 886
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 126 place count 305 transition count 878
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 142 place count 297 transition count 878
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 290 transition count 871
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 290 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 288 transition count 869
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 288 transition count 869
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 281 transition count 862
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 182 place count 281 transition count 854
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 186 place count 277 transition count 850
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 277 transition count 850
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 191 place count 276 transition count 849
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 276 transition count 849
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 196 place count 276 transition count 845
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 275 transition count 844
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 274 transition count 842
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 274 transition count 842
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 211 place count 274 transition count 831
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 222 place count 263 transition count 831
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 263 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 262 transition count 830
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 228 place count 262 transition count 830
Applied a total of 228 rules in 178 ms. Remains 262 /377 variables (removed 115) and now considering 830/967 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 262/377 places, 830/967 transitions.
RANDOM walk for 40000 steps (1638 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (283 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (257 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (248 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (267 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (263 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (247 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (253 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (261 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 669870 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :1 out of 8
Probabilistic random walk after 669870 steps, saw 140456 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :1
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 830 rows 262 cols
[2024-05-29 12:42:11] [INFO ] Computed 3 invariants in 9 ms
[2024-05-29 12:42:11] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 72/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 781/949 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 117/1066 variables, 76/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 16/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 24/1090 variables, 16/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/1092 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1092 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1092 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 281 constraints, problems are : Problem set: 0 solved, 7 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 262/262 constraints, ReadFeed: 16/16 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/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 72/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 12:42:12] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 781/949 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/949 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 117/1066 variables, 76/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 24/1090 variables, 16/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/1092 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1092 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 289 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3504 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 262/262 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 4399ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1644 ms.
Support contains 96 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 830/830 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 26 rules applied. Total rules applied 26 place count 262 transition count 804
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 33 rules applied. Total rules applied 59 place count 237 transition count 796
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 230 transition count 796
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 230 transition count 793
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 72 place count 227 transition count 793
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 223 transition count 789
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 223 transition count 789
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 223 transition count 787
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 222 transition count 786
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 222 transition count 786
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 92 place count 218 transition count 782
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 217 transition count 781
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 217 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 217 transition count 780
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 115 place count 217 transition count 760
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 135 place count 197 transition count 760
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 197 transition count 759
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 197 transition count 758
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 139 place count 196 transition count 757
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 140 place count 196 transition count 757
Applied a total of 140 rules in 135 ms. Remains 196 /262 variables (removed 66) and now considering 757/830 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 196/262 places, 757/830 transitions.
RANDOM walk for 40000 steps (1989 resets) in 209 ms. (190 steps per ms) remains 6/7 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (250 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (286 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (295 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (278 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (327 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (281 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
// Phase 1: matrix 757 rows 196 cols
[2024-05-29 12:42:18] [INFO ] Computed 4 invariants in 5 ms
[2024-05-29 12:42:18] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 753/903 variables, 150/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 12/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 49/952 variables, 45/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/953 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/953 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 228 constraints, problems are : Problem set: 0 solved, 6 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 28/28 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 62/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 12:42:18] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 753/903 variables, 150/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 12/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 49/952 variables, 45/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/953 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/953 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 235 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2595 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3267ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2747 ms.
Support contains 88 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 757/757 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 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 754
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 193 transition count 751
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 190 transition count 751
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 190 transition count 750
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 14 place count 189 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 188 transition count 740
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 188 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 188 transition count 739
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 187 transition count 738
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 186 transition count 737
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 186 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 186 transition count 736
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 24 place count 186 transition count 734
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 26 place count 184 transition count 734
Applied a total of 26 rules in 86 ms. Remains 184 /196 variables (removed 12) and now considering 734/757 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 184/196 places, 734/757 transitions.
RANDOM walk for 40000 steps (2032 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (259 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (295 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (294 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (285 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (337 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (293 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 770264 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 6
Probabilistic random walk after 770264 steps, saw 157711 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
// Phase 1: matrix 734 rows 184 cols
[2024-05-29 12:42:27] [INFO ] Computed 4 invariants in 7 ms
[2024-05-29 12:42:27] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 733/874 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 12/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 44/918 variables, 43/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 16/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/918 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 918/918 variables, and 216 constraints, problems are : Problem set: 0 solved, 6 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 28/28 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 733/874 variables, 141/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 12/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 12:42:28] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 44/918 variables, 43/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 16/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/918 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/918 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/918 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 918/918 variables, and 223 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 2511ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 876 ms.
Support contains 73 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 734/734 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 184 transition count 726
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 176 transition count 725
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 175 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 175 transition count 723
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 174 transition count 723
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 173 transition count 642
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 173 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 173 transition count 641
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 28 place count 171 transition count 639
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 170 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 170 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 170 transition count 637
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 44 place count 170 transition count 624
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 57 place count 157 transition count 624
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 82 place count 157 transition count 599
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 83 place count 157 transition count 599
Applied a total of 83 rules in 95 ms. Remains 157 /184 variables (removed 27) and now considering 599/734 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 157/184 places, 599/734 transitions.
RANDOM walk for 40000 steps (2207 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (329 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (337 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (323 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (312 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 779431 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 4
Probabilistic random walk after 779431 steps, saw 162281 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
// Phase 1: matrix 599 rows 157 cols
[2024-05-29 12:42:34] [INFO ] Computed 4 invariants in 13 ms
[2024-05-29 12:42:34] [INFO ] State equation strengthened by 87 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) 598/717 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 87/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 39/756 variables, 38/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/756 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 248 constraints, problems are : Problem set: 0 solved, 4 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 87/87 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) 598/717 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 87/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 12:42:34] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 39/756 variables, 38/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/756 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 756/756 variables, and 253 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1632ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 781 ms.
Support contains 73 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 599/599 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 157/157 places, 599/599 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 599/599 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 599/599 (removed 0) transitions.
[2024-05-29 12:42:36] [INFO ] Invariant cache hit.
[2024-05-29 12:42:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 12:42:36] [INFO ] Invariant cache hit.
[2024-05-29 12:42:36] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-29 12:42:36] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-29 12:42:36] [INFO ] Redundant transitions in 30 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-29 12:42:36] [INFO ] Invariant cache hit.
[2024-05-29 12:42:36] [INFO ] State equation strengthened by 87 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :1.10518e+07 after 1.40382e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (OVERLAPS) 3/157 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-29 12:42:43] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-29 12:42:43] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-29 12:42:43] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-29 12:42:43] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:42:44] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-29 12:42:44] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-29 12:42:44] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-05-29 12:42:44] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (OVERLAPS) 599/756 variables, 157/169 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 87/256 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-29 12:42:55] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:42:55] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2024-05-29 12:42:55] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 1 ms to minimize.
[2024-05-29 12:42:56] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 1 ms to minimize.
[2024-05-29 12:42:56] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2024-05-29 12:42:56] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2024-05-29 12:42:56] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 1 ms to minimize.
[2024-05-29 12:42:57] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 1 ms to minimize.
[2024-05-29 12:42:57] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2024-05-29 12:42:57] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 5 ms to minimize.
[2024-05-29 12:42:57] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 1 ms to minimize.
[2024-05-29 12:42:57] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:42:59] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 13/269 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 756/756 variables, and 269 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (OVERLAPS) 3/157 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (OVERLAPS) 599/756 variables, 157/182 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 87/269 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 591/860 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-29 12:43:26] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 1 ms to minimize.
[2024-05-29 12:43:26] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-05-29 12:43:28] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 1 ms to minimize.
[2024-05-29 12:43:32] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 1 ms to minimize.
[2024-05-29 12:43:32] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :1.40382e+07 after 1.64616e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/756 variables, and 865 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 157/157 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 26/26 constraints]
After SMT, in 62630ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 62642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62967 ms. Remains : 157/157 places, 599/599 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 599/599 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-29 12:43:39] [INFO ] Invariant cache hit.
[2024-05-29 12:43:39] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 12:43:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-29 12:43:40] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-29 12:43:40] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-29 12:43:40] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-29 12:43:40] [INFO ] Flatten gal took : 48 ms
[2024-05-29 12:43:40] [INFO ] Flatten gal took : 46 ms
[2024-05-29 12:43:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1117405270568519866.gal : 10 ms
[2024-05-29 12:43:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1269824475699536039.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1117405270568519866.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1269824475699536039.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1269824475699536039.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :10 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 25
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :25 after 29
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :29 after 99
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :99 after 1064
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-03 does not hold.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1064 after 2364
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2364 after 2725
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2725 after 30137
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :30137 after 42077
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :42077 after 381418
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-04 does not hold.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :381418 after 3.05179e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.05179e+06 after 3.73221e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.73221e+06 after 4.47884e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.27946e+07,7.61523,165052,2,10941,21,314605,8,0,1272,373191,0
Total reachable state count : 32794650

Verifying 4 reachability properties.
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-03,1,7.61816,165052,2,158,21,314605,9,0,1302,373191,0
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-04 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-04,27720,7.63067,165052,2,806,21,314605,10,0,1400,373191,0
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-06,1386,7.63843,165052,2,494,21,314605,10,0,1417,373191,0
Reachability property StigmergyCommit-PT-04b-ReachabilityFireability-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-11,43455,7.65004,165052,2,1657,21,314605,10,0,1452,373191,0
Over-approximation ignoring read arcs solved 0 properties in 8850 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 12:43:48] [INFO ] Flatten gal took : 73 ms
[2024-05-29 12:43:48] [INFO ] Applying decomposition
[2024-05-29 12:43:48] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10892997359160349980.txt' '-o' '/tmp/graph10892997359160349980.bin' '-w' '/tmp/graph10892997359160349980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10892997359160349980.bin' '-l' '-1' '-v' '-w' '/tmp/graph10892997359160349980.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:43:48] [INFO ] Decomposing Gal with order
[2024-05-29 12:43:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:43:49] [INFO ] Removed a total of 2891 redundant transitions.
[2024-05-29 12:43:49] [INFO ] Flatten gal took : 191 ms
[2024-05-29 12:43:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 42 ms.
[2024-05-29 12:43:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15232667347612077831.gal : 22 ms
[2024-05-29 12:43:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3919202393395042734.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15232667347612077831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3919202393395042734.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3919202393395042734.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8.42381e+07 after 2.00866e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.52057e+12,10.3268,265796,7687,18,278345,1036,2402,2.20464e+06,49,1483,0
Total reachable state count : 6520573710832

Verifying 4 reachability properties.
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-03 does not hold.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-03,2.67357e+10,10.4317,265796,2068,16,278345,1036,2441,2.20464e+06,54,1483,10943
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-04 does not hold.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-04,4.65633e+07,10.4988,265796,1080,16,278345,1036,2558,2.20464e+06,56,1483,27946
Invariant property StigmergyCommit-PT-04b-ReachabilityFireability-2024-06 does not hold.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-06,574084,10.5586,265796,748,15,278345,1036,2574,2.20464e+06,57,1483,36143
Reachability property StigmergyCommit-PT-04b-ReachabilityFireability-2024-11 is true.
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-04b-ReachabilityFireability-2024-11,1.27211e+06,10.5955,265796,607,13,278345,1036,2626,2.20464e+06,57,1483,52014
All properties solved without resorting to model-checking.
Total runtime 168793 ms.

BK_STOP 1716986640182

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r400-tall-171690531700135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04b.tgz
mv StigmergyCommit-PT-04b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;