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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679344294867

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=ShieldRVs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:31:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 20:31:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:31:36] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-20 20:31:36] [INFO ] Transformed 2003 places.
[2023-03-20 20:31:36] [INFO ] Transformed 2253 transitions.
[2023-03-20 20:31:36] [INFO ] Found NUPN structural information;
[2023-03-20 20:31:36] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 14) seen :6
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-20 20:31:37] [INFO ] Computed 201 place invariants in 33 ms
[2023-03-20 20:31:38] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 20:31:39] [INFO ] [Nat]Absence check using 201 positive place invariants in 64 ms returned sat
[2023-03-20 20:31:43] [INFO ] After 4590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 20:31:45] [INFO ] Deduced a trap composed of 38 places in 934 ms of which 12 ms to minimize.
[2023-03-20 20:31:46] [INFO ] Deduced a trap composed of 33 places in 649 ms of which 2 ms to minimize.
[2023-03-20 20:31:47] [INFO ] Deduced a trap composed of 46 places in 782 ms of which 2 ms to minimize.
[2023-03-20 20:31:47] [INFO ] Deduced a trap composed of 55 places in 705 ms of which 2 ms to minimize.
[2023-03-20 20:31:48] [INFO ] Deduced a trap composed of 30 places in 795 ms of which 2 ms to minimize.
[2023-03-20 20:31:49] [INFO ] Deduced a trap composed of 31 places in 741 ms of which 2 ms to minimize.
[2023-03-20 20:31:50] [INFO ] Deduced a trap composed of 31 places in 745 ms of which 3 ms to minimize.
[2023-03-20 20:31:51] [INFO ] Deduced a trap composed of 41 places in 752 ms of which 2 ms to minimize.
[2023-03-20 20:31:52] [INFO ] Deduced a trap composed of 36 places in 742 ms of which 1 ms to minimize.
[2023-03-20 20:31:53] [INFO ] Deduced a trap composed of 28 places in 721 ms of which 1 ms to minimize.
[2023-03-20 20:31:53] [INFO ] Deduced a trap composed of 54 places in 715 ms of which 2 ms to minimize.
[2023-03-20 20:31:54] [INFO ] Deduced a trap composed of 40 places in 708 ms of which 1 ms to minimize.
[2023-03-20 20:31:55] [INFO ] Deduced a trap composed of 36 places in 804 ms of which 2 ms to minimize.
[2023-03-20 20:31:56] [INFO ] Deduced a trap composed of 30 places in 667 ms of which 1 ms to minimize.
[2023-03-20 20:31:57] [INFO ] Deduced a trap composed of 31 places in 751 ms of which 2 ms to minimize.
[2023-03-20 20:31:58] [INFO ] Deduced a trap composed of 22 places in 775 ms of which 2 ms to minimize.
[2023-03-20 20:31:59] [INFO ] Deduced a trap composed of 28 places in 730 ms of which 1 ms to minimize.
[2023-03-20 20:31:59] [INFO ] Deduced a trap composed of 34 places in 693 ms of which 2 ms to minimize.
[2023-03-20 20:32:00] [INFO ] Deduced a trap composed of 20 places in 717 ms of which 2 ms to minimize.
[2023-03-20 20:32:01] [INFO ] Deduced a trap composed of 24 places in 703 ms of which 1 ms to minimize.
[2023-03-20 20:32:02] [INFO ] Deduced a trap composed of 22 places in 731 ms of which 1 ms to minimize.
[2023-03-20 20:32:03] [INFO ] Deduced a trap composed of 38 places in 678 ms of which 2 ms to minimize.
[2023-03-20 20:32:03] [INFO ] Deduced a trap composed of 25 places in 755 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 20:32:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:32:03] [INFO ] After 25372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 424 ms.
Support contains 83 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 2003 transition count 2075
Reduce places removed 178 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 188 rules applied. Total rules applied 366 place count 1825 transition count 2065
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 376 place count 1815 transition count 2065
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 376 place count 1815 transition count 1817
Deduced a syphon composed of 248 places in 4 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 872 place count 1567 transition count 1817
Discarding 314 places :
Symmetric choice reduction at 3 with 314 rule applications. Total rules 1186 place count 1253 transition count 1503
Iterating global reduction 3 with 314 rules applied. Total rules applied 1500 place count 1253 transition count 1503
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 1500 place count 1253 transition count 1380
Deduced a syphon composed of 123 places in 5 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 1746 place count 1130 transition count 1380
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 2 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 2424 place count 791 transition count 1041
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 3 with 88 rules applied. Total rules applied 2512 place count 791 transition count 1041
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2513 place count 790 transition count 1040
Applied a total of 2513 rules in 473 ms. Remains 790 /2003 variables (removed 1213) and now considering 1040/2253 (removed 1213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 790/2003 places, 1040/2253 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) seen :2
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) 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 6) 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 6) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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
Running SMT prover for 5 properties.
// Phase 1: matrix 1040 rows 790 cols
[2023-03-20 20:32:05] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-20 20:32:05] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 20:32:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-20 20:32:06] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 20:32:06] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-20 20:32:06] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2023-03-20 20:32:06] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:32:06] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-20 20:32:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1754 ms
[2023-03-20 20:32:08] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-20 20:32:08] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-20 20:32:08] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:32:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 554 ms
[2023-03-20 20:32:08] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-20 20:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-20 20:32:09] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2023-03-20 20:32:09] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-20 20:32:09] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:32:09] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2023-03-20 20:32:09] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:32:09] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2023-03-20 20:32:10] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:32:11] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:32:11] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2023-03-20 20:32:11] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2023-03-20 20:32:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2330 ms
[2023-03-20 20:32:11] [INFO ] After 5720ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-20 20:32:11] [INFO ] After 6165ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldRVs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1040/1040 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 790 transition count 1035
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 785 transition count 1035
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 785 transition count 1025
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 30 place count 775 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 774 transition count 1024
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 774 transition count 1024
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 774 transition count 1023
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 773 transition count 1023
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 118 place count 731 transition count 981
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 731 transition count 981
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 724 transition count 974
Applied a total of 139 rules in 177 ms. Remains 724 /790 variables (removed 66) and now considering 974/1040 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 724/790 places, 974/1040 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 185547 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185547 steps, saw 106510 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 974 rows 724 cols
[2023-03-20 20:32:15] [INFO ] Computed 201 place invariants in 25 ms
[2023-03-20 20:32:15] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 20:32:15] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:32:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 20:32:16] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:32:16] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:32:16] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:32:16] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-20 20:32:16] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-20 20:32:17] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-20 20:32:17] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-20 20:32:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 960 ms
[2023-03-20 20:32:17] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-20 20:32:17] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:32:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2023-03-20 20:32:17] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-20 20:32:17] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 681 ms
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-20 20:32:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 510 ms
[2023-03-20 20:32:18] [INFO ] After 3050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-20 20:32:19] [INFO ] After 3427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 96 ms.
Support contains 21 out of 724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 974/974 transitions.
Applied a total of 0 rules in 32 ms. Remains 724 /724 variables (removed 0) and now considering 974/974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 724/724 places, 974/974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 724/724 places, 974/974 transitions.
Applied a total of 0 rules in 31 ms. Remains 724 /724 variables (removed 0) and now considering 974/974 (removed 0) transitions.
[2023-03-20 20:32:19] [INFO ] Invariant cache hit.
[2023-03-20 20:32:19] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-20 20:32:19] [INFO ] Invariant cache hit.
[2023-03-20 20:32:20] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2023-03-20 20:32:20] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-20 20:32:20] [INFO ] Invariant cache hit.
[2023-03-20 20:32:21] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1884 ms. Remains : 724/724 places, 974/974 transitions.
Applied a total of 0 rules in 19 ms. Remains 724 /724 variables (removed 0) and now considering 974/974 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 20:32:21] [INFO ] Invariant cache hit.
[2023-03-20 20:32:21] [INFO ] [Real]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-20 20:32:21] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:32:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-20 20:32:22] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:32:22] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-20 20:32:22] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:32:22] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:32:22] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:32:22] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:32:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 888 ms
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-03-20 20:32:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2023-03-20 20:32:24] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-20 20:32:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1053 ms
[2023-03-20 20:32:24] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-20 20:32:24] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-20 20:32:24] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-20 20:32:24] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-20 20:32:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 438 ms
[2023-03-20 20:32:24] [INFO ] After 3049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-20 20:32:24] [INFO ] After 3391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 20:32:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-20 20:32:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 724 places, 974 transitions and 4724 arcs took 9 ms.
[2023-03-20 20:32:25] [INFO ] Flatten gal took : 154 ms
Total runtime 48637 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: ShieldRVs_PT_050B
(NrP: 724 NrTr: 974 NrArc: 4724)

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

