About the Execution of Marcie+red for ShieldRVt-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10073.976 | 151607.00 | 180386.00 | 97.40 | ?FTFTT??F?T??TFT | normal |
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-167905978800335.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800335
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 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.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 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 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 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 614K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679350197380
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-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:09:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:09:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:09:59] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-20 22:09:59] [INFO ] Transformed 2503 places.
[2023-03-20 22:09:59] [INFO ] Transformed 2503 transitions.
[2023-03-20 22:09:59] [INFO ] Found NUPN structural information;
[2023-03-20 22:09:59] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2503 rows 2503 cols
[2023-03-20 22:10:01] [INFO ] Computed 201 place invariants in 52 ms
[2023-03-20 22:10:02] [INFO ] After 1675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 22:10:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 135 ms returned sat
[2023-03-20 22:10:13] [INFO ] After 9173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 22:10:14] [INFO ] Deduced a trap composed of 28 places in 945 ms of which 17 ms to minimize.
[2023-03-20 22:10:15] [INFO ] Deduced a trap composed of 25 places in 1127 ms of which 2 ms to minimize.
[2023-03-20 22:10:17] [INFO ] Deduced a trap composed of 39 places in 1071 ms of which 2 ms to minimize.
[2023-03-20 22:10:18] [INFO ] Deduced a trap composed of 30 places in 1034 ms of which 2 ms to minimize.
[2023-03-20 22:10:19] [INFO ] Deduced a trap composed of 43 places in 807 ms of which 2 ms to minimize.
[2023-03-20 22:10:20] [INFO ] Deduced a trap composed of 51 places in 783 ms of which 2 ms to minimize.
[2023-03-20 22:10:21] [INFO ] Deduced a trap composed of 48 places in 1091 ms of which 4 ms to minimize.
[2023-03-20 22:10:22] [INFO ] Deduced a trap composed of 52 places in 972 ms of which 2 ms to minimize.
[2023-03-20 22:10:23] [INFO ] Deduced a trap composed of 56 places in 699 ms of which 2 ms to minimize.
[2023-03-20 22:10:24] [INFO ] Deduced a trap composed of 29 places in 745 ms of which 2 ms to minimize.
[2023-03-20 22:10:25] [INFO ] Deduced a trap composed of 20 places in 687 ms of which 2 ms to minimize.
[2023-03-20 22:10:25] [INFO ] Deduced a trap composed of 50 places in 739 ms of which 2 ms to minimize.
[2023-03-20 22:10:26] [INFO ] Deduced a trap composed of 23 places in 714 ms of which 2 ms to minimize.
[2023-03-20 22:10:27] [INFO ] Deduced a trap composed of 27 places in 695 ms of which 1 ms to minimize.
[2023-03-20 22:10:28] [INFO ] Deduced a trap composed of 35 places in 686 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 22:10:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 22:10:28] [INFO ] After 25519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 536 ms.
Support contains 104 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions removed 692 transitions
Trivial Post-agglo rules discarded 692 transitions
Performed 692 trivial Post agglomeration. Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 692 place count 2503 transition count 1811
Reduce places removed 692 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 736 rules applied. Total rules applied 1428 place count 1811 transition count 1767
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 1472 place count 1767 transition count 1767
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 1472 place count 1767 transition count 1560
Deduced a syphon composed of 207 places in 7 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 1886 place count 1560 transition count 1560
Discarding 313 places :
Symmetric choice reduction at 3 with 313 rule applications. Total rules 2199 place count 1247 transition count 1247
Iterating global reduction 3 with 313 rules applied. Total rules applied 2512 place count 1247 transition count 1247
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 3 with 2 rules applied. Total rules applied 2514 place count 1247 transition count 1245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2515 place count 1246 transition count 1245
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 119 Pre rules applied. Total rules applied 2515 place count 1246 transition count 1126
Deduced a syphon composed of 119 places in 5 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 5 with 238 rules applied. Total rules applied 2753 place count 1127 transition count 1126
Performed 435 Post agglomeration using F-continuation condition.Transition count delta: 435
Deduced a syphon composed of 435 places in 3 ms
Reduce places removed 435 places and 0 transitions.
Iterating global reduction 5 with 870 rules applied. Total rules applied 3623 place count 692 transition count 691
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 3825 place count 591 transition count 765
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 3873 place count 567 transition count 782
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3877 place count 567 transition count 778
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3881 place count 563 transition count 778
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3884 place count 563 transition count 775
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3887 place count 563 transition count 775
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3888 place count 562 transition count 774
Applied a total of 3888 rules in 588 ms. Remains 562 /2503 variables (removed 1941) and now considering 774/2503 (removed 1729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 562/2503 places, 774/2503 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 135622 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135622 steps, saw 94598 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 774 rows 562 cols
[2023-03-20 22:10:33] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 22:10:33] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 22:10:33] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-20 22:10:33] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 22:10:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-20 22:10:34] [INFO ] After 401ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 22:10:34] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-20 22:10:34] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-20 22:10:34] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-20 22:10:34] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-20 22:10:34] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-20 22:10:35] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-20 22:10:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 848 ms
[2023-03-20 22:10:35] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-20 22:10:35] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-03-20 22:10:35] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-20 22:10:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 465 ms
[2023-03-20 22:10:35] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-20 22:10:35] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2023-03-20 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-20 22:10:36] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-20 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-20 22:10:36] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-20 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-20 22:10:36] [INFO ] After 2796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 396 ms.
[2023-03-20 22:10:36] [INFO ] After 3826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 111 ms.
Support contains 104 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 774/774 transitions.
Applied a total of 0 rules in 25 ms. Remains 562 /562 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 562/562 places, 774/774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 774/774 transitions.
Applied a total of 0 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 774/774 (removed 0) transitions.
[2023-03-20 22:10:37] [INFO ] Invariant cache hit.
[2023-03-20 22:10:37] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-20 22:10:37] [INFO ] Invariant cache hit.
[2023-03-20 22:10:37] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-20 22:10:38] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2023-03-20 22:10:38] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-20 22:10:38] [INFO ] Invariant cache hit.
[2023-03-20 22:10:38] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1720 ms. Remains : 562/562 places, 774/774 transitions.
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 562 transition count 742
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 562 transition count 742
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 562 transition count 733
Applied a total of 51 rules in 60 ms. Remains 562 /562 variables (removed 0) and now considering 733/774 (removed 41) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 733 rows 562 cols
[2023-03-20 22:10:38] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 22:10:39] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 22:10:39] [INFO ] [Nat]Absence check using 201 positive place invariants in 37 ms returned sat
[2023-03-20 22:10:39] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 22:10:39] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2023-03-20 22:10:39] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-20 22:10:40] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2023-03-20 22:10:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2023-03-20 22:10:40] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-20 22:10:40] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2023-03-20 22:10:40] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-20 22:10:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 411 ms
[2023-03-20 22:10:40] [INFO ] After 1587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-20 22:10:41] [INFO ] After 2025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 22:10:41] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-20 22:10:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 774 transitions and 3670 arcs took 7 ms.
[2023-03-20 22:10:41] [INFO ] Flatten gal took : 119 ms
Total runtime 41808 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_050B
(NrP: 562 NrTr: 774 NrArc: 3670)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.046sec
net check time: 0m 0.000sec
init dd package: 0m 3.206sec
before gc: list nodes free: 553801
after gc: idd nodes used:32735429, unused:31264571; list nodes free:137538279
RS generation: 1m26.978sec
-> last computed set: #nodes 32734868 (3.3e+07) #states 11,519,532,122,112 (13)
CANNOT_COMPUTE
BK_STOP 1679350348987
--------------------
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.002sec
idd.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-050B"
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-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 r426-tajo-167905978800335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-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 '
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 ;