Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903717800318.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 686K 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 ShieldIIPt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679504348502

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=ShieldIIPt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:59:11] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-22 16:59:11] [INFO ] Transformed 2803 places.
[2023-03-22 16:59:11] [INFO ] Transformed 2603 transitions.
[2023-03-22 16:59:11] [INFO ] Found NUPN structural information;
[2023-03-22 16:59:11] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 12) seen :6
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-22 16:59:12] [INFO ] Computed 361 place invariants in 26 ms
[2023-03-22 16:59:13] [INFO ] After 1060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 16:59:14] [INFO ] [Nat]Absence check using 361 positive place invariants in 194 ms returned sat
[2023-03-22 16:59:20] [INFO ] After 5546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 16:59:21] [INFO ] Deduced a trap composed of 24 places in 1087 ms of which 14 ms to minimize.
[2023-03-22 16:59:23] [INFO ] Deduced a trap composed of 23 places in 1333 ms of which 6 ms to minimize.
[2023-03-22 16:59:24] [INFO ] Deduced a trap composed of 18 places in 832 ms of which 3 ms to minimize.
[2023-03-22 16:59:25] [INFO ] Deduced a trap composed of 21 places in 1078 ms of which 16 ms to minimize.
[2023-03-22 16:59:26] [INFO ] Deduced a trap composed of 21 places in 989 ms of which 2 ms to minimize.
[2023-03-22 16:59:27] [INFO ] Deduced a trap composed of 17 places in 943 ms of which 2 ms to minimize.
[2023-03-22 16:59:28] [INFO ] Deduced a trap composed of 18 places in 886 ms of which 2 ms to minimize.
[2023-03-22 16:59:29] [INFO ] Deduced a trap composed of 31 places in 798 ms of which 2 ms to minimize.
[2023-03-22 16:59:30] [INFO ] Deduced a trap composed of 28 places in 872 ms of which 2 ms to minimize.
[2023-03-22 16:59:31] [INFO ] Deduced a trap composed of 23 places in 854 ms of which 2 ms to minimize.
[2023-03-22 16:59:32] [INFO ] Deduced a trap composed of 22 places in 830 ms of which 2 ms to minimize.
[2023-03-22 16:59:33] [INFO ] Deduced a trap composed of 24 places in 1126 ms of which 1 ms to minimize.
[2023-03-22 16:59:34] [INFO ] Deduced a trap composed of 30 places in 748 ms of which 2 ms to minimize.
[2023-03-22 16:59:35] [INFO ] Deduced a trap composed of 34 places in 876 ms of which 2 ms to minimize.
[2023-03-22 16:59:36] [INFO ] Deduced a trap composed of 25 places in 802 ms of which 2 ms to minimize.
[2023-03-22 16:59:37] [INFO ] Deduced a trap composed of 22 places in 777 ms of which 1 ms to minimize.
[2023-03-22 16:59:38] [INFO ] Deduced a trap composed of 34 places in 671 ms of which 11 ms to minimize.
[2023-03-22 16:59:40] [INFO ] Deduced a trap composed of 17 places in 1940 ms of which 7 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-22 16:59:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:59:40] [INFO ] After 26980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldIIPt-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 800 ms.
Support contains 36 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 654 transitions
Trivial Post-agglo rules discarded 654 transitions
Performed 654 trivial Post agglomeration. Transition count delta: 654
Iterating post reduction 0 with 654 rules applied. Total rules applied 654 place count 2803 transition count 1949
Reduce places removed 654 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 656 rules applied. Total rules applied 1310 place count 2149 transition count 1947
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 1321 place count 2148 transition count 1937
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1331 place count 2138 transition count 1937
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1331 place count 2138 transition count 1772
Deduced a syphon composed of 165 places in 7 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1661 place count 1973 transition count 1772
Discarding 271 places :
Symmetric choice reduction at 4 with 271 rule applications. Total rules 1932 place count 1702 transition count 1501
Iterating global reduction 4 with 271 rules applied. Total rules applied 2203 place count 1702 transition count 1501
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 113 Pre rules applied. Total rules applied 2203 place count 1702 transition count 1388
Deduced a syphon composed of 113 places in 8 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 2429 place count 1589 transition count 1388
Performed 663 Post agglomeration using F-continuation condition.Transition count delta: 663
Deduced a syphon composed of 663 places in 2 ms
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 4 with 1326 rules applied. Total rules applied 3755 place count 926 transition count 725
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3957 place count 825 transition count 789
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3985 place count 811 transition count 798
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3986 place count 811 transition count 797
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3987 place count 811 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3988 place count 810 transition count 796
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 4028 place count 810 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4029 place count 809 transition count 795
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4031 place count 807 transition count 795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4031 place count 807 transition count 794
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4033 place count 806 transition count 794
Applied a total of 4033 rules in 932 ms. Remains 806 /2803 variables (removed 1997) and now considering 794/2603 (removed 1809) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 806/2803 places, 794/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 113324 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113324 steps, saw 85183 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 794 rows 806 cols
[2023-03-22 16:59:45] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-22 16:59:45] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:59:46] [INFO ] [Nat]Absence check using 359 positive place invariants in 99 ms returned sat
[2023-03-22 16:59:47] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:59:47] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 16:59:47] [INFO ] After 319ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:59:47] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 0 ms to minimize.
[2023-03-22 16:59:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-22 16:59:48] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2023-03-22 16:59:48] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-03-22 16:59:48] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 14 ms to minimize.
[2023-03-22 16:59:48] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-22 16:59:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
[2023-03-22 16:59:48] [INFO ] After 1528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-22 16:59:48] [INFO ] After 3079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 94 ms.
Support contains 36 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 794/794 transitions.
Applied a total of 0 rules in 20 ms. Remains 806 /806 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 806/806 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 794/794 transitions.
Applied a total of 0 rules in 35 ms. Remains 806 /806 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2023-03-22 16:59:49] [INFO ] Invariant cache hit.
[2023-03-22 16:59:49] [INFO ] Implicit Places using invariants in 589 ms returned [793]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 592 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 805/806 places, 794/794 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 804 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 804 transition count 793
Applied a total of 2 rules in 30 ms. Remains 804 /805 variables (removed 1) and now considering 793/794 (removed 1) transitions.
// Phase 1: matrix 793 rows 804 cols
[2023-03-22 16:59:49] [INFO ] Computed 358 place invariants in 5 ms
[2023-03-22 16:59:50] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-22 16:59:50] [INFO ] Invariant cache hit.
[2023-03-22 16:59:50] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-22 16:59:51] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 804/806 places, 793/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2734 ms. Remains : 804/806 places, 793/794 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 112943 steps, run timeout after 3002 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112943 steps, saw 82477 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 16:59:55] [INFO ] Invariant cache hit.
[2023-03-22 16:59:55] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:59:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2023-03-22 16:59:56] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:59:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-22 16:59:56] [INFO ] After 246ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:59:57] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-22 16:59:57] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 37 ms to minimize.
[2023-03-22 16:59:57] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 1 ms to minimize.
[2023-03-22 16:59:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2023-03-22 16:59:57] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-22 16:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-22 16:59:57] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-22 16:59:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-22 16:59:58] [INFO ] After 1457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-22 16:59:58] [INFO ] After 2873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 108 ms.
Support contains 36 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 793/793 transitions.
Applied a total of 0 rules in 20 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 804/804 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 793/793 transitions.
Applied a total of 0 rules in 19 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2023-03-22 16:59:58] [INFO ] Invariant cache hit.
[2023-03-22 16:59:58] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-22 16:59:58] [INFO ] Invariant cache hit.
[2023-03-22 16:59:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-22 17:00:00] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2023-03-22 17:00:00] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-22 17:00:00] [INFO ] Invariant cache hit.
[2023-03-22 17:00:00] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2239 ms. Remains : 804/804 places, 793/793 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 804 transition count 793
Applied a total of 82 rules in 38 ms. Remains 804 /804 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 793 rows 804 cols
[2023-03-22 17:00:00] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-22 17:00:00] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:00:01] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2023-03-22 17:00:01] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:00:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-22 17:00:02] [INFO ] After 463ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:00:02] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 2 ms to minimize.
[2023-03-22 17:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-22 17:00:03] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2023-03-22 17:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-22 17:00:03] [INFO ] After 1538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-22 17:00:03] [INFO ] After 2803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:00:03] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-22 17:00:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 804 places, 793 transitions and 3794 arcs took 8 ms.
[2023-03-22 17:00:04] [INFO ] Flatten gal took : 101 ms
Total runtime 53217 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: ShieldIIPt_PT_040B
(NrP: 804 NrTr: 793 NrArc: 3794)

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

net check time: 0m 0.000sec

init dd package: 0m 3.026sec


before gc: list nodes free: 793509

after gc: idd nodes used:1541513, unused:62458487; list nodes free:286616772

before gc: list nodes free: 1686057

after gc: idd nodes used:1691689, unused:62308311; list nodes free:288031066

before gc: list nodes free: 1635002

after gc: idd nodes used:1534153, unused:62465847; list nodes free:288750804

before gc: list nodes free: 1699377

after gc: idd nodes used:1902953, unused:62097047; list nodes free:287036873
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6091360 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095224 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.003sec

1416390 1393382

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="ShieldIIPt-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 ShieldIIPt-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 r394-oct2-167903717800318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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