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.r426-tajo-167905978500127.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 marciexred
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 r426-tajo-167905978500127
=====================================================================

--------------------
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 1679342135353

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:55:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:55:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:55:36] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-20 19:55:36] [INFO ] Transformed 1203 places.
[2023-03-20 19:55:36] [INFO ] Transformed 1353 transitions.
[2023-03-20 19:55:36] [INFO ] Found NUPN structural information;
[2023-03-20 19:55:36] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 177 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 388 ms. (steps per millisecond=25 ) properties (out of 16) seen :11
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-11 TRUE 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 43 ms. (steps per millisecond=232 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-20 19:55:37] [INFO ] Computed 121 place invariants in 18 ms
[2023-03-20 19:55:38] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 19:55:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2023-03-20 19:55:39] [INFO ] After 1243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 19:55:40] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 11 ms to minimize.
[2023-03-20 19:55:40] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 1 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 21 places in 382 ms of which 1 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 2 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 1 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 2 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 1 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 1 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 1 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 0 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 1 ms to minimize.
[2023-03-20 19:55:46] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 0 ms to minimize.
[2023-03-20 19:55:46] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 0 ms to minimize.
[2023-03-20 19:55:46] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2023-03-20 19:55:46] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 1 ms to minimize.
[2023-03-20 19:55:47] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2023-03-20 19:55:47] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 2 ms to minimize.
[2023-03-20 19:55:47] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2023-03-20 19:55:48] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 1 ms to minimize.
[2023-03-20 19:55:48] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 1 ms to minimize.
[2023-03-20 19:55:48] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 1 ms to minimize.
[2023-03-20 19:55:49] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 1 ms to minimize.
[2023-03-20 19:55:49] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 0 ms to minimize.
[2023-03-20 19:55:49] [INFO ] Deduced a trap composed of 37 places in 255 ms of which 1 ms to minimize.
[2023-03-20 19:55:50] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 1 ms to minimize.
[2023-03-20 19:55:50] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 1 ms to minimize.
[2023-03-20 19:55:51] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 0 ms to minimize.
[2023-03-20 19:55:51] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 0 ms to minimize.
[2023-03-20 19:55:51] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 3 ms to minimize.
[2023-03-20 19:55:51] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2023-03-20 19:55:52] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 1 ms to minimize.
[2023-03-20 19:55:52] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 1 ms to minimize.
[2023-03-20 19:55:52] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 1 ms to minimize.
[2023-03-20 19:55:52] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 0 ms to minimize.
[2023-03-20 19:55:53] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2023-03-20 19:55:53] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 13177 ms
[2023-03-20 19:55:53] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2023-03-20 19:55:53] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 1 ms to minimize.
[2023-03-20 19:55:53] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 2 ms to minimize.
[2023-03-20 19:55:54] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 1 ms to minimize.
[2023-03-20 19:55:54] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 1 ms to minimize.
[2023-03-20 19:55:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1229 ms
[2023-03-20 19:55:54] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 1 ms to minimize.
[2023-03-20 19:55:55] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 1 ms to minimize.
[2023-03-20 19:55:55] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 0 ms to minimize.
[2023-03-20 19:55:55] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 0 ms to minimize.
[2023-03-20 19:55:55] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 1 ms to minimize.
[2023-03-20 19:55:55] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2023-03-20 19:55:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1466 ms
[2023-03-20 19:55:56] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 0 ms to minimize.
[2023-03-20 19:55:56] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 1 ms to minimize.
[2023-03-20 19:55:57] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 1 ms to minimize.
[2023-03-20 19:55:57] [INFO ] Deduced a trap composed of 47 places in 351 ms of which 3 ms to minimize.
[2023-03-20 19:55:58] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 4 ms to minimize.
[2023-03-20 19:55:58] [INFO ] Deduced a trap composed of 20 places in 294 ms of which 1 ms to minimize.
[2023-03-20 19:55:58] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 1 ms to minimize.
[2023-03-20 19:55:59] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 1 ms to minimize.
[2023-03-20 19:55:59] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 1 ms to minimize.
[2023-03-20 19:56:00] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 1 ms to minimize.
[2023-03-20 19:56:00] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 1 ms to minimize.
[2023-03-20 19:56:00] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2023-03-20 19:56:00] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 1 ms to minimize.
[2023-03-20 19:56:01] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 2 ms to minimize.
[2023-03-20 19:56:01] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 0 ms to minimize.
[2023-03-20 19:56:01] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2023-03-20 19:56:02] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 2 ms to minimize.
[2023-03-20 19:56:02] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 1 ms to minimize.
[2023-03-20 19:56:02] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 0 ms to minimize.
[2023-03-20 19:56:02] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 1 ms to minimize.
[2023-03-20 19:56:03] [INFO ] Deduced a trap composed of 35 places in 214 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 19:56:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 19:56:03] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 306 ms.
Support contains 112 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1203 transition count 1256
Reduce places removed 97 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 102 rules applied. Total rules applied 199 place count 1106 transition count 1251
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 204 place count 1101 transition count 1251
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 204 place count 1101 transition count 1105
Deduced a syphon composed of 146 places in 3 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 496 place count 955 transition count 1105
Discarding 178 places :
Symmetric choice reduction at 3 with 178 rule applications. Total rules 674 place count 777 transition count 927
Iterating global reduction 3 with 178 rules applied. Total rules applied 852 place count 777 transition count 927
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 852 place count 777 transition count 869
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 968 place count 719 transition count 869
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1366 place count 520 transition count 670
Partial Free-agglomeration rule applied 53 times.
Drop transitions removed 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 1419 place count 520 transition count 670
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1420 place count 519 transition count 669
Applied a total of 1420 rules in 393 ms. Remains 519 /1203 variables (removed 684) and now considering 669/1353 (removed 684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 519/1203 places, 669/1353 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 282011 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 282011 steps, saw 63875 distinct states, run finished after 3002 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 669 rows 519 cols
[2023-03-20 19:56:07] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 19:56:07] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 19:56:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-20 19:56:08] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-20 19:56:08] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1411 ms
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-20 19:56:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 817 ms
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-20 19:56:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 312 ms
[2023-03-20 19:56:10] [INFO ] After 3267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-20 19:56:11] [INFO ] After 3743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 63 ms.
Support contains 112 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 669/669 transitions.
Applied a total of 0 rules in 22 ms. Remains 519 /519 variables (removed 0) and now considering 669/669 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 519/519 places, 669/669 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 669/669 transitions.
Applied a total of 0 rules in 28 ms. Remains 519 /519 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2023-03-20 19:56:11] [INFO ] Invariant cache hit.
[2023-03-20 19:56:11] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-20 19:56:11] [INFO ] Invariant cache hit.
[2023-03-20 19:56:12] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-20 19:56:12] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-20 19:56:12] [INFO ] Invariant cache hit.
[2023-03-20 19:56:12] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1130 ms. Remains : 519/519 places, 669/669 transitions.
Applied a total of 0 rules in 16 ms. Remains 519 /519 variables (removed 0) and now considering 669/669 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 19:56:12] [INFO ] Invariant cache hit.
[2023-03-20 19:56:12] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 19:56:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-20 19:56:13] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:56:13] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 893 ms
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:56:14] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1513 ms
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-03-20 19:56:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-20 19:56:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 850 ms
[2023-03-20 19:56:16] [INFO ] After 3898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-20 19:56:16] [INFO ] After 4348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 19:56:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-20 19:56:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 519 places, 669 transitions and 2989 arcs took 15 ms.
[2023-03-20 19:56:17] [INFO ] Flatten gal took : 105 ms
Total runtime 40481 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVs_PT_030B
(NrP: 519 NrTr: 669 NrArc: 2989)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.040sec