net check time: 0m 0.000sec

init dd package: 0m 3.140sec


before gc: list nodes free: 563927

after gc: idd nodes used:36532, unused:63963468; list nodes free:282947122

before gc: list nodes free: 2085919

after gc: idd nodes used:38156, unused:63961844; list nodes free:285037249

before gc: list nodes free: 1909093

after gc: idd nodes used:40214, unused:63959786; list nodes free:285027374

before gc: list nodes free: 1697749

after gc: idd nodes used:41286, unused:63958714; list nodes free:285022338

before gc: list nodes free: 1507643

after gc: idd nodes used:42000, unused:63958000; list nodes free:285019070

before gc: list nodes free: 1397911

after gc: idd nodes used:42146, unused:63957854; list nodes free:285018969

before gc: list nodes free: 1601932

after gc: idd nodes used:41830, unused:63958170; list nodes free:285020598

before gc: list nodes free: 1660715

after gc: idd nodes used:43401, unused:63956599; list nodes free:285014229

before gc: list nodes free: 1444101

after gc: idd nodes used:44272, unused:63955728; list nodes free:285010409

before gc: list nodes free: 1959599

after gc: idd nodes used:45137, unused:63954863; list nodes free:285006227

before gc: list nodes free: 1933573

after gc: idd nodes used:45654, unused:63954346; list nodes free:285004069

