fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420300417
Last Updated
May 14, 2023

About the Execution of Marcie+red for LamportFastMutEx-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9921.855 3600000.00 3632559.00 7150.40 TTTT??TTTTFTTFFT 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-167856420300417.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 LamportFastMutEx-PT-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420300417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K 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 LamportFastMutEx-PT-5-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679494646155

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:17:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 14:17:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:17:27] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-22 14:17:27] [INFO ] Transformed 174 places.
[2023-03-22 14:17:27] [INFO ] Transformed 318 transitions.
[2023-03-22 14:17:27] [INFO ] Found NUPN structural information;
[2023-03-22 14:17:27] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2023-03-22 14:17:27] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 119 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 16 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-22 14:17:27] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 14:17:27] [INFO ] Computed 37 place invariants in 14 ms
[2023-03-22 14:17:28] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-22 14:17:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2023-03-22 14:17:28] [INFO ] Invariant cache hit.
[2023-03-22 14:17:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 14:17:28] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-22 14:17:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2023-03-22 14:17:28] [INFO ] Invariant cache hit.
[2023-03-22 14:17:28] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 137/137 places, 260/260 transitions.
Support contains 119 out of 137 places after structural reductions.
[2023-03-22 14:17:28] [INFO ] Flatten gal took : 46 ms
[2023-03-22 14:17:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 14:17:28] [INFO ] Flatten gal took : 19 ms
[2023-03-22 14:17:28] [INFO ] Input system was already deterministic with 260 transitions.
Support contains 76 out of 137 places (down from 119) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 33) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 14:17:29] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2023-03-22 14:17:29] [INFO ] Invariant cache hit.
[2023-03-22 14:17:29] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 13 ms
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 15 ms
[2023-03-22 14:17:29] [INFO ] Input system was already deterministic with 260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 12 ms
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 13 ms
[2023-03-22 14:17:29] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 27 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 132/137 places, 255/260 transitions.
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 12 ms
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 11 ms
[2023-03-22 14:17:29] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 11 ms
[2023-03-22 14:17:29] [INFO ] Flatten gal took : 11 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 10 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 10 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 133 transition count 256
Applied a total of 8 rules in 13 ms. Remains 133 /137 variables (removed 4) and now considering 256/260 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 133/137 places, 256/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 14 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 9 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 7 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 12 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 8 ms
[2023-03-22 14:17:30] [INFO ] Input system was already deterministic with 260 transitions.
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 7 ms
[2023-03-22 14:17:30] [INFO ] Flatten gal took : 7 ms
[2023-03-22 14:17:30] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 14:17:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 260 transitions and 1120 arcs took 3 ms.
Total runtime 2861 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 137 NrTr: 260 NrArc: 1120)

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

net check time: 0m 0.000sec

init dd package: 0m 2.724sec


RS generation: 0m52.791sec


-> reachability set: #nodes 91817 (9.2e+04) #states 530,682,432 (8)



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

checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 530,682,432 (8)
.-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.548sec

