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-167903718000494.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 ShieldPPPs-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-167903718000494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 ShieldPPPs-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679519199613

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=ShieldPPPs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:06:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 21:06:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:06:42] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-22 21:06:42] [INFO ] Transformed 2723 places.
[2023-03-22 21:06:42] [INFO ] Transformed 2523 transitions.
[2023-03-22 21:06:42] [INFO ] Found NUPN structural information;
[2023-03-22 21:06:42] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 14) seen :8
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 23 ms. (steps per millisecond=434 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-22 21:06:43] [INFO ] Computed 441 place invariants in 26 ms
[2023-03-22 21:06:44] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 21:06:45] [INFO ] [Nat]Absence check using 441 positive place invariants in 360 ms returned sat
[2023-03-22 21:06:49] [INFO ] After 3565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 21:06:50] [INFO ] Deduced a trap composed of 26 places in 1071 ms of which 11 ms to minimize.
[2023-03-22 21:06:51] [INFO ] Deduced a trap composed of 14 places in 787 ms of which 2 ms to minimize.
[2023-03-22 21:06:52] [INFO ] Deduced a trap composed of 20 places in 772 ms of which 3 ms to minimize.
[2023-03-22 21:06:53] [INFO ] Deduced a trap composed of 21 places in 793 ms of which 4 ms to minimize.
[2023-03-22 21:06:55] [INFO ] Deduced a trap composed of 18 places in 874 ms of which 2 ms to minimize.
[2023-03-22 21:06:57] [INFO ] Deduced a trap composed of 21 places in 1329 ms of which 1 ms to minimize.
[2023-03-22 21:06:58] [INFO ] Deduced a trap composed of 34 places in 1031 ms of which 15 ms to minimize.
[2023-03-22 21:06:59] [INFO ] Deduced a trap composed of 22 places in 777 ms of which 2 ms to minimize.
[2023-03-22 21:07:00] [INFO ] Deduced a trap composed of 32 places in 871 ms of which 3 ms to minimize.
[2023-03-22 21:07:01] [INFO ] Deduced a trap composed of 36 places in 810 ms of which 2 ms to minimize.
[2023-03-22 21:07:02] [INFO ] Deduced a trap composed of 35 places in 811 ms of which 1 ms to minimize.
[2023-03-22 21:07:03] [INFO ] Deduced a trap composed of 31 places in 829 ms of which 2 ms to minimize.
[2023-03-22 21:07:04] [INFO ] Deduced a trap composed of 23 places in 817 ms of which 1 ms to minimize.
[2023-03-22 21:07:05] [INFO ] Deduced a trap composed of 33 places in 836 ms of which 2 ms to minimize.
[2023-03-22 21:07:06] [INFO ] Deduced a trap composed of 25 places in 981 ms of which 17 ms to minimize.
[2023-03-22 21:07:07] [INFO ] Deduced a trap composed of 29 places in 802 ms of which 1 ms to minimize.
[2023-03-22 21:07:07] [INFO ] Deduced a trap composed of 35 places in 767 ms of which 1 ms to minimize.
[2023-03-22 21:07:08] [INFO ] Deduced a trap composed of 25 places in 848 ms of which 16 ms to minimize.
[2023-03-22 21:07:09] [INFO ] Deduced a trap composed of 28 places in 954 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 21:07:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:07:09] [INFO ] After 25459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 515 ms.
Support contains 51 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 2723 transition count 2262
Reduce places removed 261 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 270 rules applied. Total rules applied 531 place count 2462 transition count 2253
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 540 place count 2453 transition count 2253
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 540 place count 2453 transition count 2054
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 938 place count 2254 transition count 2054
Discarding 269 places :
Symmetric choice reduction at 3 with 269 rule applications. Total rules 1207 place count 1985 transition count 1785
Iterating global reduction 3 with 269 rules applied. Total rules applied 1476 place count 1985 transition count 1785
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 1476 place count 1985 transition count 1674
Deduced a syphon composed of 111 places in 10 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 1698 place count 1874 transition count 1674
Performed 576 Post agglomeration using F-continuation condition.Transition count delta: 576
Deduced a syphon composed of 576 places in 4 ms
Reduce places removed 576 places and 0 transitions.
Iterating global reduction 3 with 1152 rules applied. Total rules applied 2850 place count 1298 transition count 1098
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 341 times.
Drop transitions removed 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 3191 place count 1298 transition count 1098
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3192 place count 1297 transition count 1097
Applied a total of 3192 rules in 851 ms. Remains 1297 /2723 variables (removed 1426) and now considering 1097/2523 (removed 1426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 1297/2723 places, 1097/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-00 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 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1097 rows 1297 cols
[2023-03-22 21:07:11] [INFO ] Computed 441 place invariants in 61 ms
[2023-03-22 21:07:12] [INFO ] [Real]Absence check using 416 positive place invariants in 149 ms returned sat
[2023-03-22 21:07:12] [INFO ] [Real]Absence check using 416 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-22 21:07:12] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 21:07:12] [INFO ] [Nat]Absence check using 416 positive place invariants in 122 ms returned sat
[2023-03-22 21:07:12] [INFO ] [Nat]Absence check using 416 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 21:07:19] [INFO ] After 6807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 21:07:19] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2023-03-22 21:07:20] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2023-03-22 21:07:20] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2023-03-22 21:07:20] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2023-03-22 21:07:20] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 21:07:20] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 26 ms to minimize.
[2023-03-22 21:07:21] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-22 21:07:21] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-22 21:07:21] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-22 21:07:22] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-22 21:07:22] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-22 21:07:22] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 15 ms to minimize.
[2023-03-22 21:07:22] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2023-03-22 21:07:23] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 0 ms to minimize.
[2023-03-22 21:07:23] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 14 ms to minimize.
[2023-03-22 21:07:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3793 ms
[2023-03-22 21:07:28] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2023-03-22 21:07:28] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 21:07:28] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-22 21:07:28] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:07:29] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 0 ms to minimize.
[2023-03-22 21:07:29] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2023-03-22 21:07:30] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-22 21:07:31] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-22 21:07:31] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2023-03-22 21:07:32] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2023-03-22 21:07:32] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-22 21:07:32] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:07:32] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-22 21:07:33] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-22 21:07:33] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 0 ms to minimize.
[2023-03-22 21:07:34] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2023-03-22 21:07:34] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-22 21:07:34] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-22 21:07:35] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-22 21:07:35] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-22 21:07:36] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 3 ms to minimize.
[2023-03-22 21:07:36] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 23 ms to minimize.
[2023-03-22 21:07:36] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-22 21:07:37] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-22 21:07:37] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9307 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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 21:07:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:07:37] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 128 ms.
Support contains 38 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 1097/1097 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 1297 transition count 1095
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1295 transition count 1095
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1295 transition count 1094
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1294 transition count 1094
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 1285 transition count 1085
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 1285 transition count 1085
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 1284 transition count 1084
Applied a total of 26 rules in 414 ms. Remains 1284 /1297 variables (removed 13) and now considering 1084/1097 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 1284/1297 places, 1084/1097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1084 rows 1284 cols
[2023-03-22 21:07:38] [INFO ] Computed 441 place invariants in 27 ms
[2023-03-22 21:07:38] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:07:38] [INFO ] [Nat]Absence check using 423 positive place invariants in 73 ms returned sat
[2023-03-22 21:07:38] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-22 21:07:48] [INFO ] After 9826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 1284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1284/1284 places, 1084/1084 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1283 transition count 1083
Applied a total of 2 rules in 133 ms. Remains 1283 /1284 variables (removed 1) and now considering 1083/1084 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 1283/1284 places, 1083/1084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 172379 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172379 steps, saw 132982 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1083 rows 1283 cols
[2023-03-22 21:07:51] [INFO ] Computed 441 place invariants in 19 ms
[2023-03-22 21:07:51] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:07:51] [INFO ] [Nat]Absence check using 423 positive place invariants in 134 ms returned sat
[2023-03-22 21:07:51] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-22 21:07:56] [INFO ] After 4681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:08:00] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:08:01] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2023-03-22 21:08:02] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2023-03-22 21:08:02] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-22 21:08:02] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2023-03-22 21:08:02] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-22 21:08:03] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2023-03-22 21:08:03] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-22 21:08:03] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-22 21:08:04] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 21:08:04] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-22 21:08:04] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 2 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 1 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 0 ms to minimize.
[2023-03-22 21:08:06] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-22 21:08:06] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-22 21:08:06] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-22 21:08:07] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-22 21:08:07] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7726 ms
[2023-03-22 21:08:07] [INFO ] After 15757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2223 ms.
[2023-03-22 21:08:09] [INFO ] After 18326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 37 out of 1283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1283/1283 places, 1083/1083 transitions.
Applied a total of 0 rules in 61 ms. Remains 1283 /1283 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1283/1283 places, 1083/1083 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1283/1283 places, 1083/1083 transitions.
Applied a total of 0 rules in 41 ms. Remains 1283 /1283 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2023-03-22 21:08:10] [INFO ] Invariant cache hit.
[2023-03-22 21:08:11] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-22 21:08:11] [INFO ] Invariant cache hit.
[2023-03-22 21:08:13] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 3158 ms to find 0 implicit places.
[2023-03-22 21:08:13] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-22 21:08:13] [INFO ] Invariant cache hit.
[2023-03-22 21:08:14] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4025 ms. Remains : 1283/1283 places, 1083/1083 transitions.
Applied a total of 0 rules in 36 ms. Remains 1283 /1283 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 21:08:14] [INFO ] Invariant cache hit.
[2023-03-22 21:08:14] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:08:14] [INFO ] [Nat]Absence check using 423 positive place invariants in 77 ms returned sat
[2023-03-22 21:08:14] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-22 21:08:24] [INFO ] After 9907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-22 21:08:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 13 ms.
[2023-03-22 21:08:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1283 places, 1083 transitions and 4975 arcs took 21 ms.
[2023-03-22 21:08:24] [INFO ] Flatten gal took : 180 ms
Total runtime 102798 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: ShieldPPPs_PT_040B
(NrP: 1283 NrTr: 1083 NrArc: 4975)

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

net check time: 0m 0.000sec

init dd package: 0m 3.064sec


before gc: list nodes free: 218655

after gc: idd nodes used:1933230, unused:62066770; list nodes free:276518071
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6126908 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098652 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.005sec

769343 2235442

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

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