fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r221su-smll-146468027700466
Last Updated
June 30, 2016

About the Execution of Marcie for GPPP-PT-C0001N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14610.520 1741179.00 1740990.00 30.00 FTTTTTTFTTFTFTFT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........................................................
=====================================================================
Generated by BenchKit 2-2979
Executing tool marcie
Input is GPPP-PT-C0001N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027700466
=====================================================================


--------------------
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 GPPP-PT-C0001N0000001000-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1465036066644


Marcie rev. 8535M (built: crohr on 2016-04-27)
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: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)

net check time: 0m 0.000sec

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

init dd package: 0m 3.808sec


RS generation: 0m12.354sec


-> reachability set: #nodes 4058 (4.1e+03) #states 14,353,505,166 (10)



starting MCC model checker
--------------------------

checking: EF [3<=_2PG]
normalized: E [true U 3<=_2PG]

abstracting: (3<=_2PG) states: 875,311,437 (8)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.627sec

checking: EF [3<=Pyr]
normalized: E [true U 3<=Pyr]

abstracting: (3<=Pyr) states: 875,311,437 (8)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.644sec

checking: EF [~ [2<=NADPplus]]
normalized: E [true U ~ [2<=NADPplus]]

abstracting: (2<=NADPplus) states: 14,339,158,834 (10)

before gc: list nodes free: 1551302

after gc: idd nodes used:6111, unused:63993889; list nodes free:541005860
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m 7.910sec

checking: EF [3<=_1_3_BPG]
normalized: E [true U 3<=_1_3_BPG]

abstracting: (3<=_1_3_BPG) states: 875,311,437 (8)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.830sec

checking: EF [~ [~ [GSSG<=Pyr]]]
normalized: E [true U GSSG<=Pyr]

abstracting: (GSSG<=Pyr) states: 24,072,030 (7)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m53.425sec

checking: AG [_3PG<=ADP]
normalized: ~ [E [true U ~ [_3PG<=ADP]]]

abstracting: (_3PG<=ADP) states: 14,353,505,166 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [b1<=NADPplus]
normalized: ~ [E [true U ~ [b1<=NADPplus]]]

abstracting: (b1<=NADPplus) states: 14,332,962,644 (10)

before gc: list nodes free: 2367502

after gc: idd nodes used:7064, unused:63992936; list nodes free:603915170
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m14.537sec

checking: AG [[3<=ATP & [PEP<=a1 | 3<=Pi]]]
normalized: ~ [E [true U ~ [[3<=ATP & [PEP<=a1 | 3<=Pi]]]]]

abstracting: (3<=Pi) states: 8,390,571,189 (9)
abstracting: (PEP<=a1) states: 13,297,923,639 (10)
abstracting: (3<=ATP) states: 14,353,505,166 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.930sec

checking: AG [~ [[NADPplus<=Xu5P & ~ [Pi<=_3PG]]]]
normalized: ~ [E [true U [NADPplus<=Xu5P & ~ [Pi<=_3PG]]]]

abstracting: (Pi<=_3PG) states: 3,302,948,649 (9)
abstracting: (NADPplus<=Xu5P) states: 7,611,604 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m43.849sec

checking: AG [~ [[[3<=Pyr | 3<=a1] & [1<=GSSG | 3<=c1]]]]
normalized: ~ [E [true U [[1<=GSSG | 3<=c1] & [3<=Pyr | 3<=a1]]]]

abstracting: (3<=a1) states: 0
abstracting: (3<=Pyr) states: 875,311,437 (8)
abstracting: (3<=c1) states: 11,733,579,858 (10)
abstracting: (1<=GSSG) states: 14,339,166,000 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.670sec

checking: EF [[[~ [NADPH<=NADPplus] | 3<=Xu5P] & ~ [3<=b1]]]
normalized: E [true U [~ [3<=b1] & [3<=Xu5P | ~ [NADPH<=NADPplus]]]]

