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-167905978800318.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 ShieldRVt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 489K 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 ShieldRVt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679349518988

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:58:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:58:40] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-20 21:58:40] [INFO ] Transformed 2003 places.
[2023-03-20 21:58:40] [INFO ] Transformed 2003 transitions.
[2023-03-20 21:58:40] [INFO ] Found NUPN structural information;
[2023-03-20 21:58:40] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 14) seen :5
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-20 21:58:41] [INFO ] Computed 161 place invariants in 21 ms
[2023-03-20 21:58:42] [INFO ] After 1111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 21:58:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 72 ms returned sat
[2023-03-20 21:58:47] [INFO ] After 4006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 21:58:49] [INFO ] Deduced a trap composed of 45 places in 539 ms of which 8 ms to minimize.
[2023-03-20 21:58:49] [INFO ] Deduced a trap composed of 30 places in 583 ms of which 5 ms to minimize.
[2023-03-20 21:58:50] [INFO ] Deduced a trap composed of 39 places in 518 ms of which 2 ms to minimize.
[2023-03-20 21:58:51] [INFO ] Deduced a trap composed of 41 places in 485 ms of which 2 ms to minimize.
[2023-03-20 21:58:51] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 2 ms to minimize.
[2023-03-20 21:58:52] [INFO ] Deduced a trap composed of 51 places in 429 ms of which 1 ms to minimize.
[2023-03-20 21:58:52] [INFO ] Deduced a trap composed of 50 places in 397 ms of which 1 ms to minimize.
[2023-03-20 21:58:53] [INFO ] Deduced a trap composed of 61 places in 451 ms of which 1 ms to minimize.
[2023-03-20 21:58:53] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 2 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 60 places in 369 ms of which 1 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 73 places in 380 ms of which 1 ms to minimize.
[2023-03-20 21:58:54] [INFO ] Deduced a trap composed of 66 places in 302 ms of which 1 ms to minimize.
[2023-03-20 21:58:55] [INFO ] Deduced a trap composed of 58 places in 322 ms of which 1 ms to minimize.
[2023-03-20 21:58:55] [INFO ] Deduced a trap composed of 55 places in 329 ms of which 1 ms to minimize.
[2023-03-20 21:58:56] [INFO ] Deduced a trap composed of 53 places in 343 ms of which 1 ms to minimize.
[2023-03-20 21:58:56] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 1 ms to minimize.
[2023-03-20 21:58:56] [INFO ] Deduced a trap composed of 55 places in 317 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 56 places in 303 ms of which 1 ms to minimize.
[2023-03-20 21:58:57] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 1 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Deduced a trap composed of 62 places in 291 ms of which 1 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 0 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:58:58] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 10299 ms
[2023-03-20 21:58:59] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 1 ms to minimize.
[2023-03-20 21:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-20 21:59:00] [INFO ] Deduced a trap composed of 22 places in 581 ms of which 2 ms to minimize.
[2023-03-20 21:59:01] [INFO ] Deduced a trap composed of 33 places in 569 ms of which 2 ms to minimize.
[2023-03-20 21:59:01] [INFO ] Deduced a trap composed of 35 places in 569 ms of which 2 ms to minimize.
[2023-03-20 21:59:02] [INFO ] Deduced a trap composed of 44 places in 532 ms of which 1 ms to minimize.
[2023-03-20 21:59:02] [INFO ] Deduced a trap composed of 37 places in 494 ms of which 2 ms to minimize.
[2023-03-20 21:59:03] [INFO ] Deduced a trap composed of 37 places in 483 ms of which 1 ms to minimize.
[2023-03-20 21:59:04] [INFO ] Deduced a trap composed of 55 places in 554 ms of which 6 ms to minimize.
[2023-03-20 21:59:04] [INFO ] Deduced a trap composed of 58 places in 509 ms of which 1 ms to minimize.
[2023-03-20 21:59:05] [INFO ] Deduced a trap composed of 50 places in 498 ms of which 1 ms to minimize.
[2023-03-20 21:59:05] [INFO ] Deduced a trap composed of 38 places in 487 ms of which 2 ms to minimize.
[2023-03-20 21:59:06] [INFO ] Deduced a trap composed of 59 places in 489 ms of which 4 ms to minimize.
[2023-03-20 21:59:07] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 1 ms to minimize.
[2023-03-20 21:59:07] [INFO ] Deduced a trap composed of 51 places in 484 ms of which 3 ms to minimize.
[2023-03-20 21:59:08] [INFO ] Deduced a trap composed of 32 places in 450 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 21:59:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:59:08] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 847 ms.
Support contains 125 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 536 transitions
Trivial Post-agglo rules discarded 536 transitions
Performed 536 trivial Post agglomeration. Transition count delta: 536
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 2003 transition count 1467
Reduce places removed 536 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 538 rules applied. Total rules applied 1074 place count 1467 transition count 1465
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 1102 place count 1466 transition count 1438
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1129 place count 1439 transition count 1438
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1129 place count 1439 transition count 1269
Deduced a syphon composed of 169 places in 2 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1467 place count 1270 transition count 1269
Discarding 237 places :
Symmetric choice reduction at 4 with 237 rule applications. Total rules 1704 place count 1033 transition count 1032
Iterating global reduction 4 with 237 rules applied. Total rules applied 1941 place count 1033 transition count 1032
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 1941 place count 1033 transition count 936
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 2133 place count 937 transition count 936
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 2 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 4 with 658 rules applied. Total rules applied 2791 place count 608 transition count 607
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 2981 place count 513 transition count 673
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2982 place count 513 transition count 672
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2992 place count 513 transition count 662
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 3002 place count 503 transition count 662
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3003 place count 503 transition count 661
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3006 place count 503 transition count 661
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3007 place count 503 transition count 660
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3008 place count 502 transition count 659
Applied a total of 3008 rules in 520 ms. Remains 502 /2003 variables (removed 1501) and now considering 659/2003 (removed 1344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 521 ms. Remains : 502/2003 places, 659/2003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 9) seen :2
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 659 rows 502 cols
[2023-03-20 21:59:09] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 21:59:10] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:59:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-20 21:59:10] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:10] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-20 21:59:11] [INFO ] After 795ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:11] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-20 21:59:11] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 905 ms
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-20 21:59:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-20 21:59:13] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-20 21:59:13] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-20 21:59:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-20 21:59:13] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-20 21:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-20 21:59:13] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:59:14] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-20 21:59:14] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-20 21:59:14] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-20 21:59:14] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-20 21:59:14] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-03-20 21:59:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 829 ms
[2023-03-20 21:59:14] [INFO ] After 3831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 714 ms.
[2023-03-20 21:59:15] [INFO ] After 5286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 158 ms.
Support contains 123 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 659/659 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 501 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 500 transition count 658
Applied a total of 4 rules in 55 ms. Remains 500 /502 variables (removed 2) and now considering 658/659 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 500/502 places, 658/659 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 166181 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166181 steps, saw 102986 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 658 rows 500 cols
[2023-03-20 21:59:19] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 21:59:19] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:59:19] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-20 21:59:19] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:19] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-20 21:59:20] [INFO ] After 614ms SMT Verify possible using 239 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-20 21:59:23] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-20 21:59:23] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-20 21:59:23] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2023-03-20 21:59:23] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-20 21:59:23] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-20 21:59:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1843 ms
[2023-03-20 21:59:23] [INFO ] After 3812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 943 ms.
[2023-03-20 21:59:24] [INFO ] After 5382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 91 ms.
Support contains 123 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 658/658 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 500/500 places, 658/658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 658/658 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 658/658 (removed 0) transitions.
[2023-03-20 21:59:24] [INFO ] Invariant cache hit.
[2023-03-20 21:59:25] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-20 21:59:25] [INFO ] Invariant cache hit.
[2023-03-20 21:59:25] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-20 21:59:26] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2023-03-20 21:59:26] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-20 21:59:26] [INFO ] Invariant cache hit.
[2023-03-20 21:59:26] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1628 ms. Remains : 500/500 places, 658/658 transitions.
Graph (trivial) has 83 edges and 500 vertex of which 4 / 500 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1514 edges and 498 vertex of which 496 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 80 edges and 494 vertex of which 4 / 494 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 492 transition count 649
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 79 edges and 490 vertex of which 4 / 490 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 488 transition count 640
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 488 transition count 636
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 51 place count 488 transition count 609
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 488 transition count 609
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 488 transition count 608
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 82 place count 488 transition count 598
Applied a total of 82 rules in 66 ms. Remains 488 /500 variables (removed 12) and now considering 598/658 (removed 60) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 598 rows 488 cols
[2023-03-20 21:59:26] [INFO ] Computed 156 place invariants in 2 ms
[2023-03-20 21:59:26] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:59:26] [INFO ] [Nat]Absence check using 156 positive place invariants in 23 ms returned sat
[2023-03-20 21:59:27] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 21:59:27] [INFO ] After 270ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-20 21:59:27] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-20 21:59:27] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-20 21:59:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 466 ms
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-20 21:59:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 427 ms
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 900 ms
[2023-03-20 21:59:29] [INFO ] After 2431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-03-20 21:59:30] [INFO ] After 3465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-20 21:59:30] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-20 21:59:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 658 transitions and 3048 arcs took 11 ms.
[2023-03-20 21:59:30] [INFO ] Flatten gal took : 103 ms
Total runtime 49929 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_040B
(NrP: 500 NrTr: 658 NrArc: 3048)

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

net check time: 0m 0.000sec

init dd package: 0m 3.037sec


before gc: list nodes free: 1953118

after gc: idd nodes used:44459292, unused:19540708; list nodes free:86482366

RS generation: 9m52.554sec


-> last computed set: #nodes 44458793 (4.4e+07) #states 193,492,593,028 (11)


CANNOT_COMPUTE


BK_STOP 1679350192573

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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.002sec

idd.cc:820: DD Exception: No free nodes

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="ShieldRVt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVt-PT-040B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978800318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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