Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800127.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 370K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679298922530

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:55:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:55:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:55:24] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-20 07:55:24] [INFO ] Transformed 1203 places.
[2023-03-20 07:55:24] [INFO ] Transformed 1353 transitions.
[2023-03-20 07:55:24] [INFO ] Found NUPN structural information;
[2023-03-20 07:55:24] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-20 07:55:24] [INFO ] Computed 121 place invariants in 29 ms
[2023-03-20 07:55:25] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 07:55:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 46 ms returned sat
[2023-03-20 07:55:27] [INFO ] After 1611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 07:55:28] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 6 ms to minimize.
[2023-03-20 07:55:28] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 1 ms to minimize.
[2023-03-20 07:55:28] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 1 ms to minimize.
[2023-03-20 07:55:29] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 2 ms to minimize.
[2023-03-20 07:55:29] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 1 ms to minimize.
[2023-03-20 07:55:30] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 1 ms to minimize.
[2023-03-20 07:55:30] [INFO ] Deduced a trap composed of 48 places in 317 ms of which 1 ms to minimize.
[2023-03-20 07:55:30] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2023-03-20 07:55:31] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2023-03-20 07:55:31] [INFO ] Deduced a trap composed of 16 places in 357 ms of which 1 ms to minimize.
[2023-03-20 07:55:32] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2023-03-20 07:55:32] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 1 ms to minimize.
[2023-03-20 07:55:32] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 0 ms to minimize.
[2023-03-20 07:55:33] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 0 ms to minimize.
[2023-03-20 07:55:33] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 1 ms to minimize.
[2023-03-20 07:55:33] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 0 ms to minimize.
[2023-03-20 07:55:34] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 1 ms to minimize.
[2023-03-20 07:55:34] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 1 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 1 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2023-03-20 07:55:35] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 1 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2023-03-20 07:55:36] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2023-03-20 07:55:37] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 1 ms to minimize.
[2023-03-20 07:55:37] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
[2023-03-20 07:55:37] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2023-03-20 07:55:38] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 0 ms to minimize.
[2023-03-20 07:55:38] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 1 ms to minimize.
[2023-03-20 07:55:38] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2023-03-20 07:55:39] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 1 ms to minimize.
[2023-03-20 07:55:39] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 1 ms to minimize.
[2023-03-20 07:55:39] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 1 ms to minimize.
[2023-03-20 07:55:39] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 4 ms to minimize.
[2023-03-20 07:55:40] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 1 ms to minimize.
[2023-03-20 07:55:40] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 0 ms to minimize.
[2023-03-20 07:55:40] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 1 ms to minimize.
[2023-03-20 07:55:41] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 1 ms to minimize.
[2023-03-20 07:55:41] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 0 ms to minimize.
[2023-03-20 07:55:41] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 0 ms to minimize.
[2023-03-20 07:55:42] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 1 ms to minimize.
[2023-03-20 07:55:42] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-20 07:55:42] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 1 ms to minimize.
[2023-03-20 07:55:42] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 0 ms to minimize.
[2023-03-20 07:55:43] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 1 ms to minimize.
[2023-03-20 07:55:43] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 1 ms to minimize.
[2023-03-20 07:55:43] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 1 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 1 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 1 ms to minimize.
[2023-03-20 07:55:44] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 1 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 0 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 17903 ms
[2023-03-20 07:55:46] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 2 ms to minimize.
[2023-03-20 07:55:46] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 5 ms to minimize.
[2023-03-20 07:55:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-20 07:55:46] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 1 ms to minimize.
[2023-03-20 07:55:47] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 1 ms to minimize.
[2023-03-20 07:55:47] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 1 ms to minimize.
[2023-03-20 07:55:47] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 0 ms to minimize.
[2023-03-20 07:55:48] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2023-03-20 07:55:48] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 1 ms to minimize.
[2023-03-20 07:55:48] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 1 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 2 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 1 ms to minimize.
[2023-03-20 07:55:50] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 2 ms to minimize.
[2023-03-20 07:55:50] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 3 ms to minimize.
[2023-03-20 07:55:50] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 1 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-20 07:55:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:55:50] [INFO ] After 25196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 231 ms.
Support contains 161 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1203 transition count 1263
Reduce places removed 90 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 97 rules applied. Total rules applied 187 place count 1113 transition count 1256
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 194 place count 1106 transition count 1256
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 194 place count 1106 transition count 1120
Deduced a syphon composed of 136 places in 6 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 466 place count 970 transition count 1120
Discarding 171 places :
Symmetric choice reduction at 3 with 171 rule applications. Total rules 637 place count 799 transition count 949
Iterating global reduction 3 with 171 rules applied. Total rules applied 808 place count 799 transition count 949
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 808 place count 799 transition count 900
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 906 place count 750 transition count 900
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Deduced a syphon composed of 187 places in 3 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 3 with 374 rules applied. Total rules applied 1280 place count 563 transition count 713
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 3 with 47 rules applied. Total rules applied 1327 place count 563 transition count 713
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1328 place count 562 transition count 712
Applied a total of 1328 rules in 338 ms. Remains 562 /1203 variables (removed 641) and now considering 712/1353 (removed 641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 562/1203 places, 712/1353 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 226630 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226630 steps, saw 51018 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 712 rows 562 cols
[2023-03-20 07:55:54] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 07:55:54] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:55:55] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-20 07:55:55] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:55:55] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-20 07:55:56] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-20 07:55:56] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2023-03-20 07:55:56] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:55:56] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-20 07:55:56] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-20 07:55:56] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:55:57] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-20 07:55:57] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-20 07:55:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2023-03-20 07:55:57] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-20 07:55:57] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-20 07:55:57] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-20 07:55:58] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-20 07:55:58] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-20 07:55:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2379 ms
[2023-03-20 07:55:58] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-20 07:55:58] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-20 07:55:58] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-20 07:55:58] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-20 07:55:59] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-20 07:55:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:55:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 658 ms
[2023-03-20 07:55:59] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:55:59] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-20 07:55:59] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-20 07:55:59] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-20 07:56:00] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1899 ms
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-20 07:56:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 419 ms
[2023-03-20 07:56:01] [INFO ] After 6614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 639 ms.
[2023-03-20 07:56:02] [INFO ] After 7426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 60 ms.
Support contains 161 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 712/712 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 562/562 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 712/712 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2023-03-20 07:56:02] [INFO ] Invariant cache hit.
[2023-03-20 07:56:02] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-20 07:56:02] [INFO ] Invariant cache hit.
[2023-03-20 07:56:03] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-20 07:56:03] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-20 07:56:03] [INFO ] Invariant cache hit.
[2023-03-20 07:56:03] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1039 ms. Remains : 562/562 places, 712/712 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-20 07:56:03] [INFO ] Invariant cache hit.
[2023-03-20 07:56:03] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:56:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-20 07:56:04] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:56:04] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:56:04] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:56:04] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:56:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 904 ms
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-20 07:56:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 544 ms
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2023-03-20 07:56:06] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 508 ms
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:56:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 705 ms
[2023-03-20 07:56:07] [INFO ] After 4181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 513 ms.
[2023-03-20 07:56:08] [INFO ] After 4862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:56:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2023-03-20 07:56:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 712 transitions and 3110 arcs took 4 ms.
[2023-03-20 07:56:08] [INFO ] Flatten gal took : 112 ms
Total runtime 44793 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/942/inv_0_ --invariant=/tmp/942/inv_1_ --invariant=/tmp/942/inv_2_ --invariant=/tmp/942/inv_3_ --invariant=/tmp/942/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 174416 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16258420 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 ReachabilityFireability -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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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