before gc: list nodes free: 1800263

after gc: idd nodes used:45530, unused:63954470; list nodes free:285004446

before gc: list nodes free: 1673616

after gc: idd nodes used:46143, unused:63953857; list nodes free:285001594

before gc: list nodes free: 1833528

after gc: idd nodes used:45474, unused:63954526; list nodes free:285004869

before gc: list nodes free: 1892562

after gc: idd nodes used:45227, unused:63954773; list nodes free:285006204

before gc: list nodes free: 1789639

after gc: idd nodes used:44830, unused:63955170; list nodes free:285008030
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6256864 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097048 kB

BK_TIME_CONFINEMENT_REACHED

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

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

24925 27431 28681 29345 29899 31345 31149 31171 32919 35499 36001 36169 36995 36405 36581 36919 36637 36457 36507 37181 36105 37877 36279 37571 37659 38239 37317 38761 39589 39457 39379 39137 39423 39473 40577 39951 39301 39725 40461 40057 40705 39605 41605 40479 40381 40545 39687 39899 39399 41019 40499 41725 40331 40837 41223 41791 40721 41989 44419 43247 43365 42957 41621 40827 41121 40825 41161 40711 40841 40621 41021 41247 42201 40911 41173 41155 41523 41713 41227 42339 41351 42047 41411 41701 41604 42348 42324 42899 42745 43457 42721 43092 43237 43292 43804 44011 43585 44041 43534 43497 44063 43563 43945 43592 44173 43785 44266 44225 43747 44720 43927 44189 44522 44536 44085 44194 44207 44546 44317 43954 44347 44278 44550 44838 44152 44632 44921 45055 45051 44942 45087 44514 45040 44567 44634 44513 45160 44614 44957 44771 45524 44887 44869 45012 44534 44614 44485 45428 44759 45064 44599 44702 44864 44792 44631 45339 46202 45854 45786 45222 44645 44732 44534 45090 44571 44462 44340 44304 44466 44338 44956 44411 44545 44340 44423 44605 44320 44688 44438 44761 44446 44390 44394 44578 44802 44731 44275 44792 44536 44890 44700 44828 45046

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-050B"
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 ShieldRVs-PT-050B, 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-167905978500158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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