fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r393-oct2-167903717100463
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldPPPs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4480.968 3600000.00 14275286.00 45.40 TFFTTTTTFTTFFT?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717100463.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 349K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679451000780

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:10:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:10:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:10:03] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-22 02:10:04] [INFO ] Transformed 1363 places.
[2023-03-22 02:10:04] [INFO ] Transformed 1263 transitions.
[2023-03-22 02:10:04] [INFO ] Found NUPN structural information;
[2023-03-22 02:10:04] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 16) seen :14
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2023-03-22 02:10:04] [INFO ] Computed 221 place invariants in 45 ms
[2023-03-22 02:10:05] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:10:05] [INFO ] [Nat]Absence check using 221 positive place invariants in 164 ms returned sat
[2023-03-22 02:10:06] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:10:07] [INFO ] Deduced a trap composed of 17 places in 497 ms of which 15 ms to minimize.
[2023-03-22 02:10:08] [INFO ] Deduced a trap composed of 18 places in 513 ms of which 1 ms to minimize.
[2023-03-22 02:10:08] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 1 ms to minimize.
[2023-03-22 02:10:08] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2023-03-22 02:10:09] [INFO ] Deduced a trap composed of 23 places in 370 ms of which 1 ms to minimize.
[2023-03-22 02:10:09] [INFO ] Deduced a trap composed of 30 places in 414 ms of which 2 ms to minimize.
[2023-03-22 02:10:10] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 1 ms to minimize.
[2023-03-22 02:10:10] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 2 ms to minimize.
[2023-03-22 02:10:11] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2023-03-22 02:10:11] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 1 ms to minimize.
[2023-03-22 02:10:11] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2023-03-22 02:10:11] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 1 ms to minimize.
[2023-03-22 02:10:12] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
[2023-03-22 02:10:12] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 1 ms to minimize.
[2023-03-22 02:10:12] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 0 ms to minimize.
[2023-03-22 02:10:13] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 1 ms to minimize.
[2023-03-22 02:10:13] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2023-03-22 02:10:13] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2023-03-22 02:10:14] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 1 ms to minimize.
[2023-03-22 02:10:14] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 4 ms to minimize.
[2023-03-22 02:10:15] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 1 ms to minimize.
[2023-03-22 02:10:15] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 2 ms to minimize.
[2023-03-22 02:10:15] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 1 ms to minimize.
[2023-03-22 02:10:16] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 0 ms to minimize.
[2023-03-22 02:10:16] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 1 ms to minimize.
[2023-03-22 02:10:16] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 1 ms to minimize.
[2023-03-22 02:10:17] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 7 ms to minimize.
[2023-03-22 02:10:17] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 1 ms to minimize.
[2023-03-22 02:10:18] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 0 ms to minimize.
[2023-03-22 02:10:18] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 1 ms to minimize.
[2023-03-22 02:10:18] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 1 ms to minimize.
[2023-03-22 02:10:19] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 0 ms to minimize.
[2023-03-22 02:10:19] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2023-03-22 02:10:20] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 0 ms to minimize.
[2023-03-22 02:10:20] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2023-03-22 02:10:20] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 1 ms to minimize.
[2023-03-22 02:10:21] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 1 ms to minimize.
[2023-03-22 02:10:21] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 1 ms to minimize.
[2023-03-22 02:10:21] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 1 ms to minimize.
[2023-03-22 02:10:21] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2023-03-22 02:10:22] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 1 ms to minimize.
[2023-03-22 02:10:22] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2023-03-22 02:10:22] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 14 ms to minimize.
[2023-03-22 02:10:23] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 1 ms to minimize.
[2023-03-22 02:10:23] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2023-03-22 02:10:23] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 1 ms to minimize.
[2023-03-22 02:10:23] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 16695 ms
[2023-03-22 02:10:23] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:10:24] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2023-03-22 02:10:24] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 0 ms to minimize.
[2023-03-22 02:10:24] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-22 02:10:25] [INFO ] Deduced a trap composed of 23 places in 516 ms of which 11 ms to minimize.
[2023-03-22 02:10:25] [INFO ] Deduced a trap composed of 29 places in 414 ms of which 1 ms to minimize.
[2023-03-22 02:10:26] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 1 ms to minimize.
[2023-03-22 02:10:26] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 1 ms to minimize.
[2023-03-22 02:10:26] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 1 ms to minimize.
[2023-03-22 02:10:27] [INFO ] Deduced a trap composed of 30 places in 350 ms of which 13 ms to minimize.
[2023-03-22 02:10:27] [INFO ] Deduced a trap composed of 28 places in 379 ms of which 1 ms to minimize.
[2023-03-22 02:10:27] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 1 ms to minimize.
[2023-03-22 02:10:28] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2023-03-22 02:10:28] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 1 ms to minimize.
[2023-03-22 02:10:28] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 1 ms to minimize.
[2023-03-22 02:10:29] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 1 ms to minimize.
[2023-03-22 02:10:29] [INFO ] Deduced a trap composed of 34 places in 316 ms of which 1 ms to minimize.
[2023-03-22 02:10:29] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 13 ms to minimize.
[2023-03-22 02:10:30] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:10:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:10:30] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 55 ms.
Support contains 53 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1363 transition count 1133
Reduce places removed 130 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 135 rules applied. Total rules applied 265 place count 1233 transition count 1128
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 270 place count 1228 transition count 1128
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 270 place count 1228 transition count 1031
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 464 place count 1131 transition count 1031
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 595 place count 1000 transition count 900
Iterating global reduction 3 with 131 rules applied. Total rules applied 726 place count 1000 transition count 900
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 726 place count 1000 transition count 851
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 824 place count 951 transition count 851
Performed 275 Post agglomeration using F-continuation condition.Transition count delta: 275
Deduced a syphon composed of 275 places in 1 ms
Reduce places removed 275 places and 0 transitions.
Iterating global reduction 3 with 550 rules applied. Total rules applied 1374 place count 676 transition count 576
Partial Free-agglomeration rule applied 165 times.
Drop transitions removed 165 transitions
Iterating global reduction 3 with 165 rules applied. Total rules applied 1539 place count 676 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1540 place count 675 transition count 575
Applied a total of 1540 rules in 427 ms. Remains 675 /1363 variables (removed 688) and now considering 575/1263 (removed 688) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 675/1363 places, 575/1263 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :1
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 575 rows 675 cols
[2023-03-22 02:10:31] [INFO ] Computed 221 place invariants in 19 ms
[2023-03-22 02:10:31] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:10:31] [INFO ] [Nat]Absence check using 211 positive place invariants in 56 ms returned sat
[2023-03-22 02:10:31] [INFO ] [Nat]Absence check using 211 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-22 02:10:31] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:10:31] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2023-03-22 02:10:31] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 4 ms to minimize.
[2023-03-22 02:10:32] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 2 ms to minimize.
[2023-03-22 02:10:32] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:10:32] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 0 ms to minimize.
[2023-03-22 02:10:32] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2023-03-22 02:10:33] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-22 02:10:33] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-22 02:10:33] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 02:10:33] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 02:10:33] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-22 02:10:34] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2023-03-22 02:10:34] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-22 02:10:34] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-22 02:10:34] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-22 02:10:34] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-22 02:10:34] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-22 02:10:35] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4319 ms
[2023-03-22 02:10:35] [INFO ] After 4661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-22 02:10:35] [INFO ] After 4850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 15 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 575/575 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 675 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 674 transition count 574
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 674 transition count 569
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 669 transition count 569
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 72 place count 639 transition count 539
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 639 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 638 transition count 538
Applied a total of 85 rules in 117 ms. Remains 638 /675 variables (removed 37) and now considering 538/575 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 638/675 places, 538/575 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272373 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272373 steps, saw 207087 distinct states, run finished after 3003 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 538 rows 638 cols
[2023-03-22 02:10:39] [INFO ] Computed 221 place invariants in 34 ms
[2023-03-22 02:10:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:10:39] [INFO ] [Nat]Absence check using 204 positive place invariants in 28 ms returned sat
[2023-03-22 02:10:39] [INFO ] [Nat]Absence check using 204 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-22 02:10:39] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:10:40] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-22 02:10:40] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-22 02:10:40] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-22 02:10:40] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-22 02:10:40] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-22 02:10:40] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-03-22 02:10:41] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-22 02:10:41] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-22 02:10:41] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 0 ms to minimize.
[2023-03-22 02:10:41] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-22 02:10:42] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-22 02:10:42] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-22 02:10:42] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 02:10:42] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-22 02:10:42] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-22 02:10:42] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 3 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-22 02:10:43] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4053 ms
[2023-03-22 02:10:43] [INFO ] After 4476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-22 02:10:43] [INFO ] After 4652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 15 out of 638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 14 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 638/638 places, 538/538 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 30 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2023-03-22 02:10:44] [INFO ] Invariant cache hit.
[2023-03-22 02:10:44] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-22 02:10:44] [INFO ] Invariant cache hit.
[2023-03-22 02:10:45] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2023-03-22 02:10:45] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-22 02:10:45] [INFO ] Invariant cache hit.
[2023-03-22 02:10:45] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1956 ms. Remains : 638/638 places, 538/538 transitions.
Applied a total of 0 rules in 20 ms. Remains 638 /638 variables (removed 0) and now considering 538/538 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 02:10:45] [INFO ] Invariant cache hit.
[2023-03-22 02:10:46] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:10:46] [INFO ] [Nat]Absence check using 204 positive place invariants in 40 ms returned sat
[2023-03-22 02:10:46] [INFO ] [Nat]Absence check using 204 positive and 17 generalized place invariants in 37 ms returned sat
[2023-03-22 02:10:46] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:10:46] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 1 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-22 02:10:47] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-22 02:10:48] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-22 02:10:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-22 02:10:48] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 12 ms to minimize.
[2023-03-22 02:10:48] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-22 02:10:48] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-22 02:10:48] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2023-03-22 02:10:49] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2023-03-22 02:10:49] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-22 02:10:49] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2023-03-22 02:10:49] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2023-03-22 02:10:49] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-22 02:10:50] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-22 02:10:50] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-22 02:10:50] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2023-03-22 02:10:50] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3801 ms
[2023-03-22 02:10:50] [INFO ] After 4163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-22 02:10:50] [INFO ] After 4482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 02:10:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-22 02:10:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 638 places, 538 transitions and 2357 arcs took 5 ms.
[2023-03-22 02:10:50] [INFO ] Flatten gal took : 93 ms
Total runtime 47132 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/912/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11662452 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096632 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717100463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;