checking: EG [AG [EX [0<=0]]]
normalized: EG [~ [E [true U ~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 530,682,432 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 530,682,432 (8)
.-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [[AG [[p81<=1 & 1<=p81]] | [p130<=0 & 0<=p130]]] | AG [[p100<=1 & 1<=p100]]]
normalized: [~ [E [true U ~ [[p100<=1 & 1<=p100]]]] | EG [[~ [E [true U ~ [[p81<=1 & 1<=p81]]]] | [p130<=0 & 0<=p130]]]]

abstracting: (0<=p130)
states: 530,682,432 (8)
abstracting: (p130<=0)
states: 518,046,848 (8)
abstracting: (1<=p81)
states: 165,866,944 (8)
abstracting: (p81<=1)
states: 530,682,432 (8)
.......................................
before gc: list nodes free: 238570

after gc: idd nodes used:274140, unused:63725860; list nodes free:281909326
........
EG iterations: 47
abstracting: (1<=p100)
states: 158,225,216 (8)
abstracting: (p100<=1)
states: 530,682,432 (8)
-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m32.794sec

checking: EX [AX [[EF [[[p26<=0 & 0<=p26] & [p98<=1 & 1<=p98]]] | [[p55<=0 & 0<=p55] & [p43<=1 & 1<=p43]]]]]
normalized: EX [~ [EX [~ [[[[p43<=1 & 1<=p43] & [p55<=0 & 0<=p55]] | E [true U [[p98<=1 & 1<=p98] & [p26<=0 & 0<=p26]]]]]]]]

abstracting: (0<=p26)
states: 530,682,432 (8)
abstracting: (p26<=0)
states: 398,067,296 (8)
abstracting: (1<=p98)
states: 162,046,080 (8)
abstracting: (p98<=1)
states: 530,682,432 (8)

before gc: list nodes free: 3812918

after gc: idd nodes used:257736, unused:63742264; list nodes free:281987828

before gc: list nodes free: 3447339

after gc: idd nodes used:227987, unused:63772013; list nodes free:282114811
abstracting: (0<=p55)
states: 530,682,432 (8)
abstracting: (p55<=0)
states: 521,993,128 (8)
abstracting: (1<=p43)
states: 14,769,808 (7)
abstracting: (p43<=1)
states: 530,682,432 (8)
..-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m49.503sec

checking: EF [AG [EF [~ [sum(p36, p35, p34, p33, p32)<=sum(p136, p135, p134, p133, p132)]]]]
normalized: E [true U ~ [E [true U ~ [E [true U ~ [sum(p36, p35, p34, p33, p32)<=sum(p136, p135, p134, p133, p132)]]]]]]

abstracting: (sum(p36, p35, p34, p33, p32)<=sum(p136, p135, p134, p133, p132))
states: 451,610,387 (8)

before gc: list nodes free: 4905555

after gc: idd nodes used:538493, unused:63461507; list nodes free:280760984

before gc: list nodes free: 2762715

after gc: idd nodes used:582258, unused:63417742; list nodes free:280568452
-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m35.701sec

checking: AG [AX [EX [EF [~ [sum(p126, p125, p124, p123, p122)<=sum(p51, p50, p49, p48, p47)]]]]]
normalized: ~ [E [true U EX [~ [EX [E [true U ~ [sum(p126, p125, p124, p123, p122)<=sum(p51, p50, p49, p48, p47)]]]]]]]

abstracting: (sum(p126, p125, p124, p123, p122)<=sum(p51, p50, p49, p48, p47))
states: 440,503,707 (8)

before gc: list nodes free: 2145556

after gc: idd nodes used:668573, unused:63331427; list nodes free:280193630

before gc: list nodes free: 4473402

after gc: idd nodes used:695186, unused:63304814; list nodes free:280077473

before gc: list nodes free: 2303540

after gc: idd nodes used:651430, unused:63348570; list nodes free:280266778
..-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m58.352sec

checking: EG [EF [[[p73<=1 & 1<=p73] | [EG [[p52<=0 & 0<=p52]] | [EG [AF [[p53<=0 & 0<=p53]]] & EX [[[p89<=0 & 0<=p89] & [p100<=1 & 1<=p100]]]]]]]]
normalized: EG [E [true U [[[EX [[[p100<=1 & 1<=p100] & [p89<=0 & 0<=p89]]] & EG [~ [EG [~ [[p53<=0 & 0<=p53]]]]]] | EG [[p52<=0 & 0<=p52]]] | [p73<=1 & 1<=p73]]]]

abstracting: (1<=p73)
states: 165,866,944 (8)
abstracting: (p73<=1)
states: 530,682,432 (8)
abstracting: (0<=p52)
states: 530,682,432 (8)
abstracting: (p52<=0)
states: 521,993,128 (8)
.........................
before gc: list nodes free: 626238

after gc: idd nodes used:758858, unused:63241142; list nodes free:279792351
......
EG iterations: 31
abstracting: (0<=p53)
states: 530,682,432 (8)
abstracting: (p53<=0)
states: 521,993,128 (8)
...............................
EG iterations: 31
.
EG iterations: 1
abstracting: (0<=p89)
states: 530,682,432 (8)
abstracting: (p89<=0)
states: 206,590,272 (8)
abstracting: (1<=p100)
states: 158,225,216 (8)
abstracting: (p100<=1)
states: 530,682,432 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m43.771sec

checking: [EF [[EX [AF [[p24<=1 & 1<=p24]]] & AX [1<=0]]] & E [~ [[EX [AX [1<=0]] | [[[p70<=1 & 1<=p70] | ~ [[[p9<=0 & 0<=p9] | [p126<=1 & 1<=p126]]]] & ~ [[p116<=0 & 0<=p116]]]]] U A [EG [[[p49<=0 & 0<=p49] | [p46<=1 & 1<=p46]]] U [AF [[p9<=0 & 0<=p9]] | [p71<=1 & 1<=p71]]]]]
normalized: [E [~ [[[~ [[p116<=0 & 0<=p116]] & [~ [[[p126<=1 & 1<=p126] | [p9<=0 & 0<=p9]]] | [p70<=1 & 1<=p70]]] | EX [~ [EX [~ [1<=0]]]]]] U [~ [EG [~ [[[p71<=1 & 1<=p71] | ~ [EG [~ [[p9<=0 & 0<=p9]]]]]]]] & ~ [E [~ [[[p71<=1 & 1<=p71] | ~ [EG [~ [[p9<=0 & 0<=p9]]]]]] U [~ [EG [[[p46<=1 & 1<=p46] | [p49<=0 & 0<=p49]]]] & ~ [[[p71<=1 & 1<=p71] | ~ [EG [~ [[p9<=0 & 0<=p9]]]]]]]]]]] & E [true U [~ [EX [~ [1<=0]]] & EX [~ [EG [~ [[p24<=1 & 1<=p24]]]]]]]]

abstracting: (1<=p24)
states: 132,615,136 (8)
abstracting: (p24<=1)
states: 530,682,432 (8)
.
EG iterations: 1
.abstracting: (1<=0)
states: 0
.abstracting: (0<=p9)
states: 530,682,432 (8)
abstracting: (p9<=0)
states: 424,545,952 (8)
..............................
EG iterations: 30
abstracting: (1<=p71)
states: 165,866,944 (8)
abstracting: (p71<=1)
states: 530,682,432 (8)
abstracting: (0<=p49)
states: 530,682,432 (8)
abstracting: (p49<=0)
states: 512,811,880 (8)
abstracting: (1<=p46)
states: 14,769,808 (7)
abstracting: (p46<=1)
states: 530,682,432 (8)
........
before gc: list nodes free: 898002

after gc: idd nodes used:1115496, unused:62884504; list nodes free:278171935
............................
EG iterations: 36
abstracting: (0<=p9)
states: 530,682,432 (8)
abstracting: (p9<=0)
states: 424,545,952 (8)
..............................
EG iterations: 30
abstracting: (1<=p71)
states: 165,866,944 (8)
abstracting: (p71<=1)
states: 530,682,432 (8)
abstracting: (0<=p9)
states: 530,682,432 (8)
abstracting: (p9<=0)
states: 424,545,952 (8)
..............................
EG iterations: 30
abstracting: (1<=p71)
states: 165,866,944 (8)
abstracting: (p71<=1)
states: 530,682,432 (8)
........................................
EG iterations: 40
abstracting: (1<=0)
states: 0
..abstracting: (1<=p70)
states: 165,866,944 (8)
abstracting: (p70<=1)
states: 530,682,432 (8)
abstracting: (0<=p9)
states: 530,682,432 (8)
abstracting: (p9<=0)
states: 424,545,952 (8)
abstracting: (1<=p126)
states: 21,021,568 (7)
abstracting: (p126<=1)
states: 530,682,432 (8)
abstracting: (0<=p116)
states: 530,682,432 (8)
abstracting: (p116<=0)
states: 368,636,352 (8)

before gc: list nodes free: 1790352

after gc: idd nodes used:810392, unused:63189608; list nodes free:279566772
-> the formula is FALSE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m10.872sec

checking: A [AF [sum(p121, p120, p119, p118, p117)<=sum(p131, p130, p129, p128, p127)] U EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]]
normalized: [~ [EG [~ [EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]]]] & ~ [E [~ [EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]] U [~ [EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]] & EG [~ [sum(p121, p120, p119, p118, p117)<=sum(p131, p130, p129, p128, p127)]]]]]]

