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.r010-oct2-167813598600110.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 ASLink-PT-07a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 677K Mar 5 18:22 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 ASLink-PT-07a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-07a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678666665038

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 00:17:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:17:47] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-13 00:17:47] [INFO ] Transformed 1601 places.
[2023-03-13 00:17:47] [INFO ] Transformed 2373 transitions.
[2023-03-13 00:17:47] [INFO ] Found NUPN structural information;
[2023-03-13 00:17:47] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA ASLink-PT-07a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 53 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 11) seen :7
FORMULA ASLink-PT-07a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2348 rows 1601 cols
[2023-03-13 00:17:48] [INFO ] Computed 308 place invariants in 83 ms
[2023-03-13 00:17:48] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:17:49] [INFO ] [Nat]Absence check using 75 positive place invariants in 21 ms returned sat
[2023-03-13 00:17:49] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 63 ms returned sat
[2023-03-13 00:18:13] [INFO ] After 24477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:18:13] [INFO ] After 24488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 00:18:13] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 62 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 171 rules applied. Total rules applied 171 place count 1559 transition count 2219
Reduce places removed 129 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 134 rules applied. Total rules applied 305 place count 1430 transition count 2214
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 310 place count 1425 transition count 2214
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 310 place count 1425 transition count 2074
Deduced a syphon composed of 140 places in 3 ms
Ensure Unique test removed 50 places
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 640 place count 1235 transition count 2074
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 1 rules applied. Total rules applied 641 place count 1235 transition count 2073
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 642 place count 1234 transition count 2073
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 652 place count 1224 transition count 2020
Ensure Unique test removed 1 places
Iterating global reduction 5 with 11 rules applied. Total rules applied 663 place count 1223 transition count 2020
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 669 place count 1222 transition count 2015
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 672 place count 1219 transition count 2015
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 673 place count 1218 transition count 2007
Iterating global reduction 7 with 1 rules applied. Total rules applied 674 place count 1218 transition count 2007
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 675 place count 1217 transition count 1999
Iterating global reduction 7 with 1 rules applied. Total rules applied 676 place count 1217 transition count 1999
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 677 place count 1216 transition count 1991
Iterating global reduction 7 with 1 rules applied. Total rules applied 678 place count 1216 transition count 1991
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 679 place count 1215 transition count 1983
Iterating global reduction 7 with 1 rules applied. Total rules applied 680 place count 1215 transition count 1983
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 681 place count 1214 transition count 1975
Iterating global reduction 7 with 1 rules applied. Total rules applied 682 place count 1214 transition count 1975
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 683 place count 1213 transition count 1967
Iterating global reduction 7 with 1 rules applied. Total rules applied 684 place count 1213 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 685 place count 1212 transition count 1959
Iterating global reduction 7 with 1 rules applied. Total rules applied 686 place count 1212 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 687 place count 1211 transition count 1951
Iterating global reduction 7 with 1 rules applied. Total rules applied 688 place count 1211 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 689 place count 1210 transition count 1943
Iterating global reduction 7 with 1 rules applied. Total rules applied 690 place count 1210 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 691 place count 1209 transition count 1935
Iterating global reduction 7 with 1 rules applied. Total rules applied 692 place count 1209 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 693 place count 1208 transition count 1927
Iterating global reduction 7 with 1 rules applied. Total rules applied 694 place count 1208 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 695 place count 1207 transition count 1919
Iterating global reduction 7 with 1 rules applied. Total rules applied 696 place count 1207 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 697 place count 1206 transition count 1911
Iterating global reduction 7 with 1 rules applied. Total rules applied 698 place count 1206 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 699 place count 1205 transition count 1903
Iterating global reduction 7 with 1 rules applied. Total rules applied 700 place count 1205 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 701 place count 1204 transition count 1895
Iterating global reduction 7 with 1 rules applied. Total rules applied 702 place count 1204 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 703 place count 1203 transition count 1887
Iterating global reduction 7 with 1 rules applied. Total rules applied 704 place count 1203 transition count 1887
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 5 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 790 place count 1160 transition count 1844
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 791 place count 1160 transition count 1843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 792 place count 1159 transition count 1843
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 797 place count 1159 transition count 1838
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 802 place count 1154 transition count 1838
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 812 place count 1154 transition count 1838
Applied a total of 812 rules in 1468 ms. Remains 1154 /1601 variables (removed 447) and now considering 1838/2348 (removed 510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1469 ms. Remains : 1154/1601 places, 1838/2348 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 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 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 170530 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170530 steps, saw 57396 distinct states, run finished after 3005 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1838 rows 1154 cols
[2023-03-13 00:18:18] [INFO ] Computed 214 place invariants in 40 ms
[2023-03-13 00:18:19] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:18:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-13 00:18:19] [INFO ] [Nat]Absence check using 55 positive and 159 generalized place invariants in 40 ms returned sat
[2023-03-13 00:18:44] [INFO ] After 24720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:18:44] [INFO ] State equation strengthened by 41 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-13 00:18:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:18:44] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 1154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1154/1154 places, 1838/1838 transitions.
Applied a total of 0 rules in 38 ms. Remains 1154 /1154 variables (removed 0) and now considering 1838/1838 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1154/1154 places, 1838/1838 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1154/1154 places, 1838/1838 transitions.
Applied a total of 0 rules in 75 ms. Remains 1154 /1154 variables (removed 0) and now considering 1838/1838 (removed 0) transitions.
[2023-03-13 00:18:44] [INFO ] Invariant cache hit.
[2023-03-13 00:18:45] [INFO ] Implicit Places using invariants in 892 ms returned [1, 19, 20, 22, 32, 50, 68, 128, 154, 167, 168, 169, 170, 171, 189, 207, 289, 302, 304, 305, 306, 324, 342, 383, 428, 441, 442, 443, 444, 445, 463, 481, 550, 564, 579, 580, 581, 582, 583, 601, 619, 671, 717, 718, 719, 720, 721, 739, 757, 819, 830, 842, 855, 858, 859, 860, 896, 949, 980, 985, 996, 997, 998, 999, 1000, 1018, 1020, 1023, 1041, 1042, 1043, 1044, 1056, 1062, 1069, 1081, 1087, 1093, 1100, 1106, 1112, 1118]
Discarding 82 places :
Implicit Place search using SMT only with invariants took 901 ms to find 82 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1072/1154 places, 1838/1838 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 1072 transition count 1732
Reduce places removed 106 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 115 rules applied. Total rules applied 221 place count 966 transition count 1723
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 230 place count 957 transition count 1723
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 230 place count 957 transition count 1677
Deduced a syphon composed of 46 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 323 place count 910 transition count 1677
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 33 rules applied. Total rules applied 356 place count 894 transition count 1660
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 373 place count 877 transition count 1660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 373 place count 877 transition count 1659
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 375 place count 876 transition count 1659
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 384 place count 867 transition count 1650
Iterating global reduction 5 with 9 rules applied. Total rules applied 393 place count 867 transition count 1650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 395 place count 867 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 396 place count 866 transition count 1647
Iterating global reduction 6 with 1 rules applied. Total rules applied 397 place count 866 transition count 1647
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 523 place count 803 transition count 1584
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 527 place count 799 transition count 1580
Iterating global reduction 6 with 4 rules applied. Total rules applied 531 place count 799 transition count 1580
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 535 place count 799 transition count 1576
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 536 place count 799 transition count 1575
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 542 place count 799 transition count 1569
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 551 place count 793 transition count 1566
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 575 place count 793 transition count 1542
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 600 place count 768 transition count 1542
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 602 place count 768 transition count 1540
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 619 place count 768 transition count 1540
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 621 place count 768 transition count 1540
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 622 place count 768 transition count 1539
Applied a total of 622 rules in 586 ms. Remains 768 /1072 variables (removed 304) and now considering 1539/1838 (removed 299) transitions.
// Phase 1: matrix 1539 rows 768 cols
[2023-03-13 00:18:45] [INFO ] Computed 114 place invariants in 33 ms
[2023-03-13 00:18:46] [INFO ] Implicit Places using invariants in 491 ms returned [73, 90, 104, 106, 117, 118, 188, 195, 198, 200, 204, 211, 212, 287, 293, 295, 299, 302, 307, 308, 360, 378, 385, 388, 393, 457, 487, 489, 491, 499, 569, 580, 587, 594, 595, 650, 682, 688, 689, 752]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 493 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 728/1154 places, 1539/1838 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 718 transition count 1529
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 718 transition count 1529
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 715 transition count 1526
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 715 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 714 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 714 transition count 1525
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 50 place count 703 transition count 1514
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 703 transition count 1500
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 78 place count 689 transition count 1500
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 689 transition count 1496
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 685 transition count 1496
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 685 transition count 1496
Applied a total of 88 rules in 272 ms. Remains 685 /728 variables (removed 43) and now considering 1496/1539 (removed 43) transitions.
// Phase 1: matrix 1496 rows 685 cols
[2023-03-13 00:18:46] [INFO ] Computed 74 place invariants in 32 ms
[2023-03-13 00:18:46] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-13 00:18:46] [INFO ] Invariant cache hit.
[2023-03-13 00:18:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 00:18:48] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 685/1154 places, 1496/1838 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4708 ms. Remains : 685/1154 places, 1496/1838 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 247447 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247447 steps, saw 76555 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:18:52] [INFO ] Invariant cache hit.
[2023-03-13 00:18:52] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:18:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-13 00:18:52] [INFO ] [Nat]Absence check using 18 positive and 56 generalized place invariants in 44 ms returned sat
[2023-03-13 00:19:08] [INFO ] After 16096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:19:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 00:19:13] [INFO ] After 4170ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 00:19:17] [INFO ] After 8640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 00:19:17] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 311 ms.
Support contains 62 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1496/1496 transitions.
Applied a total of 0 rules in 18 ms. Remains 685 /685 variables (removed 0) and now considering 1496/1496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 685/685 places, 1496/1496 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1496/1496 transitions.
Applied a total of 0 rules in 20 ms. Remains 685 /685 variables (removed 0) and now considering 1496/1496 (removed 0) transitions.
[2023-03-13 00:19:17] [INFO ] Invariant cache hit.
[2023-03-13 00:19:18] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-13 00:19:18] [INFO ] Invariant cache hit.
[2023-03-13 00:19:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 00:19:19] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2023-03-13 00:19:19] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-13 00:19:19] [INFO ] Invariant cache hit.
[2023-03-13 00:19:20] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2695 ms. Remains : 685/685 places, 1496/1496 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 685 transition count 1494
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 683 transition count 1494
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 683 transition count 1493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 682 transition count 1493
Applied a total of 6 rules in 45 ms. Remains 682 /685 variables (removed 3) and now considering 1493/1496 (removed 3) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1493 rows 682 cols
[2023-03-13 00:19:20] [INFO ] Computed 74 place invariants in 30 ms
[2023-03-13 00:19:20] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:19:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-13 00:19:20] [INFO ] [Nat]Absence check using 18 positive and 56 generalized place invariants in 22 ms returned sat
[2023-03-13 00:19:37] [INFO ] After 16025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:19:37] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 7 ms to minimize.
[2023-03-13 00:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-13 00:19:43] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2023-03-13 00:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2023-03-13 00:19:44] [INFO ] After 23174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9516 ms.
[2023-03-13 00:19:53] [INFO ] After 32923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 00:19:53] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-13 00:19:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 685 places, 1496 transitions and 6016 arcs took 8 ms.
[2023-03-13 00:19:54] [INFO ] Flatten gal took : 154 ms
Total runtime 126994 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_07a
(NrP: 685 NrTr: 1496 NrArc: 6016)

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

