Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979200110.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979200110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 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.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 244K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679379456279

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 06:17:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 06:17:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:17:38] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-21 06:17:38] [INFO ] Transformed 803 places.
[2023-03-21 06:17:38] [INFO ] Transformed 903 transitions.
[2023-03-21 06:17:38] [INFO ] Found NUPN structural information;
[2023-03-21 06:17:38] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 11 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 15) seen :9
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-21 06:17:38] [INFO ] Computed 81 place invariants in 27 ms
[2023-03-21 06:17:39] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 06:17:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 29 ms returned sat
[2023-03-21 06:17:40] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-21 06:17:41] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 7 ms to minimize.
[2023-03-21 06:17:41] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 2 ms to minimize.
[2023-03-21 06:17:41] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 0 ms to minimize.
[2023-03-21 06:17:41] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 2 ms to minimize.
[2023-03-21 06:17:42] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 1 ms to minimize.
[2023-03-21 06:17:42] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2023-03-21 06:17:42] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2023-03-21 06:17:42] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-21 06:17:42] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2023-03-21 06:17:43] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 0 ms to minimize.
[2023-03-21 06:17:43] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2023-03-21 06:17:43] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 0 ms to minimize.
[2023-03-21 06:17:43] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2023-03-21 06:17:43] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2023-03-21 06:17:44] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-21 06:17:44] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2023-03-21 06:17:44] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2023-03-21 06:17:44] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2023-03-21 06:17:45] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2023-03-21 06:17:45] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 1 ms to minimize.
[2023-03-21 06:17:45] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 0 ms to minimize.
[2023-03-21 06:17:45] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2023-03-21 06:17:45] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-21 06:17:46] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-03-21 06:17:46] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2023-03-21 06:17:46] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 0 ms to minimize.
[2023-03-21 06:17:46] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2023-03-21 06:17:46] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2023-03-21 06:17:47] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2023-03-21 06:17:47] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 1 ms to minimize.
[2023-03-21 06:17:47] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 1 ms to minimize.
[2023-03-21 06:17:47] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-21 06:17:48] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2023-03-21 06:17:48] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 1 ms to minimize.
[2023-03-21 06:17:48] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-21 06:17:49] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2023-03-21 06:17:49] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2023-03-21 06:17:49] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2023-03-21 06:17:49] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2023-03-21 06:17:49] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 0 ms to minimize.
[2023-03-21 06:17:50] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2023-03-21 06:17:50] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 1 ms to minimize.
[2023-03-21 06:17:50] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-21 06:17:50] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2023-03-21 06:17:50] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 1 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 0 ms to minimize.
[2023-03-21 06:17:51] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 1 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2023-03-21 06:17:52] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 1 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2023-03-21 06:17:53] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 0 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2023-03-21 06:17:54] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2023-03-21 06:17:55] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 0 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2023-03-21 06:17:56] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 0 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2023-03-21 06:17:57] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 3 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 0 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2023-03-21 06:17:58] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2023-03-21 06:17:59] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 18470 ms
[2023-03-21 06:17:59] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 1 ms to minimize.
[2023-03-21 06:18:00] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 0 ms to minimize.
[2023-03-21 06:18:00] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 1 ms to minimize.
[2023-03-21 06:18:00] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 0 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 1 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
[2023-03-21 06:18:01] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 0 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 0 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 0 ms to minimize.
[2023-03-21 06:18:02] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 0 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 1 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 1 ms to minimize.
[2023-03-21 06:18:03] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 0 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-21 06:18:04] [INFO ] Deduced a trap composed of 27 places in 186 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-21 06:18:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 06:18:04] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 116 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 803 transition count 848
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 114 place count 748 transition count 844
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 744 transition count 844
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 118 place count 744 transition count 758
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 290 place count 658 transition count 758
Discarding 103 places :
Symmetric choice reduction at 3 with 103 rule applications. Total rules 393 place count 555 transition count 655
Iterating global reduction 3 with 103 rules applied. Total rules applied 496 place count 555 transition count 655
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 496 place count 555 transition count 621
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 564 place count 521 transition count 621
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 772 place count 417 transition count 517
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 795 place count 417 transition count 517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 796 place count 416 transition count 516
Applied a total of 796 rules in 175 ms. Remains 416 /803 variables (removed 387) and now considering 516/903 (removed 387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 416/803 places, 516/903 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :2
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 516 rows 416 cols
[2023-03-21 06:18:05] [INFO ] Computed 81 place invariants in 16 ms
[2023-03-21 06:18:05] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 06:18:05] [INFO ] [Nat]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-21 06:18:05] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:18:05] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2023-03-21 06:18:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1143 ms
[2023-03-21 06:18:06] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-21 06:18:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1190 ms
[2023-03-21 06:18:07] [INFO ] After 2767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-21 06:18:08] [INFO ] After 3062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 59 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 516/516 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 416 transition count 505
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 405 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 404 transition count 504
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 24 place count 404 transition count 489
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 54 place count 389 transition count 489
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 387 transition count 487
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 387 transition count 487
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 387 transition count 486
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 386 transition count 486
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 136 place count 348 transition count 448
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 148 place count 348 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 347 transition count 447
Applied a total of 149 rules in 93 ms. Remains 347 /416 variables (removed 69) and now considering 447/516 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 347/416 places, 447/516 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 543774 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 543774 steps, saw 108119 distinct states, run finished after 3004 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 447 rows 347 cols
[2023-03-21 06:18:11] [INFO ] Computed 81 place invariants in 8 ms
[2023-03-21 06:18:11] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 06:18:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2023-03-21 06:18:12] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-21 06:18:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 671 ms
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-21 06:18:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 528 ms
[2023-03-21 06:18:13] [INFO ] After 1766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-21 06:18:13] [INFO ] After 2031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 59 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 447/447 transitions.
Applied a total of 0 rules in 35 ms. Remains 347 /347 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 347/347 places, 447/447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 447/447 transitions.
Applied a total of 0 rules in 25 ms. Remains 347 /347 variables (removed 0) and now considering 447/447 (removed 0) transitions.
[2023-03-21 06:18:13] [INFO ] Invariant cache hit.
[2023-03-21 06:18:14] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-21 06:18:14] [INFO ] Invariant cache hit.
[2023-03-21 06:18:14] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-21 06:18:14] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-21 06:18:14] [INFO ] Invariant cache hit.
[2023-03-21 06:18:14] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 347/347 places, 447/447 transitions.
Applied a total of 0 rules in 12 ms. Remains 347 /347 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 06:18:14] [INFO ] Invariant cache hit.
[2023-03-21 06:18:14] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 06:18:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-21 06:18:15] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-03-21 06:18:15] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1101 ms
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-21 06:18:16] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-21 06:18:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1060 ms
[2023-03-21 06:18:17] [INFO ] After 2543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-21 06:18:17] [INFO ] After 2881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 06:18:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-21 06:18:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 347 places, 447 transitions and 2030 arcs took 5 ms.
[2023-03-21 06:18:18] [INFO ] Flatten gal took : 101 ms
Total runtime 40129 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 020B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 347 places, 447 transitions, 2030 arcs.
Final Score: 8727.569
Took : 22 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldRVs-PT-020B-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( ( ( (tk(P248)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P248)) ) ) | ( ( (tk(P29)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P29)) ) ) ) | ( ( ( (tk(P274)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P274)) ) ) | ( ( (tk(P119)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P119)) ) ) ) ) | ( ( ( ( (tk(P133)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P133)) ) ) | ( ( (tk(P220)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P220)) ) ) ) | ( ( ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) & ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) ) | ( ( ( (tk(P84)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P84)) ) ) & ( ( (tk(P269)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P269)) ) ) ) ) ) ) | ( ( ( ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) & ( ( (tk(P233)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P233)) ) ) ) | ( ( ( (tk(P113)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P113)) ) ) & ( ( (tk(P297)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P297)) ) ) ) ) | ( ( ( ( (tk(P147)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P147)) ) ) & ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) ) | ( ( ( ( (tk(P257)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P257)) ) ) & ( ( (tk(P296)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P296)) ) ) ) & ( ( ( (tk(P109)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P109)) ) ) & ( ( (tk(P158)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P158)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P121)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P121)) ) ) & ( ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P90)) ) ) & ( ( ( (tk(P246)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P246)) ) ) | ( ( ( (tk(P4)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P4)) ) ) & ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) ) ) ) ) | ( ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) & ( ( ( (tk(P229)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P229)) ) ) | ( ( (tk(P303)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P303)) ) ) ) ) & ( ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( (tk(P226)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P226)) ) ) ) & ( ( ( (tk(P178)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P178)) ) ) | ( ( ( (tk(P331)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P331)) ) ) & ( ( (tk(P47)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P47)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P125)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P125)) ) ) & ( ( ( (tk(P43)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P43)) ) ) | ( ( (tk(P94)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P94)) ) ) ) ) | ( ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) & ( ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) | ( ( ( (tk(P330)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P330)) ) ) & ( ( (tk(P149)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P149)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldRVs-PT-020B-ReachabilityCardinality-13 (reachable &!potential( ( ( ( ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) | ( ( (tk(P322)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P322)) ) ) ) | ( ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) | ( ( (tk(P252)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P252)) ) ) ) ) | ( ( ( ( (tk(P82)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P82)) ) ) | ( ( (tk(P317)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P317)) ) ) ) | ( ( ( ( ( (tk(P236)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P236)) ) ) & ( ( (tk(P101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P101)) ) ) ) & ( ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) & ( ( ( ( (tk(P266)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P266)) ) ) | ( ( (tk(P72)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P72)) ) ) ) | ( ( ( (tk(P129)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P129)) ) ) | ( ( ( (tk(P140)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P140)) ) ) | ( ( ( (tk(P255)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P255)) ) ) & ( ( (tk(P178)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P178)) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P24)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P24)) ) ) & ( ( (tk(P203)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P203)) ) ) ) | ( ( ( (tk(P156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P156)) ) ) & ( ( ( (tk(P194)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P194)) ) ) | ( ( (tk(P134)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P134)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5897360 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16106592 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
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldRVs-PT-020B, 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 r427-tajo-167905979200110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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