abstracting: (sum(p121, p120, p119, p118, p117)<=sum(p131, p130, p129, p128, p127))
states: 490,165,787 (8)
..................
before gc: list nodes free: 1374292

after gc: idd nodes used:1284740, unused:62715260; list nodes free:277494012
............
EG iterations: 30
abstracting: (sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87))
states: 529,640,547 (8)
.abstracting: (sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87))
states: 529,640,547 (8)
.
before gc: list nodes free: 2709187

after gc: idd nodes used:1279079, unused:62720921; list nodes free:277519421

before gc: list nodes free: 2122600

after gc: idd nodes used:1268081, unused:62731919; list nodes free:277571926

before gc: list nodes free: 3496868

after gc: idd nodes used:1298290, unused:62701710; list nodes free:277443579

before gc: list nodes free: 5388146

after gc: idd nodes used:1320351, unused:62679649; list nodes free:277351239
MC time: 12m43.000sec

checking: E [~ [[[[A [[p2<=1 & 1<=p2] U [p62<=1 & 1<=p62]] | [[p77<=1 & 1<=p77] & [p83<=1 & 1<=p83]]] & [AG [[[p96<=0 & 0<=p96] | [p1<=1 & 1<=p1]]] | AF [[p13<=1 & 1<=p13]]]] | EG [[[[p53<=0 & 0<=p53] | [p34<=1 & 1<=p34]] & [p60<=1 & 1<=p60]]]]] U AX [1<=0]]
normalized: E [~ [[EG [[[p60<=1 & 1<=p60] & [[p34<=1 & 1<=p34] | [p53<=0 & 0<=p53]]]] | [[~ [EG [~ [[p13<=1 & 1<=p13]]]] | ~ [E [true U ~ [[[p1<=1 & 1<=p1] | [p96<=0 & 0<=p96]]]]]] & [[[p83<=1 & 1<=p83] & [p77<=1 & 1<=p77]] | [~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[p2<=1 & 1<=p2]] & ~ [[p62<=1 & 1<=p62]]]]]]]]]] U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p62)
states: 162,046,080 (8)
abstracting: (p62<=1)
states: 530,682,432 (8)
abstracting: (1<=p2)
states: 22,651,312 (7)
abstracting: (p2<=1)
states: 530,682,432 (8)
abstracting: (1<=p62)
states: 162,046,080 (8)
abstracting: (p62<=1)
states: 530,682,432 (8)

