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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 675K 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-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679493712515

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-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:01:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 14:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:01:55] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-22 14:01:55] [INFO ] Transformed 2403 places.
[2023-03-22 14:01:55] [INFO ] Transformed 2363 transitions.
[2023-03-22 14:01:55] [INFO ] Found NUPN structural information;
[2023-03-22 14:01:55] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 13) seen :10
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-01 FALSE 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-22 14:01:56] [INFO ] Computed 361 place invariants in 49 ms
[2023-03-22 14:01:57] [INFO ] After 900ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:01:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 191 ms returned sat
[2023-03-22 14:02:00] [INFO ] After 2471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:02:02] [INFO ] Deduced a trap composed of 13 places in 1298 ms of which 12 ms to minimize.
[2023-03-22 14:02:04] [INFO ] Deduced a trap composed of 18 places in 1052 ms of which 4 ms to minimize.
[2023-03-22 14:02:05] [INFO ] Deduced a trap composed of 20 places in 832 ms of which 3 ms to minimize.
[2023-03-22 14:02:06] [INFO ] Deduced a trap composed of 22 places in 820 ms of which 16 ms to minimize.
[2023-03-22 14:02:07] [INFO ] Deduced a trap composed of 27 places in 1195 ms of which 2 ms to minimize.
[2023-03-22 14:02:08] [INFO ] Deduced a trap composed of 15 places in 722 ms of which 2 ms to minimize.
[2023-03-22 14:02:09] [INFO ] Deduced a trap composed of 37 places in 796 ms of which 53 ms to minimize.
[2023-03-22 14:02:10] [INFO ] Deduced a trap composed of 31 places in 1060 ms of which 4 ms to minimize.
[2023-03-22 14:02:11] [INFO ] Deduced a trap composed of 40 places in 1042 ms of which 1 ms to minimize.
[2023-03-22 14:02:12] [INFO ] Deduced a trap composed of 23 places in 804 ms of which 2 ms to minimize.
[2023-03-22 14:02:13] [INFO ] Deduced a trap composed of 24 places in 709 ms of which 16 ms to minimize.
[2023-03-22 14:02:14] [INFO ] Deduced a trap composed of 35 places in 991 ms of which 4 ms to minimize.
[2023-03-22 14:02:15] [INFO ] Deduced a trap composed of 29 places in 820 ms of which 5 ms to minimize.
[2023-03-22 14:02:16] [INFO ] Deduced a trap composed of 22 places in 722 ms of which 1 ms to minimize.
[2023-03-22 14:02:17] [INFO ] Deduced a trap composed of 28 places in 695 ms of which 2 ms to minimize.
[2023-03-22 14:02:18] [INFO ] Deduced a trap composed of 28 places in 816 ms of which 1 ms to minimize.
[2023-03-22 14:02:19] [INFO ] Deduced a trap composed of 20 places in 872 ms of which 2 ms to minimize.
[2023-03-22 14:02:20] [INFO ] Deduced a trap composed of 22 places in 885 ms of which 2 ms to minimize.
[2023-03-22 14:02:21] [INFO ] Deduced a trap composed of 55 places in 634 ms of which 2 ms to minimize.
[2023-03-22 14:02:22] [INFO ] Deduced a trap composed of 56 places in 960 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 14:02:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:02:22] [INFO ] After 25285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 253 ms.
Support contains 46 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 2403 transition count 2175
Reduce places removed 188 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 190 rules applied. Total rules applied 378 place count 2215 transition count 2173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 380 place count 2213 transition count 2173
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 380 place count 2213 transition count 1974
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 778 place count 2014 transition count 1974
Discarding 270 places :
Symmetric choice reduction at 3 with 270 rule applications. Total rules 1048 place count 1744 transition count 1704
Iterating global reduction 3 with 270 rules applied. Total rules applied 1318 place count 1744 transition count 1704
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 1318 place count 1744 transition count 1589
Deduced a syphon composed of 115 places in 9 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 1548 place count 1629 transition count 1589
Performed 579 Post agglomeration using F-continuation condition.Transition count delta: 579
Deduced a syphon composed of 579 places in 3 ms
Reduce places removed 579 places and 0 transitions.
Iterating global reduction 3 with 1158 rules applied. Total rules applied 2706 place count 1050 transition count 1010
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions removed 267 transitions
Iterating global reduction 3 with 267 rules applied. Total rules applied 2973 place count 1050 transition count 1010
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2974 place count 1049 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2975 place count 1048 transition count 1009
Applied a total of 2975 rules in 730 ms. Remains 1048 /2403 variables (removed 1355) and now considering 1009/2363 (removed 1354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 731 ms. Remains : 1048/2403 places, 1009/2363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :2
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1009 rows 1048 cols
[2023-03-22 14:02:23] [INFO ] Computed 360 place invariants in 26 ms
[2023-03-22 14:02:23] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:24] [INFO ] [Nat]Absence check using 359 positive place invariants in 81 ms returned sat
[2023-03-22 14:02:24] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:02:24] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:25] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 14:02:25] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-22 14:02:25] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-22 14:02:25] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-22 14:02:26] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 1 ms to minimize.
[2023-03-22 14:02:26] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2023-03-22 14:02:26] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2023-03-22 14:02:26] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 4 ms to minimize.
[2023-03-22 14:02:27] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 1 ms to minimize.
[2023-03-22 14:02:27] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:02:27] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-22 14:02:27] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-22 14:02:28] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-22 14:02:28] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 13 ms to minimize.
[2023-03-22 14:02:28] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:02:28] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2023-03-22 14:02:29] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-22 14:02:29] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2023-03-22 14:02:29] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:02:29] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 14 ms to minimize.
[2023-03-22 14:02:29] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-22 14:02:30] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-22 14:02:30] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-22 14:02:30] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5307 ms
[2023-03-22 14:02:30] [INFO ] After 6294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-22 14:02:30] [INFO ] After 6726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 23 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1009/1009 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 1048 transition count 1004
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1043 transition count 1004
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 1043 transition count 1002
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 1041 transition count 1002
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 1032 transition count 993
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 1032 transition count 993
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 46 place count 1025 transition count 986
Applied a total of 46 rules in 224 ms. Remains 1025 /1048 variables (removed 23) and now considering 986/1009 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 1025/1048 places, 986/1009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 179625 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179625 steps, saw 113263 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 986 rows 1025 cols
[2023-03-22 14:02:34] [INFO ] Computed 360 place invariants in 48 ms
[2023-03-22 14:02:34] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:34] [INFO ] [Nat]Absence check using 359 positive place invariants in 95 ms returned sat
[2023-03-22 14:02:34] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-22 14:02:35] [INFO ] After 817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:35] [INFO ] Deduced a trap composed of 8 places in 284 ms of which 0 ms to minimize.
[2023-03-22 14:02:35] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-22 14:02:36] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-22 14:02:36] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-22 14:02:36] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-22 14:02:37] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-22 14:02:37] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 14 ms to minimize.
[2023-03-22 14:02:37] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2023-03-22 14:02:37] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-22 14:02:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2162 ms
[2023-03-22 14:02:37] [INFO ] After 3055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-22 14:02:37] [INFO ] After 3488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 23 out of 1025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 28 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1025/1025 places, 986/986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 24 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
[2023-03-22 14:02:37] [INFO ] Invariant cache hit.
[2023-03-22 14:02:38] [INFO ] Implicit Places using invariants in 826 ms returned []
[2023-03-22 14:02:38] [INFO ] Invariant cache hit.
[2023-03-22 14:02:40] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2023-03-22 14:02:40] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 14:02:40] [INFO ] Invariant cache hit.
[2023-03-22 14:02:40] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3084 ms. Remains : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 25 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 14:02:40] [INFO ] Invariant cache hit.
[2023-03-22 14:02:41] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:41] [INFO ] [Nat]Absence check using 359 positive place invariants in 73 ms returned sat
[2023-03-22 14:02:41] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 14:02:41] [INFO ] After 568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:42] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-22 14:02:42] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-03-22 14:02:42] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-22 14:02:42] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2023-03-22 14:02:42] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:02:43] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2023-03-22 14:02:43] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-22 14:02:43] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-22 14:02:43] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-22 14:02:43] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2023-03-22 14:02:44] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2023-03-22 14:02:44] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-22 14:02:44] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-22 14:02:44] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 7 ms to minimize.
[2023-03-22 14:02:44] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-22 14:02:45] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-22 14:02:45] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 0 ms to minimize.
[2023-03-22 14:02:45] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-22 14:02:45] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-22 14:02:45] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2023-03-22 14:02:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4070 ms
[2023-03-22 14:02:45] [INFO ] After 4757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-22 14:02:46] [INFO ] After 5150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-22 14:02:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1025 places, 986 transitions and 4633 arcs took 10 ms.
[2023-03-22 14:02:46] [INFO ] Flatten gal took : 159 ms
Total runtime 51635 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: ShieldIIPs_PT_040B
(NrP: 1025 NrTr: 986 NrArc: 4633)

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

net check time: 0m 0.000sec

init dd package: 0m 2.883sec


before gc: list nodes free: 1616343

after gc: idd nodes used:590633, unused:63409367; list nodes free:282544543

before gc: list nodes free: 1942519

after gc: idd nodes used:728225, unused:63271775; list nodes free:281904625

before gc: list nodes free: 892150

after gc: idd nodes used:971733, unused:63028267; list nodes free:282879376

before gc: list nodes free: 1007481

after gc: idd nodes used:988133, unused:63011867; list nodes free:282818529

before gc: list nodes free: 490826

after gc: idd nodes used:1085453, unused:62914547; list nodes free:284454581

before gc: list nodes free: 4319920

after gc: idd nodes used:1084093, unused:62915907; list nodes free:284468876

before gc: list nodes free: 4199912

after gc: idd nodes used:1098017, unused:62901983; list nodes free:284393260

before gc: list nodes free: 461287

after gc: idd nodes used:1196665, unused:62803335; list nodes free:283940692
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6189172 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095360 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

322583 590201 641753 698549 749085 952409 964249 1030865 979541 1064137 1079837 1095645 1101373 1071345 1198201 1191977

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-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 ShieldIIPs-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-167903717500142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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