About the Execution of GreatSPN+red for StigmergyElection-PT-07b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
970.588 | 26487.00 | 48537.00 | 50.50 | FTTTFTTTTFFFTFFT | 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-171690530100343.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-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530100343
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 3.4M 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-07b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717012449202
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-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:54:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:54:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:54:10] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-29 19:54:10] [INFO ] Transformed 971 places.
[2024-05-29 19:54:10] [INFO ] Transformed 5542 transitions.
[2024-05-29 19:54:10] [INFO ] Found NUPN structural information;
[2024-05-29 19:54:10] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 504 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 (330 resets) in 1425 ms. (28 steps per ms) remains 14/16 properties
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (49 resets) in 563 ms. (70 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (48 resets) in 344 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 1175 ms. (34 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 145 ms. (274 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 72 ms. (548 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
// Phase 1: matrix 5542 rows 971 cols
[2024-05-29 19:54:12] [INFO ] Computed 8 invariants in 141 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-00 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-09 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-10 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 884/971 variables, 8/95 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 884/979 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 3 solved, 11 unsolved in 4190 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-01 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 889/971 variables, 8/90 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 889/979 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5018 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10153ms problems are : Problem set: 4 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 695 ms.
Support contains 81 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 772 edges and 971 vertex of which 139 / 971 are part of one of the 19 SCC in 7 ms
Free SCC test removed 120 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 1948 edges and 851 vertex of which 841 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.35 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 446 rules applied. Total rules applied 448 place count 841 transition count 4939
Reduce places removed 441 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 452 rules applied. Total rules applied 900 place count 400 transition count 4928
Reduce places removed 5 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 2 with 62 rules applied. Total rules applied 962 place count 395 transition count 4871
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 3 with 57 rules applied. Total rules applied 1019 place count 338 transition count 4871
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1019 place count 338 transition count 4826
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1109 place count 293 transition count 4826
Discarding 73 places :
Symmetric choice reduction at 4 with 73 rule applications. Total rules 1182 place count 220 transition count 4753
Iterating global reduction 4 with 73 rules applied. Total rules applied 1255 place count 220 transition count 4753
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 1268 place count 220 transition count 4740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1269 place count 219 transition count 4740
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1269 place count 219 transition count 4738
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1273 place count 217 transition count 4738
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1280 place count 210 transition count 4731
Iterating global reduction 6 with 7 rules applied. Total rules applied 1287 place count 210 transition count 4731
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1290 place count 207 transition count 4725
Iterating global reduction 6 with 3 rules applied. Total rules applied 1293 place count 207 transition count 4725
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1325 place count 191 transition count 4709
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1330 place count 186 transition count 4704
Iterating global reduction 6 with 5 rules applied. Total rules applied 1335 place count 186 transition count 4704
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1345 place count 181 transition count 4712
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1353 place count 181 transition count 4704
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1356 place count 181 transition count 4701
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1359 place count 178 transition count 4701
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 1363 place count 178 transition count 4701
Applied a total of 1363 rules in 987 ms. Remains 178 /971 variables (removed 793) and now considering 4701/5542 (removed 841) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1006 ms. Remains : 178/971 places, 4701/5542 transitions.
RANDOM walk for 40000 steps (1504 resets) in 869 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (217 resets) in 316 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (194 resets) in 287 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (199 resets) in 295 ms. (135 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (191 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (189 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (190 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (196 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (193 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (196 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 205137 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 9
Probabilistic random walk after 205137 steps, saw 49348 distinct states, run finished after 3005 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 4701 rows 178 cols
[2024-05-29 19:54:28] [INFO ] Computed 8 invariants in 49 ms
[2024-05-29 19:54:28] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 97/178 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4701/4879 variables, 178/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4879 variables, 23/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4879 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/4879 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4879/4879 variables, and 209 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1907 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 178/178 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 97/178 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 19:54:31] [INFO ] Deduced a trap composed of 38 places in 1237 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4701/4879 variables, 178/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4879 variables, 23/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4879 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/4879 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4879/4879 variables, and 210 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4520 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 178/178 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 6941ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 9 properties in 606 ms.
All properties solved without resorting to model-checking.
Total runtime 25312 ms.
ITS solved all properties within timeout
BK_STOP 1717012475689
--------------------
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-07b"
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-07b, 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-171690530100343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07b.tgz
mv StigmergyElection-PT-07b 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 ;