before gc: list nodes free: 4765261

after gc: idd nodes used:1034022, unused:62965978; list nodes free:278596977
abstracting: (1<=p62)
states: 162,046,080 (8)
abstracting: (p62<=1)
states: 530,682,432 (8)
........................................
EG iterations: 40
abstracting: (1<=p77)
states: 165,866,944 (8)
abstracting: (p77<=1)
states: 530,682,432 (8)
abstracting: (1<=p83)
states: 165,866,944 (8)
abstracting: (p83<=1)
states: 530,682,432 (8)
abstracting: (0<=p96)
states: 530,682,432 (8)
abstracting: (p96<=0)
states: 372,457,216 (8)
abstracting: (1<=p1)
states: 22,651,312 (7)
abstracting: (p1<=1)
states: 530,682,432 (8)

before gc: list nodes free: 860734

after gc: idd nodes used:1237353, unused:62762647; list nodes free:277716327

before gc: list nodes free: 4022690

after gc: idd nodes used:1242216, unused:62757784; list nodes free:277695773
abstracting: (1<=p13)
states: 85,094,720 (7)
abstracting: (p13<=1)
states: 530,682,432 (8)
................
before gc: list nodes free: 1536868

after gc: idd nodes used:1576487, unused:62423513; list nodes free:276251607
......................
EG iterations: 38
abstracting: (0<=p53)
states: 530,682,432 (8)
abstracting: (p53<=0)
states: 521,993,128 (8)
abstracting: (1<=p34)
states: 19,661,248 (7)
abstracting: (p34<=1)
states: 530,682,432 (8)
abstracting: (1<=p60)
states: 11,240,656 (7)
abstracting: (p60<=1)
states: 530,682,432 (8)
.....................................
EG iterations: 37
-> the formula is FALSE

