About the Execution of GreatSPN+red for StigmergyElection-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
491.896 | 12062.00 | 30072.00 | 99.40 | TFFTTFTTFFTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530000295.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyElection-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530000295
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 203K 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 StigmergyElection-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717009510158
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:05:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:05:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:05:11] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-29 19:05:11] [INFO ] Transformed 563 places.
[2024-05-29 19:05:11] [INFO ] Transformed 780 transitions.
[2024-05-29 19:05:11] [INFO ] Found NUPN structural information;
[2024-05-29 19:05:11] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (547 resets) in 996 ms. (40 steps per ms) remains 13/16 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (108 resets) in 193 ms. (206 steps per ms) remains 12/13 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (107 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (113 resets) in 179 ms. (222 steps per ms) remains 11/12 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (111 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (123 resets) in 410 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (108 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (110 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (113 resets) in 219 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (110 resets) in 91 ms. (434 steps per ms) remains 10/11 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (109 resets) in 839 ms. (47 steps per ms) remains 10/10 properties
// Phase 1: matrix 780 rows 563 cols
[2024-05-29 19:05:12] [INFO ] Computed 5 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem StigmergyElection-PT-04b-ReachabilityFireability-2024-12 is UNSAT
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 415/563 variables, 5/153 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 415/568 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 780/1343 variables, 563/1131 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 19:05:14] [INFO ] Deduced a trap composed of 192 places in 278 ms of which 29 ms to minimize.
Problem StigmergyElection-PT-04b-ReachabilityFireability-2024-08 is UNSAT
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/1343 variables, 1/1132 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1343 variables, 0/1132 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/1343 variables, 0/1132 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1343/1343 variables, and 1132 constraints, problems are : Problem set: 2 solved, 8 unsolved in 2316 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem StigmergyElection-PT-04b-ReachabilityFireability-2024-15 is UNSAT
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 489/563 variables, 5/79 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 489/568 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 1/569 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-29 19:05:15] [INFO ] Deduced a trap composed of 194 places in 146 ms of which 3 ms to minimize.
[2024-05-29 19:05:16] [INFO ] Deduced a trap composed of 190 places in 381 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/571 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-29 19:05:16] [INFO ] Deduced a trap composed of 191 places in 191 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 1/572 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/572 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 780/1343 variables, 563/1135 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1343 variables, 7/1142 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-29 19:05:17] [INFO ] Deduced a trap composed of 189 places in 125 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1343 variables, 1/1143 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1343 variables, 0/1143 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1343 variables, 0/1143 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1343/1343 variables, and 1143 constraints, problems are : Problem set: 3 solved, 7 unsolved in 3212 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 5/5 constraints]
After SMT, in 5782ms problems are : Problem set: 3 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 2865 ms.
Support contains 32 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 529 edges and 563 vertex of which 64 / 563 are part of one of the 10 SCC in 3 ms
Free SCC test removed 54 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 876 edges and 509 vertex of which 501 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 501 transition count 381
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 342 rules applied. Total rules applied 670 place count 179 transition count 361
Reduce places removed 10 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 20 rules applied. Total rules applied 690 place count 169 transition count 351
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 700 place count 159 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 700 place count 159 transition count 339
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 724 place count 147 transition count 339
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 753 place count 118 transition count 310
Iterating global reduction 4 with 29 rules applied. Total rules applied 782 place count 118 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 782 place count 118 transition count 308
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 786 place count 116 transition count 308
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 789 place count 113 transition count 272
Iterating global reduction 4 with 3 rules applied. Total rules applied 792 place count 113 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 794 place count 113 transition count 270
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 824 place count 98 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 825 place count 98 transition count 254
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 828 place count 95 transition count 251
Iterating global reduction 6 with 3 rules applied. Total rules applied 831 place count 95 transition count 251
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 839 place count 91 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 841 place count 91 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 845 place count 91 transition count 247
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 873 place count 91 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 901 place count 63 transition count 219
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 904 place count 60 transition count 216
Iterating global reduction 8 with 3 rules applied. Total rules applied 907 place count 60 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 908 place count 60 transition count 216
Applied a total of 908 rules in 159 ms. Remains 60 /563 variables (removed 503) and now considering 216/780 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 60/563 places, 216/780 transitions.
RANDOM walk for 40000 steps (2928 resets) in 944 ms. (42 steps per ms) remains 1/3 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (498 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
// Phase 1: matrix 216 rows 60 cols
[2024-05-29 19:05:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 19:05:21] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/60 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/276 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 69/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:05:22] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:05:22] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/276 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 69/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/276 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 10958 ms.
ITS solved all properties within timeout
BK_STOP 1717009522220
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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="StigmergyElection-PT-04b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-04b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530000295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04b.tgz
mv StigmergyElection-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 '
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 ;