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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
819.476 244777.00 300507.00 630.00 T 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.r247-tall-167856434500468.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-S16C02, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r247-tall-167856434500468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 12K Feb 26 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 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 3.0M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678714078125

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=MultiCrashLeafsetExtension-PT-S16C02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 13:27:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 13:28:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:28:00] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-13 13:28:00] [INFO ] Transformed 2952 places.
[2023-03-13 13:28:00] [INFO ] Transformed 4255 transitions.
[2023-03-13 13:28:00] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 282 ms.
Incomplete random walk after 10000 steps, including 468 resets, run finished after 1437 ms. (steps per millisecond=6 ) properties (out of 2952) seen :1939
Running SMT prover for 1013 properties.
[2023-03-13 13:28:01] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-13 13:28:02] [INFO ] Computed 421 place invariants in 177 ms
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-13 13:28:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 13:28:27] [INFO ] After 25081ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1013 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1013 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.13 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 396 place count 2928 transition count 3860
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 791 place count 2533 transition count 3860
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 791 place count 2533 transition count 3792
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 927 place count 2465 transition count 3792
Discarding 327 places :
Symmetric choice reduction at 2 with 327 rule applications. Total rules 1254 place count 2138 transition count 3465
Iterating global reduction 2 with 327 rules applied. Total rules applied 1581 place count 2138 transition count 3465
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 1680 place count 2039 transition count 3267
Iterating global reduction 2 with 99 rules applied. Total rules applied 1779 place count 2039 transition count 3267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1783 place count 2037 transition count 3265
Free-agglomeration rule (complex) applied 178 times.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1961 place count 2037 transition count 3186
Reduce places removed 178 places and 0 transitions.
Iterating post reduction 2 with 178 rules applied. Total rules applied 2139 place count 1859 transition count 3186
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 3 with 68 rules applied. Total rules applied 2207 place count 1859 transition count 3186
Applied a total of 2207 rules in 777 ms. Remains 1859 /2952 variables (removed 1093) and now considering 3186/4255 (removed 1069) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 1859/2952 places, 3186/4255 transitions.
Interrupted random walk after 443795 steps, including 31992 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 367
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 646) seen :0
Running SMT prover for 646 properties.
[2023-03-13 13:28:59] [INFO ] Flow matrix only has 2899 transitions (discarded 287 similar events)
// Phase 1: matrix 2899 rows 1859 cols
[2023-03-13 13:28:59] [INFO ] Computed 397 place invariants in 54 ms
[2023-03-13 13:29:20] [INFO ] After 20787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:646
[2023-03-13 13:29:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2023-03-13 13:29:37] [INFO ] [Nat]Absence check using 33 positive and 364 generalized place invariants in 88 ms returned sat
[2023-03-13 13:30:49] [INFO ] After 53167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :646
[2023-03-13 13:30:49] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2023-03-13 13:31:03] [INFO ] After 14631ms SMT Verify possible using 1090 Read/Feed constraints in natural domain returned unsat :590 sat :56
[2023-03-13 13:31:05] [INFO ] Deduced a trap composed of 352 places in 1096 ms of which 12 ms to minimize.
[2023-03-13 13:31:06] [INFO ] Deduced a trap composed of 256 places in 1197 ms of which 2 ms to minimize.
[2023-03-13 13:31:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2564 ms
[2023-03-13 13:31:08] [INFO ] Deduced a trap composed of 251 places in 1157 ms of which 2 ms to minimize.
[2023-03-13 13:31:09] [INFO ] Deduced a trap composed of 341 places in 1090 ms of which 4 ms to minimize.
[2023-03-13 13:31:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2516 ms
[2023-03-13 13:31:10] [INFO ] Deduced a trap composed of 249 places in 1129 ms of which 1 ms to minimize.
[2023-03-13 13:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1323 ms
[2023-03-13 13:31:12] [INFO ] Deduced a trap composed of 374 places in 1074 ms of which 2 ms to minimize.
[2023-03-13 13:31:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1259 ms
[2023-03-13 13:31:14] [INFO ] Deduced a trap composed of 259 places in 1150 ms of which 1 ms to minimize.
[2023-03-13 13:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1323 ms
[2023-03-13 13:31:16] [INFO ] Deduced a trap composed of 253 places in 1105 ms of which 3 ms to minimize.
[2023-03-13 13:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1295 ms
[2023-03-13 13:31:17] [INFO ] Deduced a trap composed of 228 places in 1112 ms of which 2 ms to minimize.
[2023-03-13 13:31:19] [INFO ] Deduced a trap composed of 267 places in 1094 ms of which 2 ms to minimize.
[2023-03-13 13:31:20] [INFO ] Deduced a trap composed of 264 places in 1095 ms of which 1 ms to minimize.
[2023-03-13 13:31:21] [INFO ] Deduced a trap composed of 221 places in 1098 ms of which 2 ms to minimize.
[2023-03-13 13:31:22] [INFO ] Deduced a trap composed of 372 places in 1054 ms of which 2 ms to minimize.
[2023-03-13 13:31:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6015 ms
[2023-03-13 13:31:25] [INFO ] Deduced a trap composed of 369 places in 1057 ms of which 2 ms to minimize.
[2023-03-13 13:31:26] [INFO ] Deduced a trap composed of 266 places in 1166 ms of which 2 ms to minimize.
[2023-03-13 13:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2494 ms
[2023-03-13 13:31:28] [INFO ] Deduced a trap composed of 418 places in 1058 ms of which 2 ms to minimize.
[2023-03-13 13:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1239 ms
[2023-03-13 13:31:29] [INFO ] Deduced a trap composed of 373 places in 1159 ms of which 2 ms to minimize.
[2023-03-13 13:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1346 ms
[2023-03-13 13:31:32] [INFO ] Deduced a trap composed of 254 places in 1150 ms of which 1 ms to minimize.
[2023-03-13 13:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1375 ms
[2023-03-13 13:31:34] [INFO ] Deduced a trap composed of 212 places in 1138 ms of which 2 ms to minimize.
[2023-03-13 13:31:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1313 ms
[2023-03-13 13:31:36] [INFO ] Deduced a trap composed of 223 places in 1156 ms of which 2 ms to minimize.
[2023-03-13 13:31:37] [INFO ] Deduced a trap composed of 224 places in 1161 ms of which 1 ms to minimize.
[2023-03-13 13:31:39] [INFO ] Deduced a trap composed of 251 places in 1160 ms of which 2 ms to minimize.
[2023-03-13 13:31:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3900 ms
[2023-03-13 13:31:40] [INFO ] Deduced a trap composed of 269 places in 1168 ms of which 2 ms to minimize.
[2023-03-13 13:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1352 ms
[2023-03-13 13:31:42] [INFO ] Deduced a trap composed of 218 places in 1169 ms of which 3 ms to minimize.
[2023-03-13 13:31:43] [INFO ] Deduced a trap composed of 263 places in 1092 ms of which 2 ms to minimize.
[2023-03-13 13:31:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2569 ms
[2023-03-13 13:31:45] [INFO ] Deduced a trap composed of 254 places in 1085 ms of which 1 ms to minimize.
[2023-03-13 13:31:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1379 ms
[2023-03-13 13:31:47] [INFO ] Deduced a trap composed of 250 places in 1140 ms of which 2 ms to minimize.
[2023-03-13 13:31:48] [INFO ] Deduced a trap composed of 378 places in 1009 ms of which 1 ms to minimize.
[2023-03-13 13:31:50] [INFO ] Deduced a trap composed of 259 places in 1105 ms of which 1 ms to minimize.
[2023-03-13 13:31:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3609 ms
[2023-03-13 13:31:50] [INFO ] After 61586ms SMT Verify possible using trap constraints in natural domain returned unsat :590 sat :56
Attempting to minimize the solution found.
Minimization took 11119 ms.
[2023-03-13 13:32:01] [INFO ] After 161629ms SMT Verify possible using all constraints in natural domain returned unsat :590 sat :56
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 241897 ms.
ITS solved all properties within timeout

BK_STOP 1678714322902

--------------------
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 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="MultiCrashLeafsetExtension-PT-S16C02"
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 MultiCrashLeafsetExtension-PT-S16C02, 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 r247-tall-167856434500468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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