FORMULA LamportFastMutEx-PT-5-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m 1.653sec

checking: AF [EG [[[sum(p46, p45, p44, p43, p42)<=sum(p91, p90, p89, p88, p87) & ~ [15<=sum(p56, p55, p54, p53, p52)]] & [sum(p36, p35, p34, p33, p32)<=19 & sum(p4, p3, p2, p1, p0)<=sum(p31, p30, p29, p28, p27)]]]]
normalized: ~ [EG [~ [EG [[[sum(p46, p45, p44, p43, p42)<=sum(p91, p90, p89, p88, p87) & ~ [15<=sum(p56, p55, p54, p53, p52)]] & [sum(p36, p35, p34, p33, p32)<=19 & sum(p4, p3, p2, p1, p0)<=sum(p31, p30, p29, p28, p27)]]]]]]

abstracting: (sum(p4, p3, p2, p1, p0)<=sum(p31, p30, p29, p28, p27))
states: 435,774,641 (8)
abstracting: (sum(p36, p35, p34, p33, p32)<=19)
states: 530,682,432 (8)
abstracting: (15<=sum(p56, p55, p54, p53, p52))
states: 0
abstracting: (sum(p46, p45, p44, p43, p42)<=sum(p91, p90, p89, p88, p87))
states: 529,336,102 (8)
.....
before gc: list nodes free: 799210

after gc: idd nodes used:2346195, unused:61653805; list nodes free:272791133
......
before gc: list nodes free: 1434832

after gc: idd nodes used:3706076, unused:60293924; list nodes free:268826532
....
before gc: list nodes free: 1694244

after gc: idd nodes used:3306275, unused:60693725; list nodes free:270708866
.MC time: 8m42.049sec

checking: A [AF [sum(p121, p120, p119, p118, p117)<=sum(p131, p130, p129, p128, p127)] U EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]]
normalized: [~ [EG [~ [EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]]]] & ~ [E [~ [EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]] U [EG [~ [sum(p121, p120, p119, p118, p117)<=sum(p131, p130, p129, p128, p127)]] & ~ [EX [~ [sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87)]]]]]]]

abstracting: (sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87))
states: 529,640,547 (8)
.abstracting: (sum(p121, p120, p119, p118, p117)<=sum(p131, p130, p129, p128, p127))
states: 490,165,787 (8)
..........
before gc: list nodes free: 1558142

after gc: idd nodes used:1916508, unused:62083492; list nodes free:276817859
....................
EG iterations: 30
abstracting: (sum(p121, p120, p119, p118, p117)<=sum(p91, p90, p89, p88, p87))
states: 529,640,547 (8)
.
before gc: list nodes free: 4060456

after gc: idd nodes used:1670204, unused:62329796; list nodes free:277911491

before gc: list nodes free: 3909849

after gc: idd nodes used:1692661, unused:62307339; list nodes free:277821726
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6227404 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101972 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 CTLCardinality -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.000sec

16768 20016 54756 87642 99037 96963
iterations count:667077 (2565), effective:13031 (50)

initing FirstDep: 0m 0.000sec


iterations count:35763 (137), effective:732 (2)

iterations count:46507 (178), effective:778 (2)
89845
iterations count:140439 (540), effective:2728 (10)
184666
iterations count:183352 (705), effective:3948 (15)

iterations count:260 (1), effective:0 (0)
152904
iterations count:145617 (560), effective:2977 (11)

iterations count:1644 (6), effective:20 (0)

iterations count:13197 (50), effective:213 (0)

iterations count:30046 (115), effective:551 (2)
217698 246572 238042 256219
sat_reach.icc:155: Timeout: after 762 sec


iterations count:315 (1), effective:1 (0)
96570
iterations count:130222 (500), effective:2455 (9)

net_ddint.h:600: Timeout: after 521 sec

217698 246572

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="LamportFastMutEx-PT-5"
export BK_EXAMINATION="CTLCardinality"
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 LamportFastMutEx-PT-5, examination is CTLCardinality"
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-167856420300417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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