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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 125M
-rw-r--r-- 1 mcc users 6.5K 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 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 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 124M 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-10b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-07
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-08
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-11
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717018698837

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 21:38:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 21:38:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:38:24] [INFO ] Load time of PNML (sax parser for PT used): 4169 ms
[2024-05-29 21:38:24] [INFO ] Transformed 1379 places.
[2024-05-29 21:38:24] [INFO ] Transformed 120600 transitions.
[2024-05-29 21:38:24] [INFO ] Found NUPN structural information;
[2024-05-29 21:38:24] [INFO ] Parsed PT model containing 1379 places and 120600 transitions and 2385526 arcs in 4789 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (233 resets) in 5343 ms. (7 steps per ms) remains 9/12 properties
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 480 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1143 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 433 ms. (92 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 376 ms. (106 steps per ms) remains 8/9 properties
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (26 resets) in 309 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (25 resets) in 327 ms. (121 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (21 resets) in 298 ms. (133 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (25 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (26 resets) in 341 ms. (116 steps per ms) remains 7/7 properties
// Phase 1: matrix 120600 rows 1379 cols
[2024-05-29 21:38:31] [INFO ] Computed 11 invariants in 3087 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem StigmergyElection-PT-10b-ReachabilityCardinality-2023-14 is UNSAT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2023-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1226/1379 variables, 11/164 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 1226/1390 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/1390 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SMT process timed out in 9549ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 120600/120600 transitions.
Graph (trivial) has 1161 edges and 1379 vertex of which 149 / 1379 are part of one of the 22 SCC in 26 ms
Free SCC test removed 127 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Graph (complete) has 3490 edges and 1252 vertex of which 1240 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.377 ms
Discarding 12 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 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 0 with 668 rules applied. Total rules applied 670 place count 1240 transition count 119766
Reduce places removed 663 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 685 rules applied. Total rules applied 1355 place count 577 transition count 119744
Reduce places removed 10 places and 0 transitions.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Iterating post reduction 2 with 98 rules applied. Total rules applied 1453 place count 567 transition count 119656
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 89 rules applied. Total rules applied 1542 place count 479 transition count 119655
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1542 place count 479 transition count 119618
Deduced a syphon composed of 37 places in 171 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1616 place count 442 transition count 119618
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1674 place count 384 transition count 119560
Iterating global reduction 4 with 58 rules applied. Total rules applied 1732 place count 384 transition count 119560
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1734 place count 384 transition count 119558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1734 place count 384 transition count 119557
Deduced a syphon composed of 1 places in 97 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1736 place count 383 transition count 119557
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1749 place count 370 transition count 18285
Iterating global reduction 5 with 13 rules applied. Total rules applied 1762 place count 370 transition count 18285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1765 place count 370 transition count 18282
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 10 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 1849 place count 328 transition count 18240
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1852 place count 325 transition count 18237
Iterating global reduction 6 with 3 rules applied. Total rules applied 1855 place count 325 transition count 18237
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1873 place count 316 transition count 18249
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1876 place count 316 transition count 18246
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 1894 place count 316 transition count 18228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1896 place count 315 transition count 18234
Free-agglomeration rule applied 49 times.
Iterating global reduction 7 with 49 rules applied. Total rules applied 1945 place count 315 transition count 18185
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 1994 place count 266 transition count 18185
Drop transitions (Redundant composition of simpler transitions.) removed 3890 transitions
Redundant transition composition rules discarded 3890 transitions
Iterating global reduction 8 with 3890 rules applied. Total rules applied 5884 place count 266 transition count 14295
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 5887 place count 266 transition count 14295
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 5888 place count 266 transition count 14295
Applied a total of 5888 rules in 90491 ms. Remains 266 /1379 variables (removed 1113) and now considering 14295/120600 (removed 106305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90525 ms. Remains : 266/1379 places, 14295/120600 transitions.
RANDOM walk for 40000 steps (1144 resets) in 2515 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (109 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (107 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (70 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 85528 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 6
Probabilistic random walk after 85528 steps, saw 15989 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 14295 rows 266 cols
[2024-05-29 21:40:12] [INFO ] Computed 9 invariants in 163 ms
[2024-05-29 21:40:28] [INFO ] State equation strengthened by 10250 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/239 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14292/14531 variables, 239/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14531 variables, 9735/9983 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14531/14561 variables, and 9983 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 239/266 constraints, ReadFeed: 9735/10250 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/239 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 21:41:18] [INFO ] Deduced a trap composed of 29 places in 4148 ms of which 20 ms to minimize.
[2024-05-29 21:41:21] [INFO ] Deduced a trap composed of 28 places in 3566 ms of which 1 ms to minimize.
[2024-05-29 21:41:25] [INFO ] Deduced a trap composed of 47 places in 3825 ms of which 2 ms to minimize.
[2024-05-29 21:41:29] [INFO ] Deduced a trap composed of 39 places in 3707 ms of which 2 ms to minimize.
[2024-05-29 21:41:33] [INFO ] Deduced a trap composed of 33 places in 3901 ms of which 1 ms to minimize.
[2024-05-29 21:41:37] [INFO ] Deduced a trap composed of 42 places in 3925 ms of which 2 ms to minimize.
[2024-05-29 21:41:41] [INFO ] Deduced a trap composed of 34 places in 3814 ms of which 2 ms to minimize.
[2024-05-29 21:41:45] [INFO ] Deduced a trap composed of 39 places in 4163 ms of which 5 ms to minimize.
[2024-05-29 21:41:49] [INFO ] Deduced a trap composed of 37 places in 3842 ms of which 1 ms to minimize.
[2024-05-29 21:41:52] [INFO ] Deduced a trap composed of 36 places in 3822 ms of which 2 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 38 places in 3256 ms of which 2 ms to minimize.
[2024-05-29 21:41:59] [INFO ] Deduced a trap composed of 28 places in 3686 ms of which 1 ms to minimize.
SMT process timed out in 107168ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 14295/14295 transitions.
Applied a total of 0 rules in 12779 ms. Remains 266 /266 variables (removed 0) and now considering 14295/14295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12779 ms. Remains : 266/266 places, 14295/14295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 14295/14295 transitions.
Applied a total of 0 rules in 12433 ms. Remains 266 /266 variables (removed 0) and now considering 14295/14295 (removed 0) transitions.
[2024-05-29 21:42:25] [INFO ] Invariant cache hit.
[2024-05-29 21:42:28] [INFO ] Implicit Places using invariants in 3218 ms returned []
Implicit Place search using SMT only with invariants took 3229 ms to find 0 implicit places.
Running 14279 sub problems to find dead transitions.
[2024-05-29 21:42:28] [INFO ] Invariant cache hit.
[2024-05-29 21:42:44] [INFO ] State equation strengthened by 10250 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/14561 variables, and 0 constraints, problems are : Problem set: 0 solved, 14279 unsolved in 30232 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/266 constraints, ReadFeed: 0/10250 constraints, PredecessorRefiner: 14279/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14279 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/14561 variables, and 0 constraints, problems are : Problem set: 0 solved, 14279 unsolved in 30157 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/266 constraints, ReadFeed: 0/10250 constraints, PredecessorRefiner: 14049/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 287693ms problems are : Problem set: 0 solved, 14279 unsolved
Search for dead transitions found 0 dead transitions in 287881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303599 ms. Remains : 266/266 places, 14295/14295 transitions.
[2024-05-29 21:47:16] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-29 21:47:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 14295 transitions and 280552 arcs took 275 ms.
[2024-05-29 21:47:18] [INFO ] Flatten gal took : 1965 ms
Total runtime 538875 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-10b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 266
TRANSITIONS: 14295
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 1.169s, Sys 0.095s]


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


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

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

Process ID: 626
MODEL NAME: /home/mcc/execution/414/model
266 places, 14295 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-05 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-06 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2023-07 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2023-08 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2023-11 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-2024-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717020599807

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530200390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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