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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16120.424 3600000.00 13375603.00 1217.70 FTFTTTTTFFFFTTFF 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-167856419500846.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-S24C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419500846
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 26 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:38 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 14M 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-S24C07-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679636503086

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-S24C07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 05:41:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 05:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:41:45] [INFO ] Load time of PNML (sax parser for PT used): 524 ms
[2023-03-24 05:41:45] [INFO ] Transformed 13822 places.
[2023-03-24 05:41:45] [INFO ] Transformed 20365 transitions.
[2023-03-24 05:41:45] [INFO ] Parsed PT model containing 13822 places and 20365 transitions and 77774 arcs in 672 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 139 resets, run finished after 836 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 26 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 26 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 05:41:47] [INFO ] Flow matrix only has 19765 transitions (discarded 600 similar events)
// Phase 1: matrix 19765 rows 13822 cols
[2023-03-24 05:41:49] [INFO ] Computed 1083 place invariants in 1431 ms
[2023-03-24 05:41:53] [INFO ] [Real]Absence check using 68 positive place invariants in 67 ms returned sat
[2023-03-24 05:41:54] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 733 ms returned sat
[2023-03-24 05:41:54] [INFO ] After 4761ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-24 05:41:57] [INFO ] [Nat]Absence check using 68 positive place invariants in 55 ms returned sat
[2023-03-24 05:41:58] [INFO ] [Nat]Absence check using 68 positive and 1015 generalized place invariants in 752 ms returned sat
[2023-03-24 05:42:19] [INFO ] After 20455ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :0
[2023-03-24 05:42:19] [INFO ] State equation strengthened by 6202 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 05:42:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:42:19] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:12
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-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 4 out of 13822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13822/13822 places, 20365/20365 transitions.
Graph (complete) has 45351 edges and 13822 vertex of which 13780 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.39 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 4196 transitions
Trivial Post-agglo rules discarded 4196 transitions
Performed 4196 trivial Post agglomeration. Transition count delta: 4196
Iterating post reduction 0 with 4196 rules applied. Total rules applied 4197 place count 13780 transition count 16169
Reduce places removed 4196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4197 rules applied. Total rules applied 8394 place count 9584 transition count 16168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8395 place count 9583 transition count 16168
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 350 Pre rules applied. Total rules applied 8395 place count 9583 transition count 15818
Deduced a syphon composed of 350 places in 13 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 9095 place count 9233 transition count 15818
Discarding 3846 places :
Symmetric choice reduction at 3 with 3846 rule applications. Total rules 12941 place count 5387 transition count 11972
Iterating global reduction 3 with 3846 rules applied. Total rules applied 16787 place count 5387 transition count 11972
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 16787 place count 5387 transition count 11962
Deduced a syphon composed of 10 places in 25 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 16807 place count 5377 transition count 11962
Discarding 546 places :
Symmetric choice reduction at 3 with 546 rule applications. Total rules 17353 place count 4831 transition count 8140
Iterating global reduction 3 with 546 rules applied. Total rules applied 17899 place count 4831 transition count 8140
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 17949 place count 4806 transition count 8115
Free-agglomeration rule (complex) applied 340 times.
Iterating global reduction 3 with 340 rules applied. Total rules applied 18289 place count 4806 transition count 11051
Reduce places removed 340 places and 0 transitions.
Iterating post reduction 3 with 340 rules applied. Total rules applied 18629 place count 4466 transition count 11051
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 18729 place count 4466 transition count 11051
Applied a total of 18729 rules in 5998 ms. Remains 4466 /13822 variables (removed 9356) and now considering 11051/20365 (removed 9314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6001 ms. Remains : 4466/13822 places, 11051/20365 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19967 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{1=1}
Probabilistic random walk after 19967 steps, saw 9211 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-24 05:42:29] [INFO ] Flow matrix only has 10165 transitions (discarded 886 similar events)
// Phase 1: matrix 10165 rows 4466 cols
[2023-03-24 05:42:29] [INFO ] Computed 1041 place invariants in 265 ms
[2023-03-24 05:42:29] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:42:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2023-03-24 05:42:30] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 253 ms returned sat
[2023-03-24 05:42:35] [INFO ] After 4774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:42:35] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2023-03-24 05:42:38] [INFO ] After 3260ms SMT Verify possible using 6202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:42:44] [INFO ] Deduced a trap composed of 223 places in 5483 ms of which 64 ms to minimize.
[2023-03-24 05:42:50] [INFO ] Deduced a trap composed of 386 places in 5256 ms of which 5 ms to minimize.
[2023-03-24 05:42:57] [INFO ] Deduced a trap composed of 558 places in 5121 ms of which 5 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 05:42:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:42:57] [INFO ] After 27647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 4466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4466/4466 places, 11051/11051 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4466 transition count 11050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4465 transition count 11050
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4465 transition count 11048
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 4463 transition count 11048
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 4461 transition count 11046
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 4461 transition count 11046
Applied a total of 10 rules in 1742 ms. Remains 4461 /4466 variables (removed 5) and now considering 11046/11051 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1742 ms. Remains : 4461/4466 places, 11046/11051 transitions.
Finished random walk after 7410 steps, including 170 resets, run visited all 1 properties in 291 ms. (steps per millisecond=25 )
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 74911 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/481/inv_0_ --invariant=/tmp/481/inv_1_ --invariant=/tmp/481/inv_2_ --invariant=/tmp/481/inv_3_ --invariant=/tmp/481/inv_4_ --invariant=/tmp/481/inv_5_ --invariant=/tmp/481/inv_6_ --invariant=/tmp/481/inv_7_ --invariant=/tmp/481/inv_8_ --invariant=/tmp/481/inv_9_ --invariant=/tmp/481/inv_10_ --invariant=/tmp/481/inv_11_ --invariant=/tmp/481/inv_12_ --invariant=/tmp/481/inv_13_ --invariant=/tmp/481/inv_14_ --invariant=/tmp/481/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 170268 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16211340 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-S24C07"
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-S24C07, 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-167856419500846"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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