Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679302541057

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=ShieldRVs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:55:42] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-20 08:55:42] [INFO ] Transformed 2003 places.
[2023-03-20 08:55:42] [INFO ] Transformed 2253 transitions.
[2023-03-20 08:55:42] [INFO ] Found NUPN structural information;
[2023-03-20 08:55:42] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 16) seen :12
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2253 rows 2003 cols
[2023-03-20 08:55:43] [INFO ] Computed 201 place invariants in 30 ms
[2023-03-20 08:55:44] [INFO ] [Real]Absence check using 201 positive place invariants in 72 ms returned sat
[2023-03-20 08:55:44] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 08:55:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 66 ms returned sat
[2023-03-20 08:55:48] [INFO ] After 3019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 34 places in 558 ms of which 9 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 29 places in 470 ms of which 2 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 30 places in 513 ms of which 2 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 3 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 16 places in 613 ms of which 3 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 22 places in 577 ms of which 2 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 38 places in 554 ms of which 3 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 49 places in 607 ms of which 2 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 2 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 31 places in 457 ms of which 2 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 46 places in 454 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 51 places in 484 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 35 places in 448 ms of which 1 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 38 places in 457 ms of which 1 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 58 places in 422 ms of which 1 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 36 places in 466 ms of which 1 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 34 places in 415 ms of which 3 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 69 places in 416 ms of which 1 ms to minimize.
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 24 places in 736 ms of which 2 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 36 places in 658 ms of which 1 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 29 places in 678 ms of which 2 ms to minimize.
[2023-03-20 08:56:03] [INFO ] Deduced a trap composed of 40 places in 664 ms of which 2 ms to minimize.
[2023-03-20 08:56:04] [INFO ] Deduced a trap composed of 31 places in 742 ms of which 11 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 28 places in 654 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 28 places in 673 ms of which 1 ms to minimize.
[2023-03-20 08:56:06] [INFO ] Deduced a trap composed of 31 places in 636 ms of which 2 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 22 places in 676 ms of which 2 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 36 places in 758 ms of which 2 ms to minimize.
[2023-03-20 08:56:08] [INFO ] Deduced a trap composed of 52 places in 724 ms of which 2 ms to minimize.
[2023-03-20 08:56:09] [INFO ] Deduced a trap composed of 37 places in 627 ms of which 2 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-20 08:56:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:56:09] [INFO ] After 25271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 234 ms.
Support contains 131 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2003 transition count 2080
Reduce places removed 173 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 180 rules applied. Total rules applied 353 place count 1830 transition count 2073
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 360 place count 1823 transition count 2073
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 360 place count 1823 transition count 1833
Deduced a syphon composed of 240 places in 6 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 840 place count 1583 transition count 1833
Discarding 316 places :
Symmetric choice reduction at 3 with 316 rule applications. Total rules 1156 place count 1267 transition count 1517
Iterating global reduction 3 with 316 rules applied. Total rules applied 1472 place count 1267 transition count 1517
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 1472 place count 1267 transition count 1408
Deduced a syphon composed of 109 places in 9 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 1690 place count 1158 transition count 1408
Performed 330 Post agglomeration using F-continuation condition.Transition count delta: 330
Deduced a syphon composed of 330 places in 3 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 3 with 660 rules applied. Total rules applied 2350 place count 828 transition count 1078
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 3 with 89 rules applied. Total rules applied 2439 place count 828 transition count 1078
Applied a total of 2439 rules in 692 ms. Remains 828 /2003 variables (removed 1175) and now considering 1078/2253 (removed 1175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 828/2003 places, 1078/2253 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1078 rows 828 cols
[2023-03-20 08:56:10] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-20 08:56:11] [INFO ] [Real]Absence check using 201 positive place invariants in 38 ms returned sat
[2023-03-20 08:56:11] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-20 08:56:11] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-20 08:56:12] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2023-03-20 08:56:13] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 1 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 2 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 0 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 1 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-20 08:56:17] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 0 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-20 08:56:18] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7070 ms
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 4 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-20 08:56:21] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3016 ms
[2023-03-20 08:56:22] [INFO ] After 11012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-20 08:56:22] [INFO ] After 11506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 53 ms.
Support contains 51 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1078/1078 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 828 transition count 1071
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 821 transition count 1071
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 14 place count 821 transition count 1055
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 805 transition count 1055
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 804 transition count 1054
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 804 transition count 1054
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 804 transition count 1053
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 803 transition count 1053
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 156 place count 750 transition count 1000
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 750 transition count 1000
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 749 transition count 999
Applied a total of 165 rules in 580 ms. Remains 749 /828 variables (removed 79) and now considering 999/1078 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 580 ms. Remains : 749/828 places, 999/1078 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 200056 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200056 steps, saw 54993 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 999 rows 749 cols
[2023-03-20 08:56:26] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-20 08:56:26] [INFO ] [Real]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:26] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:27] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1033 ms
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:56:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 908 ms
[2023-03-20 08:56:29] [INFO ] After 2490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-20 08:56:29] [INFO ] After 2798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 51 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 999/999 transitions.
Applied a total of 0 rules in 32 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 749/749 places, 999/999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 999/999 transitions.
Applied a total of 0 rules in 31 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
[2023-03-20 08:56:29] [INFO ] Invariant cache hit.
[2023-03-20 08:56:30] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-20 08:56:30] [INFO ] Invariant cache hit.
[2023-03-20 08:56:30] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2023-03-20 08:56:30] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-20 08:56:30] [INFO ] Invariant cache hit.
[2023-03-20 08:56:31] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1742 ms. Remains : 749/749 places, 999/999 transitions.
Applied a total of 0 rules in 29 ms. Remains 749 /749 variables (removed 0) and now considering 999/999 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 08:56:31] [INFO ] Invariant cache hit.
[2023-03-20 08:56:31] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-20 08:56:31] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 08:56:32] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 2 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1635 ms
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-20 08:56:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1057 ms
[2023-03-20 08:56:35] [INFO ] After 3253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-20 08:56:35] [INFO ] After 3551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-20 08:56:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 749 places, 999 transitions and 4687 arcs took 13 ms.
[2023-03-20 08:56:35] [INFO ] Flatten gal took : 171 ms
Total runtime 52922 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/867/inv_0_ --invariant=/tmp/867/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13514056 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098120 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r425-tajo-167905977800159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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