fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r512-smll-171654407200215
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Peterson-COL-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
889.672 28460.00 54664.00 178.10 FTTTFFFTTFTTTFTF 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.r512-smll-171654407200215.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 Peterson-COL-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K 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 Peterson-COL-3-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717258330312

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:12:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:12:12] [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 16:12:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:12:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 879 ms
[2024-06-01 16:12:13] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:12:13] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-06-01 16:12:13] [INFO ] Skeletonized 12 HLPN properties in 0 ms.
All 12 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:12:13] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 61 ms.
[2024-06-01 16:12:13] [INFO ] Unfolded 12 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
FORMULA Peterson-COL-3-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3051 ms. (13 steps per ms) remains 5/10 properties
FORMULA Peterson-COL-3-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 946 ms. (42 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1597 ms. (25 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1104 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
[2024-06-01 16:12:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 16:12:15] [INFO ] Computed 15 invariants in 14 ms
[2024-06-01 16:12:15] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem Peterson-COL-3-ReachabilityFireability-2024-04 is UNSAT
FORMULA Peterson-COL-3-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 308/552 variables, 244/259 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 57/316 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 21 ms to minimize.
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 2 ms to minimize.
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 2 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 3 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 29 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 4 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 20/35 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 6 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:12:25] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 2 ms to minimize.
SMT process timed out in 10246ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 48 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 244/244 places, 332/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 851 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 893 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 840 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1330 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 475600 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :2 out of 4
Probabilistic random walk after 475600 steps, saw 98608 distinct states, run finished after 3007 ms. (steps per millisecond=158 ) properties seen :2
FORMULA Peterson-COL-3-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 16:12:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:12:30] [INFO ] Invariant cache hit.
[2024-06-01 16:12:30] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem Peterson-COL-3-ReachabilityFireability-2024-07 is UNSAT
FORMULA Peterson-COL-3-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 8/244 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:12:31] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 4 ms to minimize.
[2024-06-01 16:12:31] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:12:31] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 6/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 308/552 variables, 244/265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 57/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 2/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 324 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2381 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/244 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 4/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 3 ms to minimize.
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 8 ms to minimize.
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 308/552 variables, 244/272 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 57/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 1/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/552 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 330 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 5027ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 236 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 244/244 places, 332/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 831 ms. (48 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1082867 steps, run visited all 1 properties in 2941 ms. (steps per millisecond=368 )
Probabilistic random walk after 1082867 steps, saw 217331 distinct states, run finished after 2948 ms. (steps per millisecond=367 ) properties seen :1
FORMULA Peterson-COL-3-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 26764 ms.
ITS solved all properties within timeout

BK_STOP 1717258358772

--------------------
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="Peterson-COL-3"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-COL-3, 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 r512-smll-171654407200215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;