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-167856420200353.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-COL-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:39 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 3.9K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 40K 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-COL-4-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679482314626

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-COL-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 10:51:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 10:51:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:51:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 10:51:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 10:51:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 459 ms
[2023-03-22 10:51:56] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2023-03-22 10:51:56] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 10:51:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 83) seen :35
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Running SMT prover for 48 properties.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 10:51:57] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-22 10:51:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:51:59] [INFO ] After 1395ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:45
[2023-03-22 10:51:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:51:59] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :48 sat :0
Fused 48 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
FORMULA LamportFastMutEx-COL-4-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 10:51:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 10:51:59] [INFO ] Flatten gal took : 14 ms
[2023-03-22 10:51:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA LamportFastMutEx-COL-4-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 10:51:59] [INFO ] Flatten gal took : 3 ms
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 10:51:59] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 23 ms.
[2023-03-22 10:51:59] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Support contains 84 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-22 10:51:59] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2023-03-22 10:51:59] [INFO ] Computed 26 place invariants in 9 ms
[2023-03-22 10:51:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 10:51:59] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2023-03-22 10:51:59] [INFO ] Invariant cache hit.
[2023-03-22 10:51:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:51:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-22 10:51:59] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2023-03-22 10:51:59] [INFO ] Invariant cache hit.
[2023-03-22 10:51:59] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 102/102 places, 180/180 transitions.
Support contains 84 out of 102 places after structural reductions.
[2023-03-22 10:51:59] [INFO ] Flatten gal took : 39 ms
[2023-03-22 10:51:59] [INFO ] Flatten gal took : 32 ms
[2023-03-22 10:51:59] [INFO ] Input system was already deterministic with 180 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 48) seen :20
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-22 10:52:00] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2023-03-22 10:52:00] [INFO ] Invariant cache hit.
[2023-03-22 10:52:00] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2023-03-22 10:52:00] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:25
[2023-03-22 10:52:00] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 10:52:00] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :26 sat :2
[2023-03-22 10:52:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 10:52:00] [INFO ] After 26ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :26 sat :2
[2023-03-22 10:52:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 682 ms
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-22 10:52:01] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-03-22 10:52:02] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:52:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 461 ms
[2023-03-22 10:52:02] [INFO ] After 1193ms SMT Verify possible using trap constraints in natural domain returned unsat :28 sat :0
[2023-03-22 10:52:02] [INFO ] After 1431ms SMT Verify possible using all constraints in natural domain returned unsat :28 sat :0
Fused 28 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 28 atomic propositions for a total of 10 simplifications.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 12 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 12 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 72 out of 102 places (down from 80) after GAL structural reductions.
Computed a total of 1 stabilizing places and 4 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 28 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 10 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 12 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 22 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 180/180 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 98 transition count 176
Applied a total of 8 rules in 16 ms. Remains 98 /102 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 98/102 places, 176/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 8 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 15 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 15 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 16 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 8 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 8 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 8 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 8 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 180/180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Input system was already deterministic with 180 transitions.
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:52:02] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 10:52:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 180 transitions and 768 arcs took 3 ms.
Total runtime 6334 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: 102 NrTr: 180 NrArc: 768)

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

net check time: 0m 0.000sec

init dd package: 0m 2.768sec


RS generation: 0m29.714sec


-> reachability set: #nodes 115836 (1.2e+05) #states 1,914,784 (6)



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

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

abstracting: (0<=0)
states: 1,914,784 (6)
.-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.759sec

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

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

