About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6368.796 | 3600000.00 | 3645748.00 | 10131.30 | FFTTTTFFFFTFTTFT | normal |
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.r234-tall-167856420800766.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800766
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679588904913
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=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 16:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 16:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:28:26] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2023-03-23 16:28:26] [INFO ] Transformed 4260 places.
[2023-03-23 16:28:26] [INFO ] Transformed 6027 transitions.
[2023-03-23 16:28:26] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 239 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 32647 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32647 steps, saw 15448 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-23 16:28:30] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2023-03-23 16:28:30] [INFO ] Computed 497 place invariants in 243 ms
[2023-03-23 16:28:32] [INFO ] After 1486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 16:28:33] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2023-03-23 16:28:33] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 202 ms returned sat
[2023-03-23 16:28:41] [INFO ] After 7418ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :2
[2023-03-23 16:28:41] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 16:28:44] [INFO ] After 2919ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :13 sat :2
[2023-03-23 16:28:50] [INFO ] Deduced a trap composed of 666 places in 3671 ms of which 10 ms to minimize.
[2023-03-23 16:28:54] [INFO ] Deduced a trap composed of 1221 places in 3814 ms of which 12 ms to minimize.
[2023-03-23 16:28:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 8042 ms
[2023-03-23 16:28:58] [INFO ] Deduced a trap composed of 322 places in 3560 ms of which 13 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-23 16:28:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 16:28:58] [INFO ] After 25882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 48 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4233 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.16 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions removed 1040 transitions
Trivial Post-agglo rules discarded 1040 transitions
Performed 1040 trivial Post agglomeration. Transition count delta: 1040
Iterating post reduction 0 with 1040 rules applied. Total rules applied 1041 place count 4233 transition count 4987
Reduce places removed 1040 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 1079 rules applied. Total rules applied 2120 place count 3193 transition count 4948
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 2159 place count 3154 transition count 4948
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 2159 place count 3154 transition count 4817
Deduced a syphon composed of 131 places in 4 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 2421 place count 3023 transition count 4817
Discarding 928 places :
Symmetric choice reduction at 3 with 928 rule applications. Total rules 3349 place count 2095 transition count 3889
Iterating global reduction 3 with 928 rules applied. Total rules applied 4277 place count 2095 transition count 3889
Discarding 212 places :
Symmetric choice reduction at 3 with 212 rule applications. Total rules 4489 place count 1883 transition count 3041
Iterating global reduction 3 with 212 rules applied. Total rules applied 4701 place count 1883 transition count 3041
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 4735 place count 1866 transition count 3024
Free-agglomeration rule (complex) applied 176 times.
Iterating global reduction 3 with 176 rules applied. Total rules applied 4911 place count 1866 transition count 3373
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 3 with 176 rules applied. Total rules applied 5087 place count 1690 transition count 3373
Partial Free-agglomeration rule applied 133 times.
Drop transitions removed 133 transitions
Iterating global reduction 4 with 133 rules applied. Total rules applied 5220 place count 1690 transition count 3373
Applied a total of 5220 rules in 1222 ms. Remains 1690 /4260 variables (removed 2570) and now considering 3373/6027 (removed 2654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1223 ms. Remains : 1690/4260 places, 3373/6027 transitions.
Incomplete random walk after 10000 steps, including 380 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 62795 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62795 steps, saw 28143 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 16:29:02] [INFO ] Flow matrix only has 2977 transitions (discarded 396 similar events)
// Phase 1: matrix 2977 rows 1690 cols
[2023-03-23 16:29:02] [INFO ] Computed 470 place invariants in 56 ms
[2023-03-23 16:29:03] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 16:29:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2023-03-23 16:29:03] [INFO ] [Nat]Absence check using 33 positive and 437 generalized place invariants in 94 ms returned sat
[2023-03-23 16:29:04] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 16:29:04] [INFO ] State equation strengthened by 1523 read => feed constraints.
[2023-03-23 16:29:05] [INFO ] After 1030ms SMT Verify possible using 1523 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 16:29:07] [INFO ] Deduced a trap composed of 173 places in 963 ms of which 2 ms to minimize.
[2023-03-23 16:29:08] [INFO ] Deduced a trap composed of 184 places in 1066 ms of which 3 ms to minimize.
[2023-03-23 16:29:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2305 ms
[2023-03-23 16:29:08] [INFO ] After 3940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 526 ms.
[2023-03-23 16:29:09] [INFO ] After 6175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 48 out of 1690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1690/1690 places, 3373/3373 transitions.
Applied a total of 0 rules in 96 ms. Remains 1690 /1690 variables (removed 0) and now considering 3373/3373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1690/1690 places, 3373/3373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1690/1690 places, 3373/3373 transitions.
Applied a total of 0 rules in 96 ms. Remains 1690 /1690 variables (removed 0) and now considering 3373/3373 (removed 0) transitions.
[2023-03-23 16:29:09] [INFO ] Flow matrix only has 2977 transitions (discarded 396 similar events)
[2023-03-23 16:29:09] [INFO ] Invariant cache hit.
[2023-03-23 16:29:12] [INFO ] Implicit Places using invariants in 2639 ms returned [4, 7, 9, 10, 12, 13, 17, 24, 32, 42, 54, 68, 83, 98, 99, 100, 101, 114, 124, 132, 138, 142, 144, 156, 162, 167, 168, 169, 172, 176, 182, 190, 202, 214, 227, 239, 241, 242, 243, 253, 261, 267, 271, 274, 276, 287, 293, 295, 296, 298, 299, 301, 303, 307, 313, 322, 332, 343, 354, 355, 356, 357, 358, 367, 373, 377, 379, 381, 383, 395, 401, 404, 405, 406, 407, 409, 412, 415, 419, 425, 433, 442, 450, 452, 453, 454, 461, 465, 467, 469, 471, 473, 484, 491, 493, 494, 498, 502, 505, 507, 509, 515, 521, 528, 534, 535, 536, 537, 538, 542, 544, 546, 548, 550, 552, 563, 569, 572, 573, 574, 575, 577, 579, 582, 584, 586, 590, 595, 600, 601, 602, 603, 605, 607, 609, 611, 613, 615, 627, 633, 635, 636, 637, 638, 639, 641, 643, 645, 647, 649, 651, 654, 656, 657, 659, 660, 662, 664, 666, 668, 670, 673, 684, 690, 692, 693, 694, 695, 696, 698, 700, 702, 704, 706, 708, 710, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 739, 741, 744, 746, 747, 748, 749, 750, 752, 754, 756, 758, 760, 762, 764, 766, 767, 768, 770, 774, 776, 778, 782, 784, 795, 801, 803, 805, 807, 809, 813, 815, 817, 819, 821, 825, 828, 829, 830, 831, 833, 835, 837, 839, 842, 844, 855, 861, 864, 865, 866, 867, 868, 870, 872, 874, 876, 878, 880, 882, 885, 886, 887, 888, 889, 891, 893, 895, 897, 899, 901, 912, 918, 920, 921, 923, 924, 926, 929, 931, 933, 935, 937, 941, 947, 948, 949, 951, 956, 958, 960, 964, 966, 977, 983, 985, 986, 987, 988, 989, 991, 993, 995, 997, 1000, 1004, 1010, 1017, 1018, 1019, 1020, 1021, 1027, 1031, 1033, 1035, 1037, 1039, 1052, 1058, 1060, 1061, 1062, 1063, 1064, 1066, 1068, 1070, 1072, 1076, 1082, 1090, 1099, 1100, 1101, 1102, 1103, 1111, 1117, 1121, 1123, 1125, 1127, 1138, 1144, 1146, 1147, 1148, 1149, 1150, 1152, 1154, 1156, 1160, 1166, 1174, 1184, 1195, 1196, 1198, 1199, 1210, 1218, 1224, 1228, 1230, 1232, 1246, 1252, 1254, 1255, 1256, 1257, 1258, 1260, 1262, 1266, 1272, 1280, 1290, 1302, 1315, 1316, 1319, 1331, 1341, 1351, 1359, 1363, 1365, 1376, 1378, 1381, 1384, 1385, 1386, 1387, 1388, 1390, 1394, 1400, 1408, 1418, 1431, 1445, 1460, 1461, 1462, 1463, 1464, 1478, 1490, 1500, 1508, 1514, 1518, 1529]
Discarding 404 places :
Implicit Place search using SMT only with invariants took 2653 ms to find 404 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1286/1690 places, 3373/3373 transitions.
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 103 place count 1183 transition count 3270
Iterating global reduction 0 with 103 rules applied. Total rules applied 206 place count 1183 transition count 3270
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 305 place count 1084 transition count 3171
Iterating global reduction 0 with 99 rules applied. Total rules applied 404 place count 1084 transition count 3171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 405 place count 1083 transition count 3167
Iterating global reduction 0 with 1 rules applied. Total rules applied 406 place count 1083 transition count 3167
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 409 place count 1083 transition count 3164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 412 place count 1080 transition count 3164
Applied a total of 412 rules in 247 ms. Remains 1080 /1286 variables (removed 206) and now considering 3164/3373 (removed 209) transitions.
[2023-03-23 16:29:12] [INFO ] Flow matrix only has 2768 transitions (discarded 396 similar events)
// Phase 1: matrix 2768 rows 1080 cols
[2023-03-23 16:29:12] [INFO ] Computed 66 place invariants in 35 ms
[2023-03-23 16:29:13] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-23 16:29:13] [INFO ] Flow matrix only has 2768 transitions (discarded 396 similar events)
[2023-03-23 16:29:13] [INFO ] Invariant cache hit.
[2023-03-23 16:29:13] [INFO ] State equation strengthened by 1520 read => feed constraints.
[2023-03-23 16:29:30] [INFO ] Implicit Places using invariants and state equation in 17672 ms returned []
Implicit Place search using SMT with State Equation took 18605 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1080/1690 places, 3164/3373 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21601 ms. Remains : 1080/1690 places, 3164/3373 transitions.
Incomplete random walk after 10000 steps, including 410 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 41862 steps, run visited all 2 properties in 1704 ms. (steps per millisecond=24 )
Probabilistic random walk after 41862 steps, saw 18030 distinct states, run finished after 1704 ms. (steps per millisecond=24 ) properties seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 66626 ms.
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: MultiCrashLeafsetExtension_PT_S16C04
(NrP: 4260 NrTr: 6027 NrArc: 23774)
parse formulas
formulas created successfully
place and transition orderings generation:0m 3.344sec
net check time: 0m 0.004sec
init dd package: 0m 2.656sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9777072 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095380 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.203sec
37641 79418 120160 153458 170264 170947 180848 234966 363280 521077
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="MultiCrashLeafsetExtension-PT-S16C04"
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 MultiCrashLeafsetExtension-PT-S16C04, 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 r234-tall-167856420800766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 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 '
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 ;