net check time: 0m 0.000sec

init dd package: 0m 2.889sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8193520 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098716 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 ReachabilityCardinality -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.020sec

25016 28235 56969 57815 58952 59073 69297 72237 105709 118302 118999 119167 118807 121060 124694 117955 121432 119162 120765 135586 121469 136384 122639 125096 133587 132227 123261 124372 133270 126977 127791 124301 125663 143813 126569 126842 130764 130091 126196 129362 132773 126347 129373 127298 128207 134675 153509 131079 148931 132225 135944 141461 135335 132269 137755 153893 135008 134068 137348 131045 135169 159077 136788 143360 139235 149181 145061 140523 137880 140124 137419 138703 141983 150200 139802 161938 141421 140233 141083 142145 142150 143512 155169 143178 141792 148333 150906 142806 152817 179607 146049 147645 152093 154306 145902 147370 151297 144650 148669 150382 155025 147038 155857 172157 150434 174477 160684 150319 155630 159595 150452 156214 173182 150679 156442 163008 152212 162515 149025 155719 180371 170603 155417 161964 164439 155577 162602 153570 155617 160625 156234 164605 180704 158215 179779

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="ASLink-PT-07a"
export BK_EXAMINATION="ReachabilityCardinality"
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 ASLink-PT-07a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598600110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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