abstracting: (0<=0)
states: 1,914,784 (6)
.
EG iterations: 0
-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [EF [[AX [1<=0] & EG [sum(p93, p92, p91, p90)<=sum(p97, p96, p95, p94)]]]]
normalized: EG [E [true U [EG [sum(p93, p92, p91, p90)<=sum(p97, p96, p95, p94)] & ~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (sum(p93, p92, p91, p90)<=sum(p97, p96, p95, p94))
states: 1,591,064 (6)
........................
EG iterations: 24
.
EG iterations: 1
-> the formula is FALSE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.067sec

checking: EG [sum(p29, p28, p27, p26)<=sum(p3, p2, p1, p0)]
normalized: EG [sum(p29, p28, p27, p26)<=sum(p3, p2, p1, p0)]

abstracting: (sum(p29, p28, p27, p26)<=sum(p3, p2, p1, p0))
states: 1,614,264 (6)
.......................
EG iterations: 23
-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.210sec

checking: EF [AX [EF [EX [~ [sum(p93, p92, p91, p90)<=sum(p3, p2, p1, p0)]]]]]
normalized: E [true U ~ [EX [~ [E [true U EX [~ [sum(p93, p92, p91, p90)<=sum(p3, p2, p1, p0)]]]]]]]

abstracting: (sum(p93, p92, p91, p90)<=sum(p3, p2, p1, p0))
states: 1,599,720 (6)
.
before gc: list nodes free: 1055836

after gc: idd nodes used:559008, unused:63440992; list nodes free:284867040
.-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.862sec

checking: [AF [AX [1<=0]] | AX [EF [EG [sum(p41, p40, p39, p38)<=sum(p69, p68, p67, p66)]]]]
normalized: [~ [EX [~ [E [true U EG [sum(p41, p40, p39, p38)<=sum(p69, p68, p67, p66)]]]]] | ~ [EG [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (sum(p41, p40, p39, p38)<=sum(p69, p68, p67, p66))
states: 1,856,476 (6)
..........................................
EG iterations: 42
.-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.281sec

checking: AG [E [EG [EF [sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)<=sum(p33, p32, p31, p30)]] U AG [EX [0<=0]]]]
normalized: ~ [E [true U ~ [E [EG [E [true U sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)<=sum(p33, p32, p31, p30)]] U ~ [E [true U ~ [EX [0<=0]]]]]]]]

abstracting: (0<=0)
states: 1,914,784 (6)
.abstracting: (sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)<=sum(p33, p32, p31, p30))
states: 188,248 (5)

before gc: list nodes free: 4532256

after gc: idd nodes used:523622, unused:63476378; list nodes free:285025317

EG iterations: 0
-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m52.325sec

checking: AX [~ [E [EG [~ [1<=sum(p101, p100, p99, p98)]] U EG [AG [sum(p97, p96, p95, p94)<=sum(p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70)]]]]]
normalized: ~ [EX [E [EG [~ [1<=sum(p101, p100, p99, p98)]] U EG [~ [E [true U ~ [sum(p97, p96, p95, p94)<=sum(p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70)]]]]]]]

abstracting: (sum(p97, p96, p95, p94)<=sum(p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70))
states: 1,883,964 (6)
.
EG iterations: 1
abstracting: (1<=sum(p101, p100, p99, p98))
states: 448,064 (5)
..........
before gc: list nodes free: 7194768

after gc: idd nodes used:982383, unused:63017617; list nodes free:282993720
.................................................................
EG iterations: 75
.-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m21.565sec

checking: [EX [EG [[[[[100<=sum(p37, p36, p35, p34) & sum(p33, p32, p31, p30)<=79] | ~ [sum(p25, p24, p23, p22)<=sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)]] | sum(p25, p24, p23, p22)<=1] | [sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)<=sum(p69, p68, p67, p66) | AF [sum(p41, p40, p39, p38)<=sum(p3, p2, p1, p0)]]]]] & AG [EX [EF [sum(p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70)<=8]]]]
normalized: [~ [E [true U ~ [EX [E [true U sum(p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70)<=8]]]]] & EX [EG [[[sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)<=sum(p69, p68, p67, p66) | ~ [EG [~ [sum(p41, p40, p39, p38)<=sum(p3, p2, p1, p0)]]]] | [sum(p25, p24, p23, p22)<=1 | [~ [sum(p25, p24, p23, p22)<=sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)] | [100<=sum(p37, p36, p35, p34) & sum(p33, p32, p31, p30)<=79]]]]]]]

abstracting: (sum(p33, p32, p31, p30)<=79)
states: 1,914,784 (6)
abstracting: (100<=sum(p37, p36, p35, p34))
states: 0
abstracting: (sum(p25, p24, p23, p22)<=sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50))
states: 1,869,193 (6)
abstracting: (sum(p25, p24, p23, p22)<=1)
states: 1,889,081 (6)
abstracting: (sum(p41, p40, p39, p38)<=sum(p3, p2, p1, p0))
states: 1,607,140 (6)
..........................
EG iterations: 26
abstracting: (sum(p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50)<=sum(p69, p68, p67, p66))
states: 393,344 (5)
.
EG iterations: 1
.abstracting: (sum(p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70)<=8)
states: 1,885,256 (6)
.-> the formula is TRUE

FORMULA LamportFastMutEx-COL-4-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.482sec

totally nodes used: 248707824 (2.5e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 193604943 1133876177 1327481120
used/not used/entry size/cache size: 66869420 239444 16 1024MB
basic ops cache: hits/miss/sum: 27734849 127286801 155021650
used/not used/entry size/cache size: 13438281 3338935 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 4261170 4261170
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 175099 1102990 1278089
used/not used/entry size/cache size: 348094 8040514 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 28569652
1 23663462
2 10651084
3 3288451
4 768170
5 142587
6 22363
7 2729
8 336
9 30
>= 10 0

Total processing time: 10m 3.379sec


BK_STOP 1679482927182

--------------------
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

113899
iterations count:116925 (649), effective:2995 (16)

initing FirstDep: 0m 0.000sec


iterations count:24544 (136), effective:626 (3)

iterations count:180 (1), effective:0 (0)

iterations count:11676 (64), effective:399 (2)

iterations count:54735 (304), effective:1296 (7)

iterations count:180 (1), effective:0 (0)

iterations count:51051 (283), effective:1241 (6)

iterations count:8973 (49), effective:182 (1)

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-COL-4"
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-COL-4, 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-167856420200353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 ;