Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r343-tall-167889215100078.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RERS17pb114-PT-7, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215100078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.0K Feb 26 04:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 04:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 04:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 04:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M Mar 5 18:23 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 1679126716772

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb114-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 08:05:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 08:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 08:05:20] [INFO ] Load time of PNML (sax parser for PT used): 1877 ms
[2023-03-18 08:05:20] [INFO ] Transformed 1446 places.
[2023-03-18 08:05:20] [INFO ] Transformed 151085 transitions.
[2023-03-18 08:05:20] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2403 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1667 ms. (steps per millisecond=5 ) properties (out of 1446) seen :945
Running SMT prover for 501 properties.
[2023-03-18 08:05:24] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-18 08:05:24] [INFO ] Computed 35 place invariants in 459 ms
[2023-03-18 08:05:39] [INFO ] After 14476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:501
[2023-03-18 08:05:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2023-03-18 08:05:51] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 23 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 08:06:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 08:06:04] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:501
Fused 501 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 501 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 2866 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2881 ms. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 226312 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 487
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4007 ms. (steps per millisecond=249 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3830 ms. (steps per millisecond=261 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3747 ms. (steps per millisecond=266 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3659 ms. (steps per millisecond=273 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3580 ms. (steps per millisecond=279 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3507 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3495 ms. (steps per millisecond=286 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3575 ms. (steps per millisecond=279 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3471 ms. (steps per millisecond=288 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3490 ms. (steps per millisecond=286 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3544 ms. (steps per millisecond=282 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-18 08:07:17] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 08:07:17] [INFO ] Computed 18 place invariants in 311 ms
[2023-03-18 08:07:18] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 08:07:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 08:07:48] [INFO ] After 30096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-18 08:07:50] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:08:07] [INFO ] After 16957ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-18 08:08:18] [INFO ] Deduced a trap composed of 128 places in 9761 ms of which 9 ms to minimize.
[2023-03-18 08:08:27] [INFO ] Deduced a trap composed of 64 places in 8682 ms of which 2 ms to minimize.
[2023-03-18 08:08:37] [INFO ] Deduced a trap composed of 40 places in 8322 ms of which 1 ms to minimize.
[2023-03-18 08:08:46] [INFO ] Deduced a trap composed of 64 places in 8277 ms of which 2 ms to minimize.
[2023-03-18 08:08:55] [INFO ] Deduced a trap composed of 40 places in 7977 ms of which 2 ms to minimize.
[2023-03-18 08:09:04] [INFO ] Deduced a trap composed of 64 places in 7700 ms of which 1 ms to minimize.
[2023-03-18 08:09:12] [INFO ] Deduced a trap composed of 64 places in 7309 ms of which 1 ms to minimize.
[2023-03-18 08:09:20] [INFO ] Deduced a trap composed of 96 places in 6705 ms of which 1 ms to minimize.
[2023-03-18 08:09:28] [INFO ] Deduced a trap composed of 64 places in 6215 ms of which 1 ms to minimize.
[2023-03-18 08:09:34] [INFO ] Deduced a trap composed of 64 places in 5758 ms of which 6 ms to minimize.
[2023-03-18 08:09:41] [INFO ] Deduced a trap composed of 96 places in 5573 ms of which 0 ms to minimize.
[2023-03-18 08:09:46] [INFO ] Deduced a trap composed of 96 places in 4145 ms of which 1 ms to minimize.
[2023-03-18 08:09:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 103842 ms
[2023-03-18 08:10:33] [INFO ] After 162890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 10318 ms.
[2023-03-18 08:10:43] [INFO ] After 205180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1293 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1293 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 292260 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3594 ms. (steps per millisecond=278 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3483 ms. (steps per millisecond=287 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3501 ms. (steps per millisecond=285 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-18 08:11:25] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:11:25] [INFO ] Invariant cache hit.
[2023-03-18 08:11:25] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 08:11:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 08:11:48] [INFO ] After 22173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 08:11:49] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:11:58] [INFO ] After 8835ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 08:12:10] [INFO ] Deduced a trap composed of 40 places in 11063 ms of which 2 ms to minimize.
[2023-03-18 08:12:21] [INFO ] Deduced a trap composed of 64 places in 10457 ms of which 2 ms to minimize.
[2023-03-18 08:12:33] [INFO ] Deduced a trap composed of 96 places in 10144 ms of which 2 ms to minimize.
[2023-03-18 08:12:43] [INFO ] Deduced a trap composed of 96 places in 9582 ms of which 1 ms to minimize.
[2023-03-18 08:12:54] [INFO ] Deduced a trap composed of 64 places in 9304 ms of which 2 ms to minimize.
[2023-03-18 08:13:04] [INFO ] Deduced a trap composed of 64 places in 8738 ms of which 2 ms to minimize.
[2023-03-18 08:13:13] [INFO ] Deduced a trap composed of 96 places in 8169 ms of which 1 ms to minimize.
[2023-03-18 08:13:22] [INFO ] Deduced a trap composed of 128 places in 7878 ms of which 1 ms to minimize.
[2023-03-18 08:13:30] [INFO ] Deduced a trap composed of 128 places in 7401 ms of which 2 ms to minimize.
[2023-03-18 08:13:39] [INFO ] Deduced a trap composed of 40 places in 7166 ms of which 1 ms to minimize.
[2023-03-18 08:13:47] [INFO ] Deduced a trap composed of 64 places in 7028 ms of which 1 ms to minimize.
[2023-03-18 08:13:55] [INFO ] Deduced a trap composed of 64 places in 6904 ms of which 1 ms to minimize.
[2023-03-18 08:14:02] [INFO ] Deduced a trap composed of 96 places in 6552 ms of which 1 ms to minimize.
[2023-03-18 08:14:09] [INFO ] Deduced a trap composed of 128 places in 4916 ms of which 1 ms to minimize.
[2023-03-18 08:14:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 135621 ms
[2023-03-18 08:14:19] [INFO ] After 150519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2319 ms.
[2023-03-18 08:14:22] [INFO ] After 176036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1309 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1310 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 331671 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3215 ms. (steps per millisecond=311 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:14:57] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:14:57] [INFO ] Invariant cache hit.
[2023-03-18 08:14:57] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:14:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 08:15:19] [INFO ] After 22248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:15:20] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:15:29] [INFO ] After 8683ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 08:15:42] [INFO ] Deduced a trap composed of 40 places in 11786 ms of which 1 ms to minimize.
[2023-03-18 08:15:55] [INFO ] Deduced a trap composed of 64 places in 11630 ms of which 1 ms to minimize.
[2023-03-18 08:16:07] [INFO ] Deduced a trap composed of 64 places in 11488 ms of which 2 ms to minimize.
[2023-03-18 08:16:20] [INFO ] Deduced a trap composed of 40 places in 11266 ms of which 1 ms to minimize.
[2023-03-18 08:16:32] [INFO ] Deduced a trap composed of 96 places in 10894 ms of which 1 ms to minimize.
[2023-03-18 08:16:44] [INFO ] Deduced a trap composed of 64 places in 10902 ms of which 2 ms to minimize.
[2023-03-18 08:16:56] [INFO ] Deduced a trap composed of 64 places in 10891 ms of which 1 ms to minimize.
[2023-03-18 08:17:07] [INFO ] Deduced a trap composed of 96 places in 9472 ms of which 1 ms to minimize.
[2023-03-18 08:17:16] [INFO ] Deduced a trap composed of 96 places in 8052 ms of which 1 ms to minimize.
[2023-03-18 08:17:25] [INFO ] Deduced a trap composed of 96 places in 8109 ms of which 2 ms to minimize.
[2023-03-18 08:17:33] [INFO ] Deduced a trap composed of 128 places in 7054 ms of which 1 ms to minimize.
[2023-03-18 08:17:42] [INFO ] Deduced a trap composed of 64 places in 7107 ms of which 0 ms to minimize.
[2023-03-18 08:17:49] [INFO ] Deduced a trap composed of 128 places in 6341 ms of which 0 ms to minimize.
[2023-03-18 08:17:56] [INFO ] Deduced a trap composed of 128 places in 5888 ms of which 1 ms to minimize.
[2023-03-18 08:18:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 151854 ms
[2023-03-18 08:18:01] [INFO ] After 161314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1225 ms.
[2023-03-18 08:18:03] [INFO ] After 185984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1534 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1537 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 129064 steps, including 0 resets, run visited all 1 properties in 16258 ms. (steps per millisecond=7 )
Able to resolve query StableMarking after proving 1446 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 783134 ms.
ITS solved all properties within timeout

BK_STOP 1679127502568

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="RERS17pb114-PT-7"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb114-PT-7, 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 r343-tall-167889215100078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-7.tgz
mv RERS17pb114-PT-7 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 ;