net check time: 0m 0.000sec

init dd package: 0m 3.142sec


before gc: list nodes free: 345969

after gc: idd nodes used:54087, unused:63945913; list nodes free:266088669

before gc: list nodes free: 1431900

after gc: idd nodes used:55840, unused:63944160; list nodes free:268178160

before gc: list nodes free: 1402414

after gc: idd nodes used:60208, unused:63939792; list nodes free:268157932

before gc: list nodes free: 1917492

after gc: idd nodes used:61090, unused:63938910; list nodes free:270250921

before gc: list nodes free: 3552412

after gc: idd nodes used:60330, unused:63939670; list nodes free:270254374

before gc: list nodes free: 3999593

after gc: idd nodes used:61416, unused:63938584; list nodes free:270249716

before gc: list nodes free: 3119810

after gc: idd nodes used:61425, unused:63938575; list nodes free:270249686

before gc: list nodes free: 4057906

after gc: idd nodes used:63723, unused:63936277; list nodes free:270238989

before gc: list nodes free: 1962493

after gc: idd nodes used:61310, unused:63938690; list nodes free:270249829

before gc: list nodes free: 1047609

after gc: idd nodes used:63042, unused:63936958; list nodes free:272338459

before gc: list nodes free: 3050130

after gc: idd nodes used:61141, unused:63938859; list nodes free:272347250

