fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r522-tall-171662353100018
Last Updated
July 7, 2024

About the Execution of LTSMin+red for QuasiCertifProtocol-COL-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
901.004 145134.00 309563.00 358.10 F 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.r522-tall-171662353100018.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 QuasiCertifProtocol-COL-18, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662353100018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 1717217945110

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-COL-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 04:59:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 04:59:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:59:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 656 ms
[2024-06-01 04:59:07] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 21 ms.
[2024-06-01 04:59:07] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-06-01 04:59:07] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
Structural test allowed to assert that 4 places are NOT stable. Took 4 ms.
RANDOM walk for 40014 steps (1452 resets) in 830 ms. (48 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40006 steps (527 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (520 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:59:07] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/56 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 485ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 107 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 2 properties in 6 ms.
Able to resolve query StableMarking after proving 27 properties.
[2024-06-01 04:59:08] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 46 ms.
[2024-06-01 04:59:08] [INFO ] Unfolded 30 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (1768 resets) in 2037 ms. (19 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 50 ms. (78 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
// Phase 1: matrix 296 rows 1398 cols
[2024-06-01 04:59:09] [INFO ] Computed 1103 invariants in 58 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1317 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1317 variables, 1081/1082 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1317 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 43/1360 variables, 3/1085 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1360 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 296/1656 variables, 1360/2445 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1656 variables, 0/2445 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 38/1694 variables, 38/2483 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SMT process timed out in 5178ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1317 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 1377 transition count 257
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 59 place count 1377 transition count 238
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 134 place count 1321 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 134 place count 1321 transition count 237
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 1319 transition count 237
Applied a total of 137 rules in 118 ms. Remains 1319 /1398 variables (removed 79) and now considering 237/296 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1319/1398 places, 237/296 transitions.
RANDOM walk for 4000000 steps (220501 resets) in 94144 ms. (42 steps per ms) remains 9/21 properties
BEST_FIRST walk for 4000004 steps (16653 resets) in 14697 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 2093042 steps (8873 resets) in 20004 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 2112598 steps (8877 resets) in 20007 ms. (105 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (16730 resets) in 12132 ms. (329 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (16831 resets) in 8832 ms. (452 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (16691 resets) in 8886 ms. (450 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (16645 resets) in 8717 ms. (458 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (16863 resets) in 7439 ms. (537 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (16749 resets) in 8706 ms. (459 steps per ms) remains 9/9 properties
// Phase 1: matrix 237 rows 1319 cols
[2024-06-01 05:00:07] [INFO ] Computed 1082 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/819 variables, 703/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 361/1180 variables, 342/1046 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1180 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 134/1314 variables, 1180/2226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1314 variables, 0/2226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 137/1451 variables, 59/2285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1451 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 19/1470 variables, 18/2303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1470 variables, 19/2322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/2322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 41/1511 variables, 20/2342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1511 variables, 0/2342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 41/1552 variables, 39/2381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1552 variables, 18/2399 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1552 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 3/1555 variables, 1/2400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1555 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 1/1556 variables, 1/2401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1556 variables, 0/2401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/1556 variables, 0/2401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1556/1556 variables, and 2401 constraints, problems are : Problem set: 0 solved, 9 unsolved in 37183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1081/1081 constraints, State Equation: 1319/1319 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/819 variables, 703/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 361/1180 variables, 342/1046 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:00:47] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1180 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1180 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 134/1314 variables, 1180/2227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1314 variables, 9/2236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1314 variables, 0/2236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 137/1451 variables, 59/2295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1451/1556 variables, and 2295 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1045/1081 constraints, State Equation: 1239/1319 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 82271ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 819 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 237/237 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1300 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 1298 transition count 174
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 84 place count 1298 transition count 155
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 141 place count 1260 transition count 155
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 1260 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 1259 transition count 154
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 361 places
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 4 with 437 rules applied. Total rules applied 580 place count 860 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 581 place count 859 transition count 115
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 600 place count 840 transition count 115
Applied a total of 600 rules in 251 ms. Remains 840 /1319 variables (removed 479) and now considering 115/237 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 840/1319 places, 115/237 transitions.
RANDOM walk for 276 steps (0 resets) in 8 ms. (30 steps per ms) remains 0/9 properties
Able to resolve query StableMarking after proving 30 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK TOPOLOGICAL
Total runtime 143956 ms.
ITS solved all properties within timeout

BK_STOP 1717218090244

--------------------
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="QuasiCertifProtocol-COL-18"
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 QuasiCertifProtocol-COL-18, 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 r522-tall-171662353100018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 ;