abstracting: (NADPH<=NADPplus) states: 7,180,339,166 (9)
abstracting: (3<=Xu5P) states: 0
abstracting: (3<=b1) states: 12,538,786,260 (10)

before gc: list nodes free: 88690328

after gc: idd nodes used:7090, unused:63992910; list nodes free:603914533
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m14.868sec

checking: EF [[~ [GSH<=Ru5P] & [~ [1<=Pi] | [ADP<=NADPH & 3<=ATP]]]]
normalized: E [true U [[[ADP<=NADPH & 3<=ATP] | ~ [1<=Pi]] & ~ [GSH<=Ru5P]]]

abstracting: (GSH<=Ru5P) states: 14,379,186 (7)
abstracting: (1<=Pi) states: 12,765,125,373 (10)
abstracting: (3<=ATP) states: 14,353,505,166 (10)
abstracting: (ADP<=NADPH) states: 14,290,961,685 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.654sec

checking: EF [~ [[[PEP<=start | S7P<=PEP] | ADP<=PEP]]]
normalized: E [true U ~ [[ADP<=PEP | [PEP<=start | S7P<=PEP]]]]

abstracting: (S7P<=PEP) states: 14,289,409,134 (10)
abstracting: (PEP<=start) states: 8,280,406,134 (9)
abstracting: (ADP<=PEP) states: 74,111,037 (7)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: EF [[[NADPplus<=b2 | ~ [Pyr<=b1]] & ~ [[1<=Lac & GSSG<=b2]]]]
normalized: E [true U [~ [[1<=Lac & GSSG<=b2]] & [NADPplus<=b2 | ~ [Pyr<=b1]]]]

abstracting: (Pyr<=b1) states: 14,045,043,012 (10)
abstracting: (NADPplus<=b2) states: 8,150,142 (6)
abstracting: (GSSG<=b2) states: 16,292,142 (7)
abstracting: (1<=Lac) states: 6,073,099,032 (9)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.715sec

checking: EF [[[~ [NADplus<=R5P] & [1<=_2PG & Ru5P<=Gluc]] & ~ [[2<=Xu5P | 3<=NADPplus]]]]
normalized: E [true U [~ [[2<=Xu5P | 3<=NADPplus]] & [[1<=_2PG & Ru5P<=Gluc] & ~ [NADplus<=R5P]]]]

abstracting: (NADplus<=R5P) states: 0
abstracting: (Ru5P<=Gluc) states: 13,456,160,718 (10)
abstracting: (1<=_2PG) states: 6,073,099,032 (9)
abstracting: (3<=NADPplus) states: 14,331,985,668 (10)
abstracting: (2<=Xu5P) states: 10,015,005 (7)

before gc: list nodes free: 84636680

after gc: idd nodes used:7506, unused:63992494; list nodes free:603913858
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m14.910sec

checking: EF [[[[b1<=NADplus & b2<=ADP] & [GAP<=NADH & 3<=_2PG]] & 3<=GSSG]]
normalized: E [true U [3<=GSSG & [[GAP<=NADH & 3<=_2PG] & [b1<=NADplus & b2<=ADP]]]]

abstracting: (b2<=ADP) states: 14,353,505,166 (10)
abstracting: (b1<=NADplus) states: 14,353,505,166 (10)
abstracting: (3<=_2PG) states: 875,311,437 (8)
abstracting: (GAP<=NADH) states: 13,213,797,597 (10)
abstracting: (3<=GSSG) states: 14,310,487,668 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.859sec


Total processing time: 29m 0.824sec


BK_STOP 1465037807823

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

check for maximal unmarked siphon
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.001sec

