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.r426-tajo-167905978800351.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 marciexred
Input is ShieldRVt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 1.3M 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 ShieldRVt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679350939505

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:22:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:22:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:22:21] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-20 22:22:22] [INFO ] Transformed 5003 places.
[2023-03-20 22:22:22] [INFO ] Transformed 5003 transitions.
[2023-03-20 22:22:22] [INFO ] Found NUPN structural information;
[2023-03-20 22:22:22] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-03 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 5003 rows 5003 cols
[2023-03-20 22:22:23] [INFO ] Computed 401 place invariants in 58 ms
[2023-03-20 22:22:27] [INFO ] After 3104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 22:22:29] [INFO ] [Nat]Absence check using 401 positive place invariants in 385 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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 22:22:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 22:22:52] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 285 out of 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions removed 1325 transitions
Trivial Post-agglo rules discarded 1325 transitions
Performed 1325 trivial Post agglomeration. Transition count delta: 1325
Iterating post reduction 0 with 1325 rules applied. Total rules applied 1325 place count 5003 transition count 3678
Reduce places removed 1325 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 1327 rules applied. Total rules applied 2652 place count 3678 transition count 3676
Reduce places removed 1 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 2 with 102 rules applied. Total rules applied 2754 place count 3677 transition count 3575
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 2855 place count 3576 transition count 3575
Performed 415 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 415 Pre rules applied. Total rules applied 2855 place count 3576 transition count 3160
Deduced a syphon composed of 415 places in 13 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 4 with 830 rules applied. Total rules applied 3685 place count 3161 transition count 3160
Discarding 632 places :
Symmetric choice reduction at 4 with 632 rule applications. Total rules 4317 place count 2529 transition count 2528
Iterating global reduction 4 with 632 rules applied. Total rules applied 4949 place count 2529 transition count 2528
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 233 Pre rules applied. Total rules applied 4949 place count 2529 transition count 2295
Deduced a syphon composed of 233 places in 12 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 4 with 466 rules applied. Total rules applied 5415 place count 2296 transition count 2295
Performed 820 Post agglomeration using F-continuation condition.Transition count delta: 820
Deduced a syphon composed of 820 places in 5 ms
Reduce places removed 820 places and 0 transitions.
Iterating global reduction 4 with 1640 rules applied. Total rules applied 7055 place count 1476 transition count 1475
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7257 place count 1375 transition count 1545
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7459 place count 1274 transition count 1608
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 7511 place count 1248 transition count 1628
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7512 place count 1248 transition count 1627
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 7524 place count 1248 transition count 1615
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 7536 place count 1236 transition count 1615
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 7540 place count 1236 transition count 1611
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 7544 place count 1236 transition count 1611
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 7545 place count 1236 transition count 1611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 7546 place count 1235 transition count 1610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7547 place count 1234 transition count 1610
Applied a total of 7547 rules in 1803 ms. Remains 1234 /5003 variables (removed 3769) and now considering 1610/5003 (removed 3393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1804 ms. Remains : 1234/5003 places, 1610/5003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 14) seen :1
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :1
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1610 rows 1234 cols
[2023-03-20 22:22:54] [INFO ] Computed 400 place invariants in 7 ms
[2023-03-20 22:22:55] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 22:22:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 159 ms returned sat
[2023-03-20 22:22:58] [INFO ] After 2220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 22:22:58] [INFO ] State equation strengthened by 581 read => feed constraints.
[2023-03-20 22:23:03] [INFO ] After 5081ms SMT Verify possible using 581 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-20 22:23:03] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 6 ms to minimize.
[2023-03-20 22:23:04] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2023-03-20 22:23:04] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 3 ms to minimize.
[2023-03-20 22:23:04] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 2 ms to minimize.
[2023-03-20 22:23:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1355 ms
[2023-03-20 22:23:07] [INFO ] Deduced a trap composed of 11 places in 524 ms of which 2 ms to minimize.
[2023-03-20 22:23:08] [INFO ] Deduced a trap composed of 17 places in 565 ms of which 1 ms to minimize.
[2023-03-20 22:23:09] [INFO ] Deduced a trap composed of 12 places in 505 ms of which 2 ms to minimize.
[2023-03-20 22:23:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1934 ms
[2023-03-20 22:23:10] [INFO ] Deduced a trap composed of 14 places in 462 ms of which 1 ms to minimize.
[2023-03-20 22:23:10] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2023-03-20 22:23:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1223 ms
[2023-03-20 22:23:11] [INFO ] Deduced a trap composed of 21 places in 396 ms of which 1 ms to minimize.
[2023-03-20 22:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 528 ms
[2023-03-20 22:23:13] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 1 ms to minimize.
[2023-03-20 22:23:13] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2023-03-20 22:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 954 ms
[2023-03-20 22:23:16] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-20 22:23:16] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 0 ms to minimize.
[2023-03-20 22:23:16] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2023-03-20 22:23:17] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2023-03-20 22:23:17] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 0 ms to minimize.
[2023-03-20 22:23:17] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2023-03-20 22:23:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2051 ms
[2023-03-20 22:23:18] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2023-03-20 22:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2023-03-20 22:23:19] [INFO ] After 21116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 929 ms.
[2023-03-20 22:23:20] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 396 ms.
Support contains 232 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 1610/1610 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1234 transition count 1598
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 1222 transition count 1597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1221 transition count 1597
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 26 place count 1221 transition count 1575
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 70 place count 1199 transition count 1575
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 126 place count 1171 transition count 1547
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 154 place count 1157 transition count 1563
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 1157 transition count 1562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 1156 transition count 1562
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 1156 transition count 1561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 1155 transition count 1560
Applied a total of 158 rules in 218 ms. Remains 1155 /1234 variables (removed 79) and now considering 1560/1610 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 1155/1234 places, 1560/1610 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 12) seen :1
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) 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 11) seen :0
Interrupted probabilistic random walk after 72208 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72208 steps, saw 44478 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1560 rows 1155 cols
[2023-03-20 22:23:25] [INFO ] Computed 400 place invariants in 15 ms
[2023-03-20 22:23:25] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 22:23:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 85 ms returned sat
[2023-03-20 22:23:27] [INFO ] After 1655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 22:23:27] [INFO ] State equation strengthened by 624 read => feed constraints.
[2023-03-20 22:23:34] [INFO ] After 6571ms SMT Verify possible using 624 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 22:23:34] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
[2023-03-20 22:23:34] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2023-03-20 22:23:35] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 0 ms to minimize.
[2023-03-20 22:23:35] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-20 22:23:35] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2023-03-20 22:23:36] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-20 22:23:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1849 ms
[2023-03-20 22:23:38] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2023-03-20 22:23:38] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 1 ms to minimize.
[2023-03-20 22:23:39] [INFO ] Deduced a trap composed of 10 places in 392 ms of which 1 ms to minimize.
[2023-03-20 22:23:40] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2023-03-20 22:23:40] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 1 ms to minimize.
[2023-03-20 22:23:41] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 1 ms to minimize.
[2023-03-20 22:23:41] [INFO ] Deduced a trap composed of 14 places in 357 ms of which 1 ms to minimize.
[2023-03-20 22:23:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3528 ms
[2023-03-20 22:23:43] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 4 ms to minimize.
[2023-03-20 22:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-20 22:23:44] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-20 22:23:45] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2023-03-20 22:23:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2023-03-20 22:23:45] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2023-03-20 22:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-20 22:23:47] [INFO ] After 20151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
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 22:23:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 22:23:50] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 293 ms.
Support contains 216 out of 1155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1155/1155 places, 1560/1560 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1155 transition count 1555
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1150 transition count 1555
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 1150 transition count 1551
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 1146 transition count 1551
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 1137 transition count 1542
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 1131 transition count 1548
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 1131 transition count 1548
Applied a total of 49 rules in 100 ms. Remains 1131 /1155 variables (removed 24) and now considering 1548/1560 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1131/1155 places, 1548/1560 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 69008 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 69008 steps, saw 43362 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1548 rows 1131 cols
[2023-03-20 22:23:54] [INFO ] Computed 400 place invariants in 18 ms
[2023-03-20 22:23:55] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 22:23:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 86 ms returned sat
[2023-03-20 22:23:57] [INFO ] After 1763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 22:23:57] [INFO ] State equation strengthened by 644 read => feed constraints.
[2023-03-20 22:24:03] [INFO ] After 5438ms SMT Verify possible using 644 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 22:24:03] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-20 22:24:03] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-20 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2023-03-20 22:24:05] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2023-03-20 22:24:05] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2023-03-20 22:24:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2023-03-20 22:24:07] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2023-03-20 22:24:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-20 22:24:09] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 1 ms to minimize.
[2023-03-20 22:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2023-03-20 22:24:10] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 0 ms to minimize.
[2023-03-20 22:24:10] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-20 22:24:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
[2023-03-20 22:24:11] [INFO ] After 13579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 6962 ms.
[2023-03-20 22:24:18] [INFO ] After 22950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 255 ms.
Support contains 216 out of 1131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 1548/1548 transitions.
Applied a total of 0 rules in 32 ms. Remains 1131 /1131 variables (removed 0) and now considering 1548/1548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1131/1131 places, 1548/1548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 1548/1548 transitions.
Applied a total of 0 rules in 30 ms. Remains 1131 /1131 variables (removed 0) and now considering 1548/1548 (removed 0) transitions.
[2023-03-20 22:24:18] [INFO ] Invariant cache hit.
[2023-03-20 22:24:19] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-20 22:24:19] [INFO ] Invariant cache hit.
[2023-03-20 22:24:19] [INFO ] State equation strengthened by 644 read => feed constraints.
[2023-03-20 22:24:25] [INFO ] Implicit Places using invariants and state equation in 6501 ms returned []
Implicit Place search using SMT with State Equation took 7074 ms to find 0 implicit places.
[2023-03-20 22:24:25] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-20 22:24:25] [INFO ] Invariant cache hit.
[2023-03-20 22:24:26] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8200 ms. Remains : 1131/1131 places, 1548/1548 transitions.
Graph (trivial) has 252 edges and 1131 vertex of which 2 / 1131 are part of one of the 1 SCC in 5 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.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1129 transition count 1544
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1129 transition count 1543
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1128 transition count 1543
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 1127 transition count 1542
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 1 with 64 rules applied. Total rules applied 72 place count 1127 transition count 1478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 1126 transition count 1478
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 2 with 61 rules applied. Total rules applied 134 place count 1126 transition count 1478
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 176 place count 1126 transition count 1436
Applied a total of 176 rules in 156 ms. Remains 1126 /1131 variables (removed 5) and now considering 1436/1548 (removed 112) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1436 rows 1126 cols
[2023-03-20 22:24:26] [INFO ] Computed 398 place invariants in 12 ms
[2023-03-20 22:24:27] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 22:24:27] [INFO ] [Nat]Absence check using 398 positive place invariants in 68 ms returned sat
[2023-03-20 22:24:29] [INFO ] After 1710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 22:24:29] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2023-03-20 22:24:29] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-03-20 22:24:30] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-20 22:24:30] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2023-03-20 22:24:30] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2023-03-20 22:24:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 986 ms
[2023-03-20 22:24:30] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-20 22:24:31] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2023-03-20 22:24:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2023-03-20 22:24:31] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-20 22:24:31] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2023-03-20 22:24:31] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-20 22:24:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 652 ms
[2023-03-20 22:24:32] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-20 22:24:33] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2023-03-20 22:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2023-03-20 22:24:33] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-20 22:24:33] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2023-03-20 22:24:33] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2023-03-20 22:24:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 629 ms
[2023-03-20 22:24:34] [INFO ] After 6561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1480 ms.
[2023-03-20 22:24:35] [INFO ] After 8537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-20 22:24:35] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 22:24:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1131 places, 1548 transitions and 7597 arcs took 15 ms.
[2023-03-20 22:24:36] [INFO ] Flatten gal took : 190 ms
Total runtime 134582 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_100B
(NrP: 1131 NrTr: 1548 NrArc: 7597)

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

net check time: 0m 0.001sec

init dd package: 0m 3.276sec


before gc: list nodes free: 417277

after gc: idd nodes used:34811884, unused:29188116; list nodes free:120417324

RS generation: 16m34.891sec


-> last computed set: #nodes 34810754 (3.5e+07) #states 12,934,522,960,266,549,670,586,346,487,608 (31)


CANNOT_COMPUTE


BK_STOP 1679352094169

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.013sec

290253 290033 290021 289916 289332 289271idd.cc:820: DD Exception: No free nodes

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-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVt-PT-100B, 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 r426-tajo-167905978800351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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