Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 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.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 512K 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 ShieldIIPt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679502530735

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=ShieldIIPt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:28:53] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-22 16:28:53] [INFO ] Transformed 2103 places.
[2023-03-22 16:28:53] [INFO ] Transformed 1953 transitions.
[2023-03-22 16:28:53] [INFO ] Found NUPN structural information;
[2023-03-22 16:28:53] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 16) seen :5
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-22 16:28:54] [INFO ] Computed 271 place invariants in 44 ms
[2023-03-22 16:28:55] [INFO ] [Real]Absence check using 271 positive place invariants in 304 ms returned sat
[2023-03-22 16:28:55] [INFO ] After 1381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 16:28:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 170 ms returned sat
[2023-03-22 16:29:00] [INFO ] After 3778ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-22 16:29:02] [INFO ] Deduced a trap composed of 21 places in 1411 ms of which 19 ms to minimize.
[2023-03-22 16:29:03] [INFO ] Deduced a trap composed of 23 places in 1177 ms of which 4 ms to minimize.
[2023-03-22 16:29:04] [INFO ] Deduced a trap composed of 28 places in 993 ms of which 6 ms to minimize.
[2023-03-22 16:29:06] [INFO ] Deduced a trap composed of 18 places in 1036 ms of which 3 ms to minimize.
[2023-03-22 16:29:07] [INFO ] Deduced a trap composed of 27 places in 1124 ms of which 2 ms to minimize.
[2023-03-22 16:29:08] [INFO ] Deduced a trap composed of 19 places in 866 ms of which 2 ms to minimize.
[2023-03-22 16:29:09] [INFO ] Deduced a trap composed of 14 places in 1007 ms of which 2 ms to minimize.
[2023-03-22 16:29:10] [INFO ] Deduced a trap composed of 32 places in 974 ms of which 10 ms to minimize.
[2023-03-22 16:29:11] [INFO ] Deduced a trap composed of 20 places in 1048 ms of which 11 ms to minimize.
[2023-03-22 16:29:12] [INFO ] Deduced a trap composed of 25 places in 1260 ms of which 2 ms to minimize.
[2023-03-22 16:29:13] [INFO ] Deduced a trap composed of 17 places in 841 ms of which 2 ms to minimize.
[2023-03-22 16:29:14] [INFO ] Deduced a trap composed of 30 places in 1022 ms of which 2 ms to minimize.
[2023-03-22 16:29:15] [INFO ] Deduced a trap composed of 37 places in 975 ms of which 2 ms to minimize.
[2023-03-22 16:29:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 14915 ms
[2023-03-22 16:29:16] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 1 ms to minimize.
[2023-03-22 16:29:17] [INFO ] Deduced a trap composed of 18 places in 518 ms of which 1 ms to minimize.
[2023-03-22 16:29:17] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 1 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Deduced a trap composed of 18 places in 375 ms of which 5 ms to minimize.
[2023-03-22 16:29:18] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 0 ms to minimize.
[2023-03-22 16:29:19] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 1 ms to minimize.
[2023-03-22 16:29:19] [INFO ] Deduced a trap composed of 32 places in 431 ms of which 1 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Deduced a trap composed of 26 places in 400 ms of which 0 ms to minimize.
[2023-03-22 16:29:20] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2023-03-22 16:29:21] [INFO ] Deduced a trap composed of 24 places in 368 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-22 16:29:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:29:21] [INFO ] After 25369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 546 ms.
Support contains 75 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 2103 transition count 1504
Reduce places removed 449 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 451 rules applied. Total rules applied 900 place count 1654 transition count 1502
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 926 place count 1653 transition count 1477
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 951 place count 1628 transition count 1477
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 124 Pre rules applied. Total rules applied 951 place count 1628 transition count 1353
Deduced a syphon composed of 124 places in 3 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 1199 place count 1504 transition count 1353
Discarding 202 places :
Symmetric choice reduction at 4 with 202 rule applications. Total rules 1401 place count 1302 transition count 1151
Iterating global reduction 4 with 202 rules applied. Total rules applied 1603 place count 1302 transition count 1151
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1603 place count 1302 transition count 1076
Deduced a syphon composed of 75 places in 4 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 1753 place count 1227 transition count 1076
Performed 470 Post agglomeration using F-continuation condition.Transition count delta: 470
Deduced a syphon composed of 470 places in 3 ms
Reduce places removed 470 places and 0 transitions.
Iterating global reduction 4 with 940 rules applied. Total rules applied 2693 place count 757 transition count 606
Renaming transitions due to excessive name length > 1024 char.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 2835 place count 686 transition count 640
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2841 place count 686 transition count 634
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2847 place count 680 transition count 634
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 2875 place count 680 transition count 634
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2876 place count 679 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2877 place count 678 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2877 place count 678 transition count 632
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2879 place count 677 transition count 632
Applied a total of 2879 rules in 742 ms. Remains 677 /2103 variables (removed 1426) and now considering 632/1953 (removed 1321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 677/2103 places, 632/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :6
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 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 53 ms. (steps per millisecond=188 ) properties (out of 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 632 rows 677 cols
[2023-03-22 16:29:22] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-22 16:29:22] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:29:23] [INFO ] [Nat]Absence check using 270 positive place invariants in 43 ms returned sat
[2023-03-22 16:29:23] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:23] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-22 16:29:24] [INFO ] After 610ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:24] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 14 ms to minimize.
[2023-03-22 16:29:24] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-22 16:29:24] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-22 16:29:24] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-22 16:29:25] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-22 16:29:25] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2023-03-22 16:29:25] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 16:29:25] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-22 16:29:25] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:29:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1595 ms
[2023-03-22 16:29:26] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-22 16:29:26] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-22 16:29:26] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:29:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2023-03-22 16:29:27] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-22 16:29:27] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-22 16:29:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-03-22 16:29:27] [INFO ] After 3489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 467 ms.
[2023-03-22 16:29:27] [INFO ] After 4718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 162 ms.
Support contains 59 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 632/632 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 677 transition count 628
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 673 transition count 628
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 673 transition count 622
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 667 transition count 622
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 36 place count 659 transition count 614
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 653 transition count 618
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 653 transition count 618
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 652 transition count 617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 651 transition count 617
Applied a total of 51 rules in 234 ms. Remains 651 /677 variables (removed 26) and now considering 617/632 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 651/677 places, 617/632 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 141654 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141654 steps, saw 95365 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 617 rows 651 cols
[2023-03-22 16:29:31] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-22 16:29:31] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:29:31] [INFO ] [Nat]Absence check using 269 positive place invariants in 38 ms returned sat
[2023-03-22 16:29:32] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-22 16:29:33] [INFO ] After 730ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 14 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-22 16:29:33] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-22 16:29:34] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 13 ms to minimize.
[2023-03-22 16:29:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2023-03-22 16:29:34] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-22 16:29:34] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 16:29:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 966 ms
[2023-03-22 16:29:35] [INFO ] After 3127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 663 ms.
[2023-03-22 16:29:36] [INFO ] After 4494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 167 ms.
Support contains 59 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 617/617 transitions.
Applied a total of 0 rules in 35 ms. Remains 651 /651 variables (removed 0) and now considering 617/617 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 651/651 places, 617/617 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 617/617 transitions.
Applied a total of 0 rules in 11 ms. Remains 651 /651 variables (removed 0) and now considering 617/617 (removed 0) transitions.
[2023-03-22 16:29:36] [INFO ] Invariant cache hit.
[2023-03-22 16:29:36] [INFO ] Implicit Places using invariants in 307 ms returned [639]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 650/651 places, 617/617 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 616
Applied a total of 2 rules in 22 ms. Remains 649 /650 variables (removed 1) and now considering 616/617 (removed 1) transitions.
// Phase 1: matrix 616 rows 649 cols
[2023-03-22 16:29:36] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-22 16:29:36] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-22 16:29:36] [INFO ] Invariant cache hit.
[2023-03-22 16:29:37] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-22 16:29:38] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 649/651 places, 616/617 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2420 ms. Remains : 649/651 places, 616/617 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) 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 10000 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 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 148169 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148169 steps, saw 100295 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 16:29:42] [INFO ] Invariant cache hit.
[2023-03-22 16:29:42] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:29:42] [INFO ] [Nat]Absence check using 268 positive place invariants in 111 ms returned sat
[2023-03-22 16:29:43] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-22 16:29:43] [INFO ] After 627ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:44] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-22 16:29:44] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-22 16:29:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2023-03-22 16:29:44] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 16:29:45] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 13 ms to minimize.
[2023-03-22 16:29:45] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-22 16:29:45] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-22 16:29:45] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 21 ms to minimize.
[2023-03-22 16:29:45] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-22 16:29:46] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-22 16:29:46] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-22 16:29:46] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-22 16:29:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1819 ms
[2023-03-22 16:29:46] [INFO ] After 3485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 648 ms.
[2023-03-22 16:29:47] [INFO ] After 5014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 98 ms.
Support contains 59 out of 649 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 616/616 transitions.
Applied a total of 0 rules in 16 ms. Remains 649 /649 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 649/649 places, 616/616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 616/616 transitions.
Applied a total of 0 rules in 14 ms. Remains 649 /649 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-03-22 16:29:47] [INFO ] Invariant cache hit.
[2023-03-22 16:29:47] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 16:29:47] [INFO ] Invariant cache hit.
[2023-03-22 16:29:48] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-22 16:29:49] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
[2023-03-22 16:29:49] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-22 16:29:49] [INFO ] Invariant cache hit.
[2023-03-22 16:29:50] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3071 ms. Remains : 649/649 places, 616/616 transitions.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 95 place count 649 transition count 616
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 649 transition count 613
Applied a total of 98 rules in 32 ms. Remains 649 /649 variables (removed 0) and now considering 613/616 (removed 3) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 613 rows 649 cols
[2023-03-22 16:29:50] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-22 16:29:50] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 16:29:50] [INFO ] [Nat]Absence check using 268 positive place invariants in 59 ms returned sat
[2023-03-22 16:29:51] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:51] [INFO ] State equation strengthened by 86 read => feed constraints.
[2023-03-22 16:29:51] [INFO ] After 554ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:52] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-22 16:29:52] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-22 16:29:52] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-22 16:29:52] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-22 16:29:52] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2023-03-22 16:29:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 811 ms
[2023-03-22 16:29:53] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-22 16:29:53] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2023-03-22 16:29:53] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 14 ms to minimize.
[2023-03-22 16:29:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2023-03-22 16:29:53] [INFO ] After 2225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 389 ms.
[2023-03-22 16:29:53] [INFO ] After 3387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-22 16:29:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-22 16:29:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 649 places, 616 transitions and 2914 arcs took 8 ms.
[2023-03-22 16:29:54] [INFO ] Flatten gal took : 79 ms
Total runtime 61410 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: ShieldIIPt_PT_030B
(NrP: 649 NrTr: 616 NrArc: 2914)

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

net check time: 0m 0.000sec

init dd package: 0m 2.867sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6326532 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099112 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldIIPt-PT-030B"
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 ShieldIIPt-PT-030B, 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 r394-oct2-167903717700303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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