Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789800629.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789800629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 364K May 18 16:43 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 ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717015320282

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:42:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:42:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:42:02] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-29 20:42:02] [INFO ] Transformed 1503 places.
[2024-05-29 20:42:02] [INFO ] Transformed 1503 transitions.
[2024-05-29 20:42:02] [INFO ] Found NUPN structural information;
[2024-05-29 20:42:02] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 13) seen :4
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2024-05-29 20:42:03] [INFO ] Computed 121 invariants in 36 ms
[2024-05-29 20:42:04] [INFO ] After 707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 20:42:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2024-05-29 20:42:07] [INFO ] After 2723ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 9 ms to minimize.
[2024-05-29 20:42:08] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 2 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 2 ms to minimize.
[2024-05-29 20:42:09] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 2 ms to minimize.
[2024-05-29 20:42:10] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:42:10] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:42:10] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:42:10] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 2 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:42:11] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:42:12] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:42:12] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:42:12] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:42:13] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 0 ms to minimize.
[2024-05-29 20:42:13] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:42:13] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:42:13] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 2 ms to minimize.
[2024-05-29 20:42:14] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:42:15] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:42:16] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8593 ms
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 42 places in 383 ms of which 2 ms to minimize.
[2024-05-29 20:42:17] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 3 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 1 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 1 ms to minimize.
[2024-05-29 20:42:18] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 1 ms to minimize.
[2024-05-29 20:42:19] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 0 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 1 ms to minimize.
[2024-05-29 20:42:20] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 0 ms to minimize.
[2024-05-29 20:42:21] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:42:21] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 1 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 0 ms to minimize.
[2024-05-29 20:42:22] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 0 ms to minimize.
[2024-05-29 20:42:23] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7132 ms
[2024-05-29 20:42:24] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:42:24] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:42:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1824 ms
[2024-05-29 20:42:27] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:42:27] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 1 ms to minimize.
[2024-05-29 20:42:27] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:42:28] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 0 ms to minimize.
[2024-05-29 20:42:28] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:42:28] [INFO ] Deduced a trap composed of 49 places in 292 ms of which 1 ms to minimize.
[2024-05-29 20:42:29] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 2 ms to minimize.
[2024-05-29 20:42:29] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 2532 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:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 20:42:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 20:42:29] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 309 ms.
Support contains 96 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 1503 transition count 1109
Reduce places removed 394 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 424 rules applied. Total rules applied 818 place count 1109 transition count 1079
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 848 place count 1079 transition count 1079
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 848 place count 1079 transition count 962
Deduced a syphon composed of 117 places in 2 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 1082 place count 962 transition count 962
Discarding 183 places :
Symmetric choice reduction at 3 with 183 rule applications. Total rules 1265 place count 779 transition count 779
Iterating global reduction 3 with 183 rules applied. Total rules applied 1448 place count 779 transition count 779
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1448 place count 779 transition count 711
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1584 place count 711 transition count 711
Performed 249 Post agglomeration using F-continuation condition.Transition count delta: 249
Deduced a syphon composed of 249 places in 1 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 2082 place count 462 transition count 462
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 2212 place count 397 transition count 503
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2213 place count 397 transition count 502
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2221 place count 397 transition count 494
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2229 place count 389 transition count 494
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 2233 place count 389 transition count 490
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2236 place count 389 transition count 490
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2237 place count 389 transition count 490
Applied a total of 2237 rules in 323 ms. Remains 389 /1503 variables (removed 1114) and now considering 490/1503 (removed 1013) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 389/1503 places, 490/1503 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 490 rows 389 cols
[2024-05-29 20:42:30] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 20:42:30] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:42:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-29 20:42:30] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 20:42:30] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-29 20:42:31] [INFO ] After 643ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 20:42:31] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:42:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 459 ms
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 6 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 296 ms
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2024-05-29 20:42:32] [INFO ] After 1990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 379 ms.
[2024-05-29 20:42:33] [INFO ] After 2902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 101 ms.
Support contains 91 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 490/490 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 389 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 388 transition count 489
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 388 transition count 488
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 387 transition count 488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 386 transition count 487
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 386 transition count 487
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 381 transition count 482
Applied a total of 16 rules in 38 ms. Remains 381 /389 variables (removed 8) and now considering 482/490 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 381/389 places, 482/490 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 6) seen :3
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-06 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 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
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
Running SMT prover for 3 properties.
// Phase 1: matrix 482 rows 381 cols
[2024-05-29 20:42:33] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 20:42:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:42:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 20:42:34] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:42:34] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-29 20:42:34] [INFO ] After 285ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:42:34] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-29 20:42:34] [INFO ] After 833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 18 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 482/482 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 381 transition count 458
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 357 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 356 transition count 457
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 50 place count 356 transition count 436
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 92 place count 335 transition count 436
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 333 transition count 434
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 333 transition count 434
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 96 place count 333 transition count 433
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 98 place count 332 transition count 433
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 182 place count 290 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 222 place count 270 transition count 417
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 270 transition count 416
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 270 transition count 414
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 270 transition count 411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 231 place count 267 transition count 411
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 267 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 266 transition count 409
Applied a total of 233 rules in 84 ms. Remains 266 /381 variables (removed 115) and now considering 409/482 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 266/381 places, 409/482 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
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
Interrupted probabilistic random walk after 347822 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{1=1}
Probabilistic random walk after 347822 steps, saw 232627 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 409 rows 266 cols
[2024-05-29 20:42:38] [INFO ] Computed 121 invariants in 6 ms
[2024-05-29 20:42:38] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:42:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 20:42:38] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:38] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-29 20:42:38] [INFO ] After 146ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:38] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-29 20:42:38] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 409/409 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 266 transition count 408
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 265 transition count 408
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 408
Applied a total of 4 rules in 18 ms. Remains 264 /266 variables (removed 2) and now considering 408/409 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 264/266 places, 408/409 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 332984 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332984 steps, saw 224568 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 408 rows 264 cols
[2024-05-29 20:42:42] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 20:42:42] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:42:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 20:42:42] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:42] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-29 20:42:42] [INFO ] After 125ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:42] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-29 20:42:42] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 16 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 408/408 transitions.
Applied a total of 0 rules in 8 ms. Remains 264 /264 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 264/264 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 408/408 transitions.
Applied a total of 0 rules in 7 ms. Remains 264 /264 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-29 20:42:42] [INFO ] Invariant cache hit.
[2024-05-29 20:42:42] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 20:42:42] [INFO ] Invariant cache hit.
[2024-05-29 20:42:43] [INFO ] State equation strengthened by 148 read => feed constraints.
[2024-05-29 20:42:43] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-05-29 20:42:43] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-29 20:42:43] [INFO ] Invariant cache hit.
[2024-05-29 20:42:43] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1058 ms. Remains : 264/264 places, 408/408 transitions.
Graph (trivial) has 95 edges and 264 vertex of which 2 / 264 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 95 edges and 262 vertex of which 4 / 262 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 260 transition count 404
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 94 edges and 258 vertex of which 6 / 258 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 255 transition count 395
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 252 vertex of which 6 / 252 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 32 place count 249 transition count 384
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 246 vertex of which 6 / 246 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 47 place count 243 transition count 373
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 87 edges and 240 vertex of which 6 / 240 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 17 rules applied. Total rules applied 64 place count 237 transition count 360
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 85 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 15 rules applied. Total rules applied 79 place count 231 transition count 349
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 83 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 15 rules applied. Total rules applied 94 place count 225 transition count 338
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 79 edges and 222 vertex of which 4 / 222 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 15 rules applied. Total rules applied 109 place count 220 transition count 327
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 218 vertex of which 2 / 218 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 9 rules applied. Total rules applied 118 place count 217 transition count 321
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 123 place count 216 transition count 317
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 123 place count 216 transition count 313
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 134 place count 209 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 71 edges and 209 vertex of which 2 / 209 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 4 rules applied. Total rules applied 138 place count 208 transition count 310
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 71 edges and 206 vertex of which 2 / 206 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 6 rules applied. Total rules applied 144 place count 205 transition count 307
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 72 edges and 204 vertex of which 6 / 204 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 149 place count 201 transition count 304
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 69 edges and 199 vertex of which 6 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 163 place count 196 transition count 293
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 67 edges and 193 vertex of which 4 / 193 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 14 with 13 rules applied. Total rules applied 176 place count 191 transition count 284
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 658 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (trivial) has 64 edges and 187 vertex of which 2 / 187 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 15 with 12 rules applied. Total rules applied 188 place count 186 transition count 274
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 193 place count 185 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 193 place count 185 transition count 269
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 3 rules applied. Total rules applied 196 place count 183 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 198 place count 182 transition count 268
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 199 place count 182 transition count 267
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 204 place count 182 transition count 262
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 18 with 17 rules applied. Total rules applied 221 place count 182 transition count 262
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 222 place count 182 transition count 261
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 19 with 12 rules applied. Total rules applied 234 place count 182 transition count 249
Applied a total of 234 rules in 79 ms. Remains 182 /264 variables (removed 82) and now considering 249/408 (removed 159) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 249 rows 182 cols
[2024-05-29 20:42:43] [INFO ] Computed 82 invariants in 1 ms
[2024-05-29 20:42:43] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:42:43] [INFO ] [Nat]Absence check using 82 positive place invariants in 10 ms returned sat
[2024-05-29 20:42:43] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 20:42:44] [INFO ] After 39ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:44] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 20:42:44] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:42:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 20:42:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 264 places, 408 transitions and 2260 arcs took 4 ms.
[2024-05-29 20:42:44] [INFO ] Flatten gal took : 76 ms
Total runtime 42111 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-030B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
ReachabilityCardinality

FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717015365461

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 0 ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
lola: result : true
lola: markings : 27
lola: fired transitions : 26
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 8 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-00 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 18 (type EXCL) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 3 ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 7 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
lola: result : true
lola: fired transitions : 25
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 17 (type SRCH) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 15 (type EQUN) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 18 (type EXCL) for ShieldRVt-PT-030B-ReachabilityCardinality-2024-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-ReachabilityCardinality-2024-00: AG false tandem / insertion
ShieldRVt-PT-030B-ReachabilityCardinality-2024-14: AG true tandem / insertion


Time elapsed: 0 secs. Pages in use: 3

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVt-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789800629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;