before gc: list nodes free: 4249188

after gc: idd nodes used:64409, unused:63935591; list nodes free:272332394

before gc: list nodes free: 5568785

after gc: idd nodes used:68053, unused:63931947; list nodes free:272316120

before gc: list nodes free: 3429550

after gc: idd nodes used:70224, unused:63929776; list nodes free:272305906

before gc: list nodes free: 4587190

after gc: idd nodes used:68605, unused:63931395; list nodes free:272313809

before gc: list nodes free: 5232549

after gc: idd nodes used:66501, unused:63933499; list nodes free:272323025

before gc: list nodes free: 5230058

after gc: idd nodes used:72585, unused:63927415; list nodes free:272295121

before gc: list nodes free: 4617612

after gc: idd nodes used:69862, unused:63930138; list nodes free:272307821

before gc: list nodes free: 6184329

after gc: idd nodes used:66822, unused:63933178; list nodes free:272322052

before gc: list nodes free: 3134768

after gc: idd nodes used:66719, unused:63933281; list nodes free:272322049
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 6453132 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16094696 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.004sec

23329 34225 36822 37206 52457 45749 50804 49730 51250 49050 50347 51806 53789 47115 54890 50288 48039 50930 56288 62261 57956 66117 63030 58083 57099 61598 58438 58058 53291 55396 55534 54011 55043 56469 54964 57512 58605 57480 59497 57633 58018 57006 55880 63196 59831 66669 60571 61039 59922 62048 61400 64251 62900 58574 61847 60446 59818 59465 64165 62880 59936 71561 63638 63319 62312 65597 66810 62687 63033 66031 61636 59342 60542 62582 63768 59999 60685 59160 59915 64642 60092 59705 61863 60146 60913 62954 60634 60277 61719 62267 62742 62041 64088 61808 66455 64483 66663 65050 63668 64452 60719 58682 60027 61976 64393 61008 62377 59846 62170 60992 60771 59683 59758 67698 60677 59954 59889 61417 63558 58844 66920 62045 65374 61937 63227 63972 64661 62662 58884 60930 62088 59309 61278 59624 59686 62357 59772 62418 61688 62460 62215 72393 62467 64838 70054 62159 65333 62324 61580 62169 71549 62277 63068 63594 62177 60540 61259 63640 60919 60644 63115 60695 62215 60770 60597 62039 60822 63215 63279 65040 63022 68687 62940 63329 60337 62255 63332 72567 63478 64557 63374 64403 65476 63689 66725 65828 66900 66323 70823 69663 65985 63452 77761 68543 68711 66640 67109 67003 74325 73713 72273 68010 65121 67249 66385 65487 66759 67148 66925 69125 67076 65881 67957 66990 69991 69109 68391 70389 67530 67743 67349 65226 67179 66386 65359 68627 65128 66076 67724 67071 67392 66429 67114 65737 67372 65458 66043 67358 67861 67774 67733 68108 67755 69225 69699 70507 69722 69448 69471 66343 64626 73276 66126 68497 65997 65773 65430 64997 67814 68394 71298 65527 67092 64516 64911 66236 65574 65748 65365 69800 69733 67478 66720 67296 73449 67907 67321 66605 67275 63535 63651 63791 66923 64175 67010 65302 63426 66163 64408 67748 65006 66848 65733 68327 66855

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="marciexred"
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 marciexred"
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 r426-tajo-167905978500127"
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 ;