About the Execution of Marcie+red for ClientsAndServers-PT-N0005P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13854.684 | 1019380.00 | 1032000.00 | 3640.10 | TFFTFTFTTTTFTTFF | 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.r074-smll-167814400000225.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 ClientsAndServers-PT-N0005P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000225
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:26 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.8K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N0005P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0005P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678334175321
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=ClientsAndServers-PT-N0005P0
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 03:56:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 03:56:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:56:19] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-09 03:56:19] [INFO ] Transformed 25 places.
[2023-03-09 03:56:19] [INFO ] Transformed 18 transitions.
[2023-03-09 03:56:19] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 03:56:19] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-09 03:56:19] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 03:56:19] [INFO ] Invariant cache hit.
[2023-03-09 03:56:19] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-09 03:56:19] [INFO ] Invariant cache hit.
[2023-03-09 03:56:19] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-09 03:56:19] [INFO ] Flatten gal took : 32 ms
[2023-03-09 03:56:19] [INFO ] Flatten gal took : 12 ms
[2023-03-09 03:56:19] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 96) seen :54
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 41) 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 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 41) 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 41) 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 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 40) 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 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 40) seen :0
Running SMT prover for 40 properties.
[2023-03-09 03:56:20] [INFO ] Invariant cache hit.
[2023-03-09 03:56:21] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 03:56:21] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 03:56:21] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:31
[2023-03-09 03:56:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 03:56:21] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-09 03:56:21] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :37 sat :3
[2023-03-09 03:56:21] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :37 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 03:56:21] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :37 sat :3
Fused 40 Parikh solutions to 3 different solutions.
Finished Parikh walk after 477 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=119 )
Parikh walk visited 3 properties in 20 ms.
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
[2023-03-09 03:56:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 8 ms
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 7 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 17 transition count 13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Applied a total of 16 rules in 17 ms. Remains 15 /25 variables (removed 10) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 15/25 places, 12/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 17 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 7 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 11/25 places, 8/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 22 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 21 transition count 16
Applied a total of 6 rules in 5 ms. Remains 21 /25 variables (removed 4) and now considering 16/18 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 21/25 places, 16/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:56:21] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 4 ms
[2023-03-09 03:56:21] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:56:21] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-09 03:56:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 2858 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: 25 NrTr: 18 NrArc: 54)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.599sec
RS generation: 1m16.945sec
-> reachability set: #nodes 427155 (4.3e+05) #states 125,510,607,915 (11)
starting MCC model checker
--------------------------
checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.961sec
checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EG [EX [0<=0]] & AG [EG [[~ [p3<=31] | ~ [5<=p18]]]]]
normalized: [~ [E [true U ~ [EG [[~ [5<=p18] | ~ [p3<=31]]]]]] & EG [EX [0<=0]]]
abstracting: (0<=0)
states: 125,510,607,915 (11)
..................................................................................
EG iterations: 81
abstracting: (p3<=31)
states: 125,510,607,915 (11)
abstracting: (5<=p18)
states: 833,246,016 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.917sec
checking: E [[AX [1<=0] | [AX [AX [5<=p18]] | EF [p8<=15]]] U EX [EX [0<=0]]]
normalized: E [[[E [true U p8<=15] | ~ [EX [EX [~ [5<=p18]]]]] | ~ [EX [~ [1<=0]]]] U EX [EX [0<=0]]]
abstracting: (0<=0)
states: 125,510,607,915 (11)
..abstracting: (1<=0)
states: 0
.abstracting: (5<=p18)
states: 833,246,016 (8)
..abstracting: (p8<=15)
states: 115,821,115,817 (11)
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.049sec
checking: AF [AG [[p13<=p11 | [24<=p24 & AX [~ [p13<=9]]]]]]
normalized: ~ [EG [E [true U ~ [[p13<=p11 | [24<=p24 & ~ [EX [p13<=9]]]]]]]]
abstracting: (p13<=9)
states: 125,510,351,120 (11)
.abstracting: (24<=p24)
states: 525,888,099 (8)
abstracting: (p13<=p11)
states: 82,711,009,587 (10)
EG iterations: 0
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.676sec
checking: EF [[AG [~ [23<=p21]] & AF [AX [[p17<=p9 & p22<=14]]]]]
normalized: E [true U [~ [EG [EX [~ [[p17<=p9 & p22<=14]]]]] & ~ [E [true U 23<=p21]]]]
abstracting: (23<=p21)
states: 16,122,336,561 (10)
abstracting: (p22<=14)
states: 124,991,661,333 (11)
abstracting: (p17<=p9)
states: 28,460,078,639 (10)
..................................................................................
EG iterations: 81
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m23.497sec
checking: EF [AX [[AX [1<=0] | [AX [12<=p21] & [p15<=p11 | p3<=p10]]]]]
normalized: E [true U ~ [EX [~ [[[[p15<=p11 | p3<=p10] & ~ [EX [~ [12<=p21]]]] | ~ [EX [~ [1<=0]]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (12<=p21)
states: 83,456,145,344 (10)
.abstracting: (p3<=p10)
states: 82,711,009,587 (10)
abstracting: (p15<=p11)
states: 77,540,467,782 (10)
.-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m24.155sec
checking: AG [[p3<=p0 & [AG [EF [~ [p3<=p1]]] | [EF [~ [14<=p24]] & ~ [5<=p2]]]]]
normalized: ~ [E [true U ~ [[p3<=p0 & [[~ [5<=p2] & E [true U ~ [14<=p24]]] | ~ [E [true U ~ [E [true U ~ [p3<=p1]]]]]]]]]]
abstracting: (p3<=p1)
states: 84,756,451,913 (10)
abstracting: (14<=p24)
states: 16,010,743,056 (10)
abstracting: (5<=p2)
states: 833,246,016 (8)
abstracting: (p3<=p0)
states: 115,743,129,810 (11)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25.795sec
checking: EF [AX [[AX [p0<=p1] & E [~ [[3<=p21 & p13<=p7]] U EG [4<=p18]]]]]
normalized: E [true U ~ [EX [~ [[E [~ [[3<=p21 & p13<=p7]] U EG [4<=p18]] & ~ [EX [~ [p0<=p1]]]]]]]]
abstracting: (p0<=p1)
states: 22,582,149,975 (10)
.abstracting: (4<=p18)
states: 2,711,336,163 (9)
..........................................................................
EG iterations: 74
abstracting: (p13<=p7)
states: 108,781,662,715 (11)
abstracting: (3<=p21)
states: 124,896,404,182 (11)
.-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m35.465sec
checking: AG [EF [[AG [p24<=p11] & E [~ [p14<=p17] U [p15<=p5 & p13<=p19]]]]]
normalized: ~ [E [true U ~ [E [true U [E [~ [p14<=p17] U [p15<=p5 & p13<=p19]] & ~ [E [true U ~ [p24<=p11]]]]]]]]
abstracting: (p24<=p11)
states: 18,895,572,454 (10)
abstracting: (p13<=p19)
states: 111,275,602,163 (11)
abstracting: (p15<=p5)
states: 106,280,460,440 (11)
abstracting: (p14<=p17)
states: 682,547,424 (8)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m50.766sec
checking: [AG [A [p12<=p8 U [E [[p11<=p6 | 23<=p2] U EG [p18<=9]] & AX [EF [7<=p17]]]]] & AX [[AF [~ [p19<=p5]] | EF [~ [p22<=p16]]]]]
normalized: [~ [EX [~ [[E [true U ~ [p22<=p16]] | ~ [EG [p19<=p5]]]]]] & ~ [E [true U ~ [[~ [EG [~ [[~ [EX [~ [E [true U 7<=p17]]]] & E [[p11<=p6 | 23<=p2] U EG [p18<=9]]]]]] & ~ [E [~ [[~ [EX [~ [E [true U 7<=p17]]]] & E [[p11<=p6 | 23<=p2] U EG [p18<=9]]]] U [~ [p12<=p8] & ~ [[~ [EX [~ [E [true U 7<=p17]]]] & E [[p11<=p6 | 23<=p2] U EG [p18<=9]]]]]]]]]]]]
abstracting: (p18<=9)
states: 125,510,524,832 (11)
.
EG iterations: 1
abstracting: (23<=p2)
states: 0
abstracting: (p11<=p6)
states: 87,560,491,353 (10)
abstracting: (7<=p17)
states: 5,286,484,248 (9)
.abstracting: (p12<=p8)
states: 117,867,900,931 (11)
abstracting: (p18<=9)
states: 125,510,524,832 (11)
.
EG iterations: 1
abstracting: (23<=p2)
states: 0
abstracting: (p11<=p6)
states: 87,560,491,353 (10)
abstracting: (7<=p17)
states: 5,286,484,248 (9)
.abstracting: (p18<=9)
states: 125,510,524,832 (11)
.
EG iterations: 1
abstracting: (23<=p2)
states: 0
abstracting: (p11<=p6)
states: 87,560,491,353 (10)
abstracting: (7<=p17)
states: 5,286,484,248 (9)
..
EG iterations: 1
abstracting: (p19<=p5)
states: 70,220,264,422 (10)
before gc: list nodes free: 700122
after gc: idd nodes used:6028928, unused:57971072; list nodes free:472048691
..............................................................
EG iterations: 62
abstracting: (p22<=p16)
states: 37,324,980,055 (10)
.-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m32.484sec
checking: EF [[AG [[39<=p8 & E [EG [p8<=p3] U [p22<=p10 & p22<=32]]]] & [E [E [AF [p22<=6] U p24<=p13] U ~ [[p20<=p2 & p18<=24]]] | [8<=p11 | [E [[p11<=p8 | p5<=p10] U ~ [p8<=14]] & p14<=p19]]]]]
normalized: E [true U [[[8<=p11 | [p14<=p19 & E [[p11<=p8 | p5<=p10] U ~ [p8<=14]]]] | E [E [~ [EG [~ [p22<=6]]] U p24<=p13] U ~ [[p20<=p2 & p18<=24]]]] & ~ [E [true U ~ [[39<=p8 & E [EG [p8<=p3] U [p22<=p10 & p22<=32]]]]]]]]
abstracting: (p22<=32)
states: 125,510,607,915 (11)
abstracting: (p22<=p10)
states: 35,759,667,031 (10)
abstracting: (p8<=p3)
states: 20,535,413,206 (10)
.......................................................................................................................................................................................................................................................................................................................................................
EG iterations: 343
abstracting: (39<=p8)
states: 18
abstracting: (p18<=24)
states: 125,510,607,915 (11)
abstracting: (p20<=p2)
states: 82,711,848,117 (10)
abstracting: (p24<=p13)
states: 20,535,413,206 (10)
abstracting: (p22<=6)
states: 102,663,034,397 (11)
....................................................................
EG iterations: 68
abstracting: (p8<=14)
states: 112,936,182,975 (11)
abstracting: (p5<=p10)
states: 35,759,667,031 (10)
abstracting: (p11<=p8)
states: 117,867,900,931 (11)
abstracting: (p14<=p19)
states: 682,364,472 (8)
abstracting: (8<=p11)
states: 9,327,318 (6)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P0-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m26.405sec
totally nodes used: 104099565 (1.0e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 1160597078 424018043 1584615121
used/not used/entry size/cache size: 62324591 4784273 16 1024MB
basic ops cache: hits/miss/sum: 326389321 148525200 474914521
used/not used/entry size/cache size: 16697729 79487 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 29832830 9735877 39568707
used/not used/entry size/cache size: 3501594 4887014 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 35830313
1 21552764
2 7002654
3 1808693
4 486094
5 175460
6 86546
7 55840
8 36829
9 25262
>= 10 48409
Total processing time: 16m51.667sec
BK_STOP 1678335194701
--------------------
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
iterations count:5070 (281), effective:1104 (61)
initing FirstDep: 0m 0.000sec
iterations count:584 (32), effective:124 (6)
iterations count:934 (51), effective:201 (11)
iterations count:18 (1), effective:0 (0)
iterations count:146 (8), effective:23 (1)
iterations count:1238 (68), effective:284 (15)
iterations count:1569 (87), effective:327 (18)
iterations count:975 (54), effective:246 (13)
iterations count:110 (6), effective:23 (1)
iterations count:1613 (89), effective:339 (18)
iterations count:234 (13), effective:27 (1)
iterations count:1327 (73), effective:304 (16)
iterations count:1220 (67), effective:450 (25)
iterations count:1847 (102), effective:464 (25)
iterations count:197 (10), effective:45 (2)
iterations count:558 (31), effective:130 (7)
iterations count:2013 (111), effective:429 (23)
iterations count:1559 (86), effective:321 (17)
iterations count:23 (1), effective:1 (0)
iterations count:445 (24), effective:77 (4)
iterations count:23 (1), effective:1 (0)
iterations count:445 (24), effective:77 (4)
iterations count:23 (1), effective:1 (0)
iterations count:445 (24), effective:77 (4)
iterations count:199 (11), effective:48 (2)
iterations count:58 (3), effective:20 (1)
iterations count:46 (2), effective:5 (0)
iterations count:338 (18), effective:40 (2)
iterations count:226 (12), effective:34 (1)
iterations count:608 (33), effective:125 (6)
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="ClientsAndServers-PT-N0005P0"
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 ClientsAndServers-PT-N0005P0, 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 r074-smll-167814400000225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0005P0.tgz
mv ClientsAndServers-PT-N0005P0 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 '
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 ;