1092 1181 1384 1145 1128 1217 1330 1177 1171 1200 1224 1216 1226 1295 1313 1236 1299 1267 1304 1283 1332 1306 1328 1322 1372 1333 1375 1360 1406 1376 1411 1391 1424 1440 1448 1434 1553 1721 1487 1470 1503 1527 1519 1513 1542 1567 1546 1568 1587 1655 1578 1640 1609 1646 1625 1649 1636 1711 1664 1732 1675 1719 1694 1752 1718 1753 1733 1766 1782 1790 1776 1853 1956 1829 1816 1845 1869 1861 1858 1877 2003 1888 1910 1929 1997 1920 1973 1951 1988 1967 1991 1978 2132 2006 2072 2021 2058 2036 2069 2060 2093 2079 7126 7145 7138 7197 7209 7204 7212 7255 7276 7284 7320 7349 7355 7355 7371 7434 7427 7427 7574 7489 7479 7501 7570 7651 7566 7737 7657 7630 7636 7653 7711 7765 7709 7811 7769 7769 7783 7847 7888 7834 7893 7906 7912 7908 7955 7972 8000 8016 8045 8051 8051 8060 8104
iterations count:155740 (7079), effective:36555 (1661)

initing FirstDep: 0m 0.000sec


iterations count:296 (13), effective:67 (3)

iterations count:289 (13), effective:63 (2)
2088 2076 2108 2153 2133 2188 2123 2129 2126 2155 2156 2173 2187 2188 2207 2183 2196 2187 2222 2225 2246 2249 2242 2266 2247 2263 2254 2286 2287 2311 2316 2295 2315 2307 2330 2318 2350 2359 2375 2385 2358 2371 2368 2397 2398 2415 2429 2430 2449 2431 2438 2429 2464 2467 2488 2491 2484 2508 2489 2505 2496 2528 2555 2567 2611 2537 2613 2549 2572 2560 2592 2601 2617 2627 2600 2613 2610 2639 2640 2657 2671 2672 2691 2669 2680 2674 2706 2709 2730 2733 2736 2750 2731 2747 2738 2770 2796 2792 2849 2783 2848 2791 2814 2802 2834 2843 2859 2869 2842 2855 2852 2881 2882 2898 2906 2914 2929 2911 2922 2916 2948 2951 2972 2975 2978 2992 2973 2989 2980 3012 3013 3034 3045 3025 3059 3033 3056 3044 3076 3085 3101 3111 3084 3097 3094 3123 3122 3140 3148 3167 3171 3153 3161 3158 3190 3193 3214 3265 3220 3285 3215 3228 3352 3254 3255 3276 3287 3267 3301 3275 3295 3286 3318 3327 3343 3353 3326 3339 3336 3362 3350 3382 3390 3402 3413 3395 3403 3400 3429 3432 3456 3504 3462 3521 3457 3470 3461 3496 3497 3520 3529 3509 3543 3517 3537 3528 3560 3561 3585 3590 3568 3589 3578 3604 3592 3624 3632 3644 3655 3639 3645 3642 3671 3674 3698 3703 3704 3723 3699 3712 3703 3738 3741 3762 3771 3758 3785 3759 3779 3770 3802 3803 3827 3832 3811 3831 3820 3846 3834 3866 3913 3886 3951 3881 3887 3884 3913 3916 3958 3945 3946 3965 3941 3954 3945 3980 3983 4004 4013 4000 4027 4005 4021 4012 4044 4045 4069 4074 4053 4073 4061
iterations count:281022 (12773), effective:70000 (3181)

iterations count:296 (13), effective:71 (3)
4373 4107 3140 3117 3121 3115 3126 3100 3117 3106 3119 3110 3135 3116 3145 3144 3180 3195 3170 3174 3168 3183 3160 3170 3159 3172 3163 3188 3169 3198 3197 3215 3209 3223 3227 3211 3236 3213 3223 3212 3225 3216 3241 3222 3251 3250 3268 3262 3276 3326 3264 3289 3266 3276 3265 3281 3264 3294 3275 3304 3303 3321 3315 3329 3383 3317 3342 3317 3321 3318 3334 3317 3347 3328 3357 3354 3374 3368 3382 3383 3370 3395 3370 3374 3371 3387 3370 3400 3381 3410 3407 3427 3428 3435 3436 3416 3488 3423 3427 3424 3440 3423 3453 3434 3463 3460 3480 3481 3483 3489 3469 3547 3476 3480 3474 3493 3476 3506 3487 3516 3538 3533 3534 3536 3542 3522 3549 3533 3533 3527 3546 3529 3562 3554 3569 3592 3586 3587 3589 3600 3575 3602 3580 3586 3580 3599 3584 3615 3609 3622 3619 3639 3640 3649 3653 3624 3655 3633 3639 3633 3652 3769 3668 3662 3675 3672 3692 3736 3691 3706 3677 3708 3686 3692 3686 3708 3692 3721 3715 3728 3725 3743 3792 3744 3759 3730 3764 3739 3745 3739 3761 3745 3774 3768 3781 3778 3796 3797 3797 3812 3783 3817 3792 3798 3792 3814 3798 3827 3823 3834 3839 3849 3850 3850 3910 3835 3870 3845 3854 3845 3867 3851 3880 3876 3887 3892 3919 3903 3903 3968 3888 3923 3898 3907 3898 3920 3904 3933 3929 3940 3945 3958 3956 3956 3967 3941 3976 3951 3960 3951 3973 3957 3986 3985 3994 3998 4011 4015 4009 4020 3994 4060 4004 4013 4004 4026 4010 4039 4038 4047 4051 4064 4068 4062 4073 4047 4120 4057 4066 4057 4079
iterations count:281709 (12804), effective:70660 (3211)
2148 2101 2133 2147 2149 2158 2144 2175 2164 2249 2193 2229 2241 2243 2260 2252 2269 2363 2280 2287 2323 2314 2339 2354 2348 2364 2350 2374 2370 2448 2401 2433 2447 2449 2458 2444 2475 2464 2549 2493 2529 2541 2543 2560 2552 2569 2663 2580 2587 2623 2614 2639 2654 2648 2664 2650 2674 2670 2748 2701 2733 2747 2749 2758 2744 2775 2764 2849 2793 2829 2841 2843 2860 2852 2869 2963 2880 2887 2923 2914 2939 2954 2948 2964 2950 2974 2970 3048 3001 3033 3047 3049 3058 3044 3075 3064 3149 3093 3129 3141 3143 3160 3152 3169 3263 3180 3187 3223 3214 3239 3254 3248 3264 3250 3274 3270 3348 3301 3333 3347 3349 3358 3344 3375 3364 3449 3393 3429 3441 3443 3460 3452 3469 3563 3480 3487 3523 3514 3539 3554 3548 3564 3550 3574 3570 3648 3601 3633 3647 3649 3658 3644 3675 3664 3749 3693 3729 3741 3743 3760 3752 3769 3863 3780 3787 3823 3814 3839 3854 3848 3864 3850 3874 3870 3948 3901 3933 3947 3949 3958 3944 3975 3964 4049 3993 4029 4041 4043 4060 4052 4069 4163 4080
iterations count:193188 (8781), effective:47292 (2149)

iterations count:339 (15), effective:77 (3)
2109 2122 2108 2135 2128 2157 2159 2197 2200 2207 2216 2202 2233 2222 2251 2249 2287 2294 2301 2318 2312 2327 2312 2338 2343 2385 2365 2403 2412 2409 2422 2408 2435 2428 2457 2459 2497 2500 2507 2516 2502 2533 2522 2551 2549 2587 2594 2601 2618 2612 2627 2612 2638 2643 2685 2665 2703 2712 2709 2722 2708 2735 2728 2757 2759 2797 2800 2807 2816 2802 2833 2822 2851 2849 2887 2894 2901 2918 2912 2927 2912 2938 2943 2985 2965 3003 3012 3009 3022 3008 3035 3028 3057 3059 3097 3100 3107 3116 3102 3133 3122 3151 3149 3187 3194 3201 3218 3212 3227 3212 3238 3243 3285 3265 3303 3312 3309 3322 3308 3335 3328 3357 3359 3397 3400 3407 3416 3402 3433 3422 3451 3449 3487 3494 3501 3518 3512 3527 3512 3538 3543 3585 3565 3603 3612 3609 3622 3608 3635 3628 3657 3659 3697 3700 3707 3716 3702 3733 3722 3751 3749 3787 3794 3801 3818 3812 3827 3812 3838 3843 3885 3865 3903 3912 3909 3922 3908 3935 3928 3957 3959 3997 4000 4007 4016 4002 4033 4022 4051 4049 4087 4094 4101
iterations count:193541 (8797), effective:47401 (2154)

iterations count:289 (13), effective:63 (2)
3090 3093 3114 3123 3110 3137 3111 3131 3122 3154 3155 3179 3184 3163 3183 3172 3198 3186 3218 3265 3238 3303 3233 3239 3236 3265 3268 3310 3297 3298 3317 3293 3306 3297 3332 3335 3356 3365 3352 3379 3357 3373 3364 3396 3397 3421 3426 3405 3425 3414 3440 3428 3460 3505 3485 3540 3475 3481 3478 3507 3508 3525 3539 3540 3559 3535 3548 3539 3574 3577 3598 3601 3594 3618 3599 3615 3606 3638 3639 3663 3668 3647 3667 3659 3682 3670 3702 3711 3727 3737 3710 3723 3720 3749 3750 3767 3781 3782 3801 3783 3790 3781 3816 3819 3840 3843 3836 3860 3841 3857 3848 3880 3907 3919 3963 3889 3965 3901 3924 3912 3944 3953 3969 3979 3952 3965 3962 3991 3992 4009 4023 4024 4043 4021 4032 4026 4058 4061 4082 4085 4087
iterations count:141066 (6412), effective:35138 (1597)

iterations count:678 (30), effective:148 (6)

iterations count:987 (44), effective:248 (11)
2289 2282 2264 2295 2291 2335 2311 2356 2365 2385 2373 2359 2390 2379 2400 2413 2451 2447 2464 2469 2454 2487 2470 2495 2496 2537 2542 2559 2570 2589 2582 2564 2595 2591 2635 2611 2656 2665 2685 2673 2659 2690 2679 2700 2713 2751 2747 2764 2769 2754 2787 2770 2795 2796 2837 2842 2859 2870 2889 2882 2864 2895 2891 2935 2911 2956 2965 2985 2973 2959 2990 2979 3000 3013 3051 3047 3064 3069 3054 3087 3070 3095 3096 3137 3142 3159 3170 3189 3182 3164 3195 3191 3235 3211 3256 3265 3285 3273 3259 3290 3279 3300 3313 3351 3347 3364 3369 3354 3387 3370 3395 3396 3437 3442 3459 3470 3489 3482 3464 3495 3491 3535 3511 3556 3565 3585 3573 3559 3590 3579 3600 3613 3651 3647 3664 3669 3654 3687 3670 3695 3696 3737 3742 3759 3770 3789 3782 3764 3795 3791 3835 3811 3856 3865 3885 3873 3859 3890 3879 3900 3913 3951 3947 3964 3969 3954 3987 3970 3995 3996 4037 4042 4059 4070 4089 4082 4064 4095 4091 4135 4111 4156 4165 4185 4173 4159 4190 4179 4200 4213 4251 4247 4264
iterations count:193262 (8784), effective:47311 (2150)

iterations count:310 (14), effective:71 (3)

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="GPPP-PT-C0001N0000001000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000001000.tgz
mv GPPP-PT-C0001N0000001000 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is GPPP-PT-C0001N0000001000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r221su-smll-146468027700466"
echo "====================================================================="
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
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 ;