fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419500830
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15310.808 3600000.00 13763763.00 1091.00 FTTFFTFTFTFFFTTT normal

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.r233-tall-167856419500830.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 MultiCrashLeafsetExtension-PT-S24C05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419500830
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K Feb 26 03:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 26 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:22 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 MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679629316239

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 03:41:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 03:41:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 03:41:58] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2023-03-24 03:41:58] [INFO ] Transformed 11106 places.
[2023-03-24 03:41:58] [INFO ] Transformed 16561 transitions.
[2023-03-24 03:41:58] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 193 resets, run finished after 726 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 03:42:00] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
// Phase 1: matrix 15961 rows 11106 cols
[2023-03-24 03:42:01] [INFO ] Computed 975 place invariants in 1010 ms
[2023-03-24 03:42:05] [INFO ] After 3073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 03:42:08] [INFO ] [Nat]Absence check using 64 positive place invariants in 76 ms returned sat
[2023-03-24 03:42:08] [INFO ] [Nat]Absence check using 64 positive and 911 generalized place invariants in 641 ms returned sat
[2023-03-24 03:42:30] [INFO ] After 20764ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-24 03:42:30] [INFO ] State equation strengthened by 5002 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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.Application.startNoEx(Application.java:902)
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-24 03:42:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:42:30] [INFO ] After 25147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 115 out of 11106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Graph (complete) has 37715 edges and 11106 vertex of which 11069 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.41 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions removed 2908 transitions
Trivial Post-agglo rules discarded 2908 transitions
Performed 2908 trivial Post agglomeration. Transition count delta: 2908
Iterating post reduction 0 with 2908 rules applied. Total rules applied 2909 place count 11069 transition count 13653
Reduce places removed 2908 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 2958 rules applied. Total rules applied 5867 place count 8161 transition count 13603
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 5917 place count 8111 transition count 13603
Performed 244 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 244 Pre rules applied. Total rules applied 5917 place count 8111 transition count 13359
Deduced a syphon composed of 244 places in 12 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 3 with 488 rules applied. Total rules applied 6405 place count 7867 transition count 13359
Discarding 2681 places :
Symmetric choice reduction at 3 with 2681 rule applications. Total rules 9086 place count 5186 transition count 10678
Iterating global reduction 3 with 2681 rules applied. Total rules applied 11767 place count 5186 transition count 10678
Discarding 479 places :
Symmetric choice reduction at 3 with 479 rule applications. Total rules 12246 place count 4707 transition count 8283
Iterating global reduction 3 with 479 rules applied. Total rules applied 12725 place count 4707 transition count 8283
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 12775 place count 4682 transition count 8258
Free-agglomeration rule (complex) applied 381 times.
Iterating global reduction 3 with 381 rules applied. Total rules applied 13156 place count 4682 transition count 9373
Reduce places removed 381 places and 0 transitions.
Iterating post reduction 3 with 381 rules applied. Total rules applied 13537 place count 4301 transition count 9373
Partial Free-agglomeration rule applied 248 times.
Drop transitions removed 248 transitions
Iterating global reduction 4 with 248 rules applied. Total rules applied 13785 place count 4301 transition count 9373
Applied a total of 13785 rules in 5024 ms. Remains 4301 /11106 variables (removed 6805) and now considering 9373/16561 (removed 7188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5026 ms. Remains : 4301/11106 places, 9373/16561 transitions.
Incomplete random walk after 10000 steps, including 305 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 4) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 03:42:35] [INFO ] Flow matrix only has 8492 transitions (discarded 881 similar events)
// Phase 1: matrix 8492 rows 4301 cols
[2023-03-24 03:42:36] [INFO ] Computed 938 place invariants in 206 ms
[2023-03-24 03:42:36] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:42:37] [INFO ] [Nat]Absence check using 47 positive place invariants in 37 ms returned sat
[2023-03-24 03:42:37] [INFO ] [Nat]Absence check using 47 positive and 891 generalized place invariants in 272 ms returned sat
[2023-03-24 03:42:42] [INFO ] After 5017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:42:42] [INFO ] State equation strengthened by 4582 read => feed constraints.
[2023-03-24 03:42:50] [INFO ] After 7384ms SMT Verify possible using 4582 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-24 03:42:51] [INFO ] After 8466ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-24 03:42:51] [INFO ] After 14760ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 9373/9373 transitions.
Graph (complete) has 32777 edges and 4301 vertex of which 4300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 4300 transition count 9333
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 4260 transition count 9333
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 81 place count 4260 transition count 9327
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 4254 transition count 9327
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 4243 transition count 9316
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 4243 transition count 9316
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 148 place count 4243 transition count 9703
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 181 place count 4210 transition count 9703
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 218 place count 4173 transition count 9666
Iterating global reduction 3 with 37 rules applied. Total rules applied 255 place count 4173 transition count 9666
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 274 place count 4173 transition count 9666
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 292 place count 4155 transition count 9648
Iterating global reduction 3 with 18 rules applied. Total rules applied 310 place count 4155 transition count 9648
Applied a total of 310 rules in 2834 ms. Remains 4155 /4301 variables (removed 146) and now considering 9648/9373 (removed -275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2834 ms. Remains : 4155/4301 places, 9648/9373 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10850 steps, run visited all 1 properties in 1350 ms. (steps per millisecond=8 )
Probabilistic random walk after 10850 steps, saw 5066 distinct states, run finished after 1351 ms. (steps per millisecond=8 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 58254 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/474/inv_0_ --invariant=/tmp/474/inv_1_ --invariant=/tmp/474/inv_2_ --invariant=/tmp/474/inv_3_ --invariant=/tmp/474/inv_4_ --invariant=/tmp/474/inv_5_ --invariant=/tmp/474/inv_6_ --invariant=/tmp/474/inv_7_ --invariant=/tmp/474/inv_8_ --invariant=/tmp/474/inv_9_ --invariant=/tmp/474/inv_10_ --invariant=/tmp/474/inv_11_ --invariant=/tmp/474/inv_12_ --invariant=/tmp/474/inv_13_ --invariant=/tmp/474/inv_14_ --invariant=/tmp/474/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 825208 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086100 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="MultiCrashLeafsetExtension-PT-S24C05"
export BK_EXAMINATION="ReachabilityCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419500830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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