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-167903717500126.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 ShieldIIPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 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.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 503K 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 ShieldIIPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679491894874

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=ShieldIIPs-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:31:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:31:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:31:38] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2023-03-22 13:31:39] [INFO ] Transformed 1803 places.
[2023-03-22 13:31:39] [INFO ] Transformed 1773 transitions.
[2023-03-22 13:31:39] [INFO ] Found NUPN structural information;
[2023-03-22 13:31:39] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 630 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 12) seen :9
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-22 13:31:39] [INFO ] Computed 271 place invariants in 25 ms
[2023-03-22 13:31:40] [INFO ] After 974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:31:41] [INFO ] [Nat]Absence check using 271 positive place invariants in 220 ms returned sat
[2023-03-22 13:31:46] [INFO ] After 5003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:31:49] [INFO ] Deduced a trap composed of 17 places in 1381 ms of which 25 ms to minimize.
[2023-03-22 13:31:49] [INFO ] Deduced a trap composed of 30 places in 676 ms of which 2 ms to minimize.
[2023-03-22 13:31:50] [INFO ] Deduced a trap composed of 53 places in 901 ms of which 1 ms to minimize.
[2023-03-22 13:31:51] [INFO ] Deduced a trap composed of 36 places in 684 ms of which 1 ms to minimize.
[2023-03-22 13:31:52] [INFO ] Deduced a trap composed of 19 places in 488 ms of which 1 ms to minimize.
[2023-03-22 13:31:52] [INFO ] Deduced a trap composed of 31 places in 558 ms of which 1 ms to minimize.
[2023-03-22 13:31:53] [INFO ] Deduced a trap composed of 39 places in 641 ms of which 1 ms to minimize.
[2023-03-22 13:31:54] [INFO ] Deduced a trap composed of 26 places in 853 ms of which 13 ms to minimize.
[2023-03-22 13:31:55] [INFO ] Deduced a trap composed of 24 places in 470 ms of which 1 ms to minimize.
[2023-03-22 13:31:55] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 1 ms to minimize.
[2023-03-22 13:31:56] [INFO ] Deduced a trap composed of 27 places in 788 ms of which 3 ms to minimize.
[2023-03-22 13:31:57] [INFO ] Deduced a trap composed of 33 places in 651 ms of which 19 ms to minimize.
[2023-03-22 13:31:57] [INFO ] Deduced a trap composed of 32 places in 593 ms of which 2 ms to minimize.
[2023-03-22 13:31:58] [INFO ] Deduced a trap composed of 30 places in 488 ms of which 20 ms to minimize.
[2023-03-22 13:31:59] [INFO ] Deduced a trap composed of 27 places in 453 ms of which 17 ms to minimize.
[2023-03-22 13:31:59] [INFO ] Deduced a trap composed of 33 places in 547 ms of which 10 ms to minimize.
[2023-03-22 13:32:00] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2023-03-22 13:32:00] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 1 ms to minimize.
[2023-03-22 13:32:01] [INFO ] Deduced a trap composed of 34 places in 526 ms of which 0 ms to minimize.
[2023-03-22 13:32:01] [INFO ] Deduced a trap composed of 25 places in 397 ms of which 1 ms to minimize.
[2023-03-22 13:32:02] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 1 ms to minimize.
[2023-03-22 13:32:02] [INFO ] Deduced a trap composed of 33 places in 457 ms of which 9 ms to minimize.
[2023-03-22 13:32:03] [INFO ] Deduced a trap composed of 25 places in 955 ms of which 1 ms to minimize.
[2023-03-22 13:32:04] [INFO ] Deduced a trap composed of 35 places in 770 ms of which 1 ms to minimize.
[2023-03-22 13:32:05] [INFO ] Deduced a trap composed of 34 places in 328 ms of which 1 ms to minimize.
[2023-03-22 13:32:05] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 1 ms to minimize.
[2023-03-22 13:32:06] [INFO ] Deduced a trap composed of 40 places in 411 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-22 13:32:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:32:06] [INFO ] After 25118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 209 ms.
Support contains 51 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1803 transition count 1633
Reduce places removed 140 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 145 rules applied. Total rules applied 285 place count 1663 transition count 1628
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 290 place count 1658 transition count 1628
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 290 place count 1658 transition count 1478
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 590 place count 1508 transition count 1478
Discarding 207 places :
Symmetric choice reduction at 3 with 207 rule applications. Total rules 797 place count 1301 transition count 1271
Iterating global reduction 3 with 207 rules applied. Total rules applied 1004 place count 1301 transition count 1271
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 1004 place count 1301 transition count 1186
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 1174 place count 1216 transition count 1186
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 415
Deduced a syphon composed of 415 places in 3 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 3 with 830 rules applied. Total rules applied 2004 place count 801 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 3 with 189 rules applied. Total rules applied 2193 place count 801 transition count 771
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2194 place count 800 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2195 place count 799 transition count 770
Applied a total of 2195 rules in 533 ms. Remains 799 /1803 variables (removed 1004) and now considering 770/1773 (removed 1003) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 799/1803 places, 770/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 770 rows 799 cols
[2023-03-22 13:32:07] [INFO ] Computed 270 place invariants in 42 ms
[2023-03-22 13:32:07] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:32:07] [INFO ] [Nat]Absence check using 264 positive place invariants in 54 ms returned sat
[2023-03-22 13:32:07] [INFO ] [Nat]Absence check using 264 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 13:32:08] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:32:08] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2023-03-22 13:32:09] [INFO ] Deduced a trap composed of 7 places in 1137 ms of which 0 ms to minimize.
[2023-03-22 13:32:10] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-22 13:32:10] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 1 ms to minimize.
[2023-03-22 13:32:10] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 0 ms to minimize.
[2023-03-22 13:32:10] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2023-03-22 13:32:11] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 17 ms to minimize.
[2023-03-22 13:32:11] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 0 ms to minimize.
[2023-03-22 13:32:11] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2023-03-22 13:32:13] [INFO ] Deduced a trap composed of 9 places in 1956 ms of which 0 ms to minimize.
[2023-03-22 13:32:15] [INFO ] Deduced a trap composed of 30 places in 2015 ms of which 26 ms to minimize.
[2023-03-22 13:32:16] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-22 13:32:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7669 ms
[2023-03-22 13:32:16] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-22 13:32:16] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
[2023-03-22 13:32:17] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-22 13:32:17] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 25 ms to minimize.
[2023-03-22 13:32:17] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 0 ms to minimize.
[2023-03-22 13:32:17] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:32:18] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2023-03-22 13:32:18] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2023-03-22 13:32:18] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 0 ms to minimize.
[2023-03-22 13:32:18] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-22 13:32:19] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 1 ms to minimize.
[2023-03-22 13:32:19] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 0 ms to minimize.
[2023-03-22 13:32:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3507 ms
[2023-03-22 13:32:19] [INFO ] After 12080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-22 13:32:20] [INFO ] After 12620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 33 out of 799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 799/799 places, 770/770 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 799 transition count 768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 797 transition count 768
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 797 transition count 765
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 794 transition count 765
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 783 transition count 754
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 783 transition count 754
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 781 transition count 752
Applied a total of 41 rules in 130 ms. Remains 781 /799 variables (removed 18) and now considering 752/770 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 781/799 places, 752/770 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 752 rows 781 cols
[2023-03-22 13:32:20] [INFO ] Computed 270 place invariants in 11 ms
[2023-03-22 13:32:20] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:32:20] [INFO ] [Nat]Absence check using 268 positive place invariants in 59 ms returned sat
[2023-03-22 13:32:20] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-22 13:32:21] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:32:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 945 ms
[2023-03-22 13:32:22] [INFO ] After 1350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-22 13:32:22] [INFO ] After 1631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 9 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 752/752 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 0 with 1 rules applied. Total rules applied 1 place count 781 transition count 751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 780 transition count 751
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 780 transition count 750
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 779 transition count 750
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 764 transition count 735
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 764 transition count 735
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 758 transition count 729
Applied a total of 46 rules in 176 ms. Remains 758 /781 variables (removed 23) and now considering 729/752 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 758/781 places, 729/752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 5388 steps, run visited all 1 properties in 78 ms. (steps per millisecond=69 )
Probabilistic random walk after 5388 steps, saw 5124 distinct states, run finished after 78 ms. (steps per millisecond=69 ) properties seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 44093 ms.
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: ShieldIIPs_PT_030B
(NrP: 1803 NrTr: 1773 NrArc: 5346)

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

net check time: 0m 0.000sec

init dd package: 0m 2.926sec


before gc: list nodes free: 1773993

after gc: idd nodes used:51383517, unused:12616483; list nodes free:56600919

RS generation: 31m18.356sec


-> last computed set: #nodes 51381716 (5.1e+07) #states 110,376,421,052,631,578,947,368,430 (26)


CANNOT_COMPUTE


BK_STOP 1679493859548

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.010sec

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="ShieldIIPs-PT-030B"
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 ShieldIIPs-PT-030B, 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-167903717500126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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