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.r538-tall-171690547600173.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 ltsminxred
Input is StigmergyElection-PT-03b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690547600173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 18:44 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 117K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717228808140

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:00:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 08:00:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:00:09] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 08:00:09] [INFO ] Transformed 427 places.
[2024-06-01 08:00:09] [INFO ] Transformed 518 transitions.
[2024-06-01 08:00:09] [INFO ] Found NUPN structural information;
[2024-06-01 08:00:09] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 195 ms.
Graph (trivial) has 435 edges and 427 vertex of which 63 / 427 are part of one of the 9 SCC in 5 ms
Free SCC test removed 54 places
Structural test allowed to assert that 275 places are NOT stable. Took 32 ms.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
RANDOM walk for 40000 steps (693 resets) in 2800 ms. (14 steps per ms) remains 71/152 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 64/71 properties
BEST_FIRST walk for 4003 steps (14 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (15 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 57/64 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (14 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 54/57 properties
BEST_FIRST walk for 4002 steps (12 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (14 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (17 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (15 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (13 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
[2024-06-01 08:00:10] [INFO ] Flow matrix only has 450 transitions (discarded 8 similar events)
// Phase 1: matrix 450 rows 373 cols
[2024-06-01 08:00:10] [INFO ] Computed 4 invariants in 14 ms
[2024-06-01 08:00:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 300/354 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 300/357 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 19/373 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 19/377 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 449/822 variables, 373/750 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/823 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/823 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/823 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 751 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3506 ms.
Refiners :[Domain max(s): 373/373 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 373/373 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 300/354 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 300/357 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:00:15] [INFO ] Deduced a trap composed of 174 places in 236 ms of which 23 ms to minimize.
[2024-06-01 08:00:15] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:00:15] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:00:16] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:00:16] [INFO ] Deduced a trap composed of 172 places in 234 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:00:17] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:00:17] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:00:18] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 08:00:18] [INFO ] Deduced a trap composed of 175 places in 124 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 19/373 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 19/386 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/823 variables, and 386 constraints, problems are : Problem set: 0 solved, 54 unsolved in 5010 ms.
Refiners :[Domain max(s): 373/373 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/373 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/54 constraints, Known Traps: 9/9 constraints]
After SMT, in 8617ms problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 458/458 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 373 transition count 210
Reduce places removed 239 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 255 rules applied. Total rules applied 503 place count 134 transition count 194
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 511 place count 126 transition count 194
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 511 place count 126 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 519 place count 122 transition count 190
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 539 place count 102 transition count 170
Iterating global reduction 3 with 20 rules applied. Total rules applied 559 place count 102 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 559 place count 102 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 561 place count 101 transition count 169
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 570 place count 92 transition count 123
Iterating global reduction 3 with 9 rules applied. Total rules applied 579 place count 92 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 586 place count 92 transition count 116
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 600 place count 85 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 604 place count 83 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 609 place count 83 transition count 106
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 625 place count 83 transition count 90
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 646 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 647 place count 66 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 648 place count 66 transition count 84
Applied a total of 648 rules in 54 ms. Remains 66 /373 variables (removed 307) and now considering 84/458 (removed 374) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 66/373 places, 84/458 transitions.
RANDOM walk for 694 steps (16 resets) in 30 ms. (22 steps per ms) remains 0/54 properties
Able to resolve query StableMarking after proving 154 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 10283 ms.
ITS solved all properties within timeout

BK_STOP 1717228819682

--------------------
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 StableMarking -timeout 180 -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-03b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is StigmergyElection-PT-03b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r538-tall-171690547600173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;