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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D3N050-CTLCardinality-00
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-01
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-02
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-03
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-04
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-05
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-06
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-07
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-08
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-09
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-10
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-11
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-12
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-13
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-14
FORMULA_NAME Murphy-COL-D3N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680889132180

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=Murphy-COL-D3N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:38:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 17:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:38:53] [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-04-07 17:38:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:38:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 680 ms
[2023-04-07 17:38:54] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 28.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2023-04-07 17:38:54] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-07 17:38:54] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Murphy-COL-D3N050-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D3N050-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10100 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=146 ) properties (out of 50) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 17:38:54] [INFO ] Computed 2 invariants in 4 ms
[2023-04-07 17:38:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:38:54] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 17:38:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:38:54] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-04-07 17:38:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 17:38:54] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :13
[2023-04-07 17:38:55] [INFO ] Deduced a trap composed of 1 places in 33 ms of which 4 ms to minimize.
[2023-04-07 17:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-07 17:38:55] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 17:38:55] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 11 properties in 32 ms.
Support contains 5 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 7/7 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 6
Applied a total of 1 rules in 7 ms. Remains 6 /6 variables (removed 0) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-04-07 17:38:55] [INFO ] Computed 2 invariants in 0 ms
[2023-04-07 17:38:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 6/6 places, 6/7 transitions.
Incomplete random walk after 10193 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1019 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 17:38:55] [INFO ] Invariant cache hit.
[2023-04-07 17:38:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 17:38:55] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 17:38:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 17:38:55] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:38:55] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:38:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:38:55] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:38:55] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:38:55] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 17:38:55] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 658 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 7 ms.
[2023-04-07 17:38:55] [INFO ] Flatten gal took : 18 ms
[2023-04-07 17:38:55] [INFO ] Flatten gal took : 5 ms
Arc [2:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:38:55] [INFO ] Unfolded HLPN to a Petri net with 24 places and 28 transitions 108 arcs in 5 ms.
[2023-04-07 17:38:55] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 17:38:55] [INFO ] Computed 5 invariants in 2 ms
[2023-04-07 17:38:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-07 17:38:55] [INFO ] Invariant cache hit.
[2023-04-07 17:38:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:38:55] [INFO ] Invariant cache hit.
[2023-04-07 17:38:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:38:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 17:38:55] [INFO ] Invariant cache hit.
[2023-04-07 17:38:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-04-07 17:38:55] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:38:55] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:38:55] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 49) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2023-04-07 17:38:55] [INFO ] Invariant cache hit.
[2023-04-07 17:38:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:38:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-07 17:38:55] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-04-07 17:38:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:38:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:38:55] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2023-04-07 17:38:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:38:55] [INFO ] After 56ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :19
[2023-04-07 17:38:56] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 17:38:56] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 4 properties in 213 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:38:56] [INFO ] Invariant cache hit.
[2023-04-07 17:38:56] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 178390 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178390 steps, saw 121320 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-07 17:38:59] [INFO ] Invariant cache hit.
[2023-04-07 17:38:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:38:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:38:59] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-04-07 17:38:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:38:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:38:59] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-04-07 17:38:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:38:59] [INFO ] After 48ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-04-07 17:38:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-07 17:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-07 17:38:59] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 17:38:59] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 3 properties in 271 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 214014 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214014 steps, saw 145274 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 12 properties.
[2023-04-07 17:39:03] [INFO ] Invariant cache hit.
[2023-04-07 17:39:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:39:03] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:39:03] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 17:39:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:39:03] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 17:39:03] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 17:39:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:39:03] [INFO ] After 43ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 17:39:03] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-07 17:39:03] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 117 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:03] [INFO ] Invariant cache hit.
[2023-04-07 17:39:03] [INFO ] Implicit Places using invariants in 22 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27 ms. Remains : 20/24 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 310955 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310955 steps, saw 211431 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-07 17:39:07] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 17:39:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 17:39:07] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 17:39:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 17:39:07] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 17:39:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:39:07] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 17:39:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2023-04-07 17:39:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 17:39:07] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 17:39:07] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 106 ms.
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:07] [INFO ] Invariant cache hit.
[2023-04-07 17:39:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 17:39:07] [INFO ] Invariant cache hit.
[2023-04-07 17:39:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:39:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 17:39:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:39:07] [INFO ] Invariant cache hit.
[2023-04-07 17:39:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 12 properties.
[2023-04-07 17:39:07] [INFO ] Invariant cache hit.
[2023-04-07 17:39:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 17:39:07] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 17:39:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 17:39:07] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 17:39:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 17:39:07] [INFO ] After 35ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 17:39:07] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 17:39:07] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-04-07 17:39:07] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:39:07] [INFO ] Flatten gal took : 9 ms
[2023-04-07 17:39:07] [INFO ] Input system was already deterministic with 28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 17:39:07] [INFO ] Computed 5 invariants in 1 ms
[2023-04-07 17:39:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 17:39:08] [INFO ] Invariant cache hit.
[2023-04-07 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:39:08] [INFO ] Input system was already deterministic with 28 transitions.
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:39:08] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 17:39:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 0 ms.
Total runtime 14864 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: 24 NrTr: 28 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.722sec


RS generation: 0m15.764sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



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

checking: EG [EX [EG [11<=sum(p3, p2, p1, p0)]]]
normalized: EG [EX [EG [11<=sum(p3, p2, p1, p0)]]]

abstracting: (11<=sum(p3, p2, p1, p0))
states: 540,502,541,382,384 (14)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-COL-D3N050-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m10.998sec

checking: [AG [sum(p23, p22, p21, p20)<=46] & EF [EG [71<=sum(p23, p22, p21, p20)]]]
normalized: [E [true U EG [71<=sum(p23, p22, p21, p20)]] & ~ [E [true U ~ [sum(p23, p22, p21, p20)<=46]]]]

abstracting: (sum(p23, p22, p21, p20)<=46)
states: 540,710,084,330,928 (14)
abstracting: (71<=sum(p23, p22, p21, p20))
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-COL-D3N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: EG [EF [AG [[EG [~ [30<=sum(p23, p22, p21, p20)]] & sum(p7, p6, p5, p4)<=13]]]]
normalized: EG [E [true U ~ [E [true U ~ [[sum(p7, p6, p5, p4)<=13 & EG [~ [30<=sum(p23, p22, p21, p20)]]]]]]]]

abstracting: (30<=sum(p23, p22, p21, p20))
states: 0

EG iterations: 0
abstracting: (sum(p7, p6, p5, p4)<=13)
states: 479,192,495,616 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-COL-D3N050-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m13.866sec

checking: AX [[~ [30<=sum(p23, p22, p21, p20)] & EG [EF [~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]]]]]
normalized: ~ [EX [~ [[EG [E [true U ~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]]] & ~ [30<=sum(p23, p22, p21, p20)]]]]]

abstracting: (30<=sum(p23, p22, p21, p20))
states: 0
abstracting: (sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4))
MC time: 6m40.014sec

checking: AX [[EG [AX [4<=sum(p23, p22, p21, p20)]] | EX [AX [[~ [sum(p15, p14, p13, p12)<=23] | ~ [sum(p19, p18, p17, p16)<=57]]]]]]
normalized: ~ [EX [~ [[EX [~ [EX [~ [[~ [sum(p19, p18, p17, p16)<=57] | ~ [sum(p15, p14, p13, p12)<=23]]]]]] | EG [~ [EX [~ [4<=sum(p23, p22, p21, p20)]]]]]]]]

abstracting: (4<=sum(p23, p22, p21, p20))
states: 488,558,262,925,553 (14)
..
EG iterations: 1
abstracting: (sum(p15, p14, p13, p12)<=23)
states: 540,710,084,330,928 (14)
abstracting: (sum(p19, p18, p17, p16)<=57)
states: 540,710,084,330,928 (14)
...-> the formula is TRUE

FORMULA Murphy-COL-D3N050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.151sec

checking: EG [EX [E [72<=sum(p11, p10, p9, p8) U A [4<=sum(p11, p10, p9, p8) U sum(p3, p2, p1, p0)<=98]]]]
normalized: EG [EX [E [72<=sum(p11, p10, p9, p8) U [~ [EG [~ [sum(p3, p2, p1, p0)<=98]]] & ~ [E [~ [sum(p3, p2, p1, p0)<=98] U [~ [4<=sum(p11, p10, p9, p8)] & ~ [sum(p3, p2, p1, p0)<=98]]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=98)
states: 250,467,974,096,832 (14)
abstracting: (4<=sum(p11, p10, p9, p8))
states: 540,703,476,674,928 (14)
abstracting: (sum(p3, p2, p1, p0)<=98)
states: 250,467,974,096,832 (14)
abstracting: (sum(p3, p2, p1, p0)<=98)
states: 250,467,974,096,832 (14)
.
EG iterations: 1
abstracting: (72<=sum(p11, p10, p9, p8))
MC time: 6m39.000sec

checking: [AX [EG [[[A [sum(p15, p14, p13, p12)<=97 U sum(p11, p10, p9, p8)<=96] | EX [sum(p15, p14, p13, p12)<=sum(p11, p10, p9, p8)]] | [EX [~ [94<=sum(p7, p6, p5, p4)]] | [~ [48<=sum(p11, p10, p9, p8)] | ~ [sum(p23, p22, p21, p20)<=33]]]]]] & AX [sum(p19, p18, p17, p16)<=sum(p7, p6, p5, p4)]]
normalized: [~ [EX [~ [sum(p19, p18, p17, p16)<=sum(p7, p6, p5, p4)]]] & ~ [EX [~ [EG [[[[~ [sum(p23, p22, p21, p20)<=33] | ~ [48<=sum(p11, p10, p9, p8)]] | EX [~ [94<=sum(p7, p6, p5, p4)]]] | [EX [sum(p15, p14, p13, p12)<=sum(p11, p10, p9, p8)] | [~ [EG [~ [sum(p11, p10, p9, p8)<=96]]] & ~ [E [~ [sum(p11, p10, p9, p8)<=96] U [~ [sum(p15, p14, p13, p12)<=97] & ~ [sum(p11, p10, p9, p8)<=96]]]]]]]]]]]]

abstracting: (sum(p11, p10, p9, p8)<=96)
states: 239,156,269,470,432 (14)
abstracting: (sum(p15, p14, p13, p12)<=97)
states: 540,710,084,330,928 (14)
abstracting: (sum(p11, p10, p9, p8)<=96)
states: 239,156,269,470,432 (14)
abstracting: (sum(p11, p10, p9, p8)<=96)
states: 239,156,269,470,432 (14)
.
EG iterations: 1
abstracting: (sum(p15, p14, p13, p12)<=sum(p11, p10, p9, p8))
MC time: 5m42.000sec

checking: [EX [A [~ [sum(p15, p14, p13, p12)<=sum(p11, p10, p9, p8)] U [sum(p7, p6, p5, p4)<=63 | [~ [[sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12) & sum(p3, p2, p1, p0)<=26]] & [~ [54<=sum(p23, p22, p21, p20)] & ~ [69<=sum(p3, p2, p1, p0)]]]]]] | [AG [E [[99<=sum(p23, p22, p21, p20) | sum(p7, p6, p5, p4)<=65] U EX [EG [70<=sum(p23, p22, p21, p20)]]]] & ~ [A [~ [sum(p23, p22, p21, p20)<=sum(p15, p14, p13, p12)] U [sum(p3, p2, p1, p0)<=62 & AX [sum(p23, p22, p21, p20)<=79]]]]]]
normalized: [[~ [[~ [EG [~ [[sum(p3, p2, p1, p0)<=62 & ~ [EX [~ [sum(p23, p22, p21, p20)<=79]]]]]]] & ~ [E [~ [[sum(p3, p2, p1, p0)<=62 & ~ [EX [~ [sum(p23, p22, p21, p20)<=79]]]]] U [sum(p23, p22, p21, p20)<=sum(p15, p14, p13, p12) & ~ [[sum(p3, p2, p1, p0)<=62 & ~ [EX [~ [sum(p23, p22, p21, p20)<=79]]]]]]]]]] & ~ [E [true U ~ [E [[99<=sum(p23, p22, p21, p20) | sum(p7, p6, p5, p4)<=65] U EX [EG [70<=sum(p23, p22, p21, p20)]]]]]]] | EX [[~ [EG [~ [[sum(p7, p6, p5, p4)<=63 | [[~ [69<=sum(p3, p2, p1, p0)] & ~ [54<=sum(p23, p22, p21, p20)]] & ~ [[sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12) & sum(p3, p2, p1, p0)<=26]]]]]]] & ~ [E [~ [[sum(p7, p6, p5, p4)<=63 | [[~ [69<=sum(p3, p2, p1, p0)] & ~ [54<=sum(p23, p22, p21, p20)]] & ~ [[sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12) & sum(p3, p2, p1, p0)<=26]]]]] U [sum(p15, p14, p13, p12)<=sum(p11, p10, p9, p8) & ~ [[sum(p7, p6, p5, p4)<=63 | [[~ [69<=sum(p3, p2, p1, p0)] & ~ [54<=sum(p23, p22, p21, p20)]] & ~ [[sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12) & sum(p3, p2, p1, p0)<=26]]]]]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=26)
states: 4,696,831,241,280 (12)
abstracting: (sum(p3, p2, p1, p0)<=sum(p15, p14, p13, p12))
MC time: 4m53.000sec

checking: [AX [~ [sum(p19, p18, p17, p16)<=85]] | [E [sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20) U AG [[EF [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)] | [A [36<=sum(p19, p18, p17, p16) U 100<=sum(p23, p22, p21, p20)] & AX [71<=sum(p23, p22, p21, p20)]]]]] | ~ [E [sum(p11, p10, p9, p8)<=77 U [[sum(p7, p6, p5, p4)<=sum(p23, p22, p21, p20) & EX [sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16)]] & [sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & 83<=sum(p3, p2, p1, p0)]]]]]]
normalized: [[~ [E [sum(p11, p10, p9, p8)<=77 U [[sum(p7, p6, p5, p4)<=sum(p23, p22, p21, p20) & EX [sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16)]] & [sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & 83<=sum(p3, p2, p1, p0)]]]] | E [sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20) U ~ [E [true U ~ [[[~ [EX [~ [71<=sum(p23, p22, p21, p20)]]] & [~ [EG [~ [100<=sum(p23, p22, p21, p20)]]] & ~ [E [~ [100<=sum(p23, p22, p21, p20)] U [~ [36<=sum(p19, p18, p17, p16)] & ~ [100<=sum(p23, p22, p21, p20)]]]]]] | E [true U sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)]]]]]]] | ~ [EX [sum(p19, p18, p17, p16)<=85]]]

abstracting: (sum(p19, p18, p17, p16)<=85)
states: 540,710,084,330,928 (14)
.abstracting: (sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20))
states: 411,373,567,245,598 (14)
abstracting: (100<=sum(p23, p22, p21, p20))
states: 0
abstracting: (36<=sum(p19, p18, p17, p16))
states: 0
abstracting: (100<=sum(p23, p22, p21, p20))
states: 0
abstracting: (100<=sum(p23, p22, p21, p20))
states: 0

EG iterations: 0
abstracting: (71<=sum(p23, p22, p21, p20))
states: 0
.abstracting: (sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20))
MC time: 4m11.000sec

checking: EX [[[AX [AX [sum(p11, p10, p9, p8)<=99]] | AF [[[sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) & E [sum(p7, p6, p5, p4)<=sum(p19, p18, p17, p16) U sum(p11, p10, p9, p8)<=79]] & [[[sum(p7, p6, p5, p4)<=62 | sum(p15, p14, p13, p12)<=36] | [59<=sum(p23, p22, p21, p20) | sum(p7, p6, p5, p4)<=31]] & sum(p7, p6, p5, p4)<=69]]]] | [sum(p7, p6, p5, p4)<=11 | [sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16) | [[sum(p11, p10, p9, p8)<=sum(p15, p14, p13, p12) & 14<=sum(p11, p10, p9, p8)] & [sum(p3, p2, p1, p0)<=45 & sum(p23, p22, p21, p20)<=24]]]]]]
normalized: EX [[[sum(p7, p6, p5, p4)<=11 | [sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16) | [[sum(p11, p10, p9, p8)<=sum(p15, p14, p13, p12) & 14<=sum(p11, p10, p9, p8)] & [sum(p3, p2, p1, p0)<=45 & sum(p23, p22, p21, p20)<=24]]]] | [~ [EG [~ [[[sum(p7, p6, p5, p4)<=69 & [[59<=sum(p23, p22, p21, p20) | sum(p7, p6, p5, p4)<=31] | [sum(p7, p6, p5, p4)<=62 | sum(p15, p14, p13, p12)<=36]]] & [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) & E [sum(p7, p6, p5, p4)<=sum(p19, p18, p17, p16) U sum(p11, p10, p9, p8)<=79]]]]]] | ~ [EX [EX [~ [sum(p11, p10, p9, p8)<=99]]]]]]]

abstracting: (sum(p11, p10, p9, p8)<=99)
states: 256,141,925,730,432 (14)
..abstracting: (sum(p11, p10, p9, p8)<=79)
MC time: 3m35.000sec

checking: [A [[EG [~ [90<=sum(p19, p18, p17, p16)]] & [~ [AF [21<=sum(p3, p2, p1, p0)]] & AG [~ [[sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)]]]]] U E [sum(p23, p22, p21, p20)<=77 U EF [[sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16) & [sum(p19, p18, p17, p16)<=52 | sum(p15, p14, p13, p12)<=15]]]]] | A [[~ [[~ [sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20)] & 3<=sum(p11, p10, p9, p8)]] & [[~ [[sum(p7, p6, p5, p4)<=sum(p23, p22, p21, p20) | ~ [sum(p3, p2, p1, p0)<=10]]] | EX [75<=sum(p19, p18, p17, p16)]] & AX [83<=sum(p3, p2, p1, p0)]]] U ~ [[47<=sum(p7, p6, p5, p4) | [A [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20) U sum(p23, p22, p21, p20)<=57] & [sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & [99<=sum(p15, p14, p13, p12) | [16<=sum(p3, p2, p1, p0) | [38<=sum(p7, p6, p5, p4) & sum(p19, p18, p17, p16)<=14]]]]]]]]]
normalized: [[~ [EG [[47<=sum(p7, p6, p5, p4) | [[sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & [99<=sum(p15, p14, p13, p12) | [16<=sum(p3, p2, p1, p0) | [38<=sum(p7, p6, p5, p4) & sum(p19, p18, p17, p16)<=14]]]] & [~ [EG [~ [sum(p23, p22, p21, p20)<=57]]] & ~ [E [~ [sum(p23, p22, p21, p20)<=57] U [~ [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)] & ~ [sum(p23, p22, p21, p20)<=57]]]]]]]]] & ~ [E [[47<=sum(p7, p6, p5, p4) | [[sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & [99<=sum(p15, p14, p13, p12) | [16<=sum(p3, p2, p1, p0) | [38<=sum(p7, p6, p5, p4) & sum(p19, p18, p17, p16)<=14]]]] & [~ [EG [~ [sum(p23, p22, p21, p20)<=57]]] & ~ [E [~ [sum(p23, p22, p21, p20)<=57] U [~ [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)] & ~ [sum(p23, p22, p21, p20)<=57]]]]]]] U [~ [[[~ [EX [~ [83<=sum(p3, p2, p1, p0)]]] & [EX [75<=sum(p19, p18, p17, p16)] | ~ [[sum(p7, p6, p5, p4)<=sum(p23, p22, p21, p20) | ~ [sum(p3, p2, p1, p0)<=10]]]]] & ~ [[3<=sum(p11, p10, p9, p8) & ~ [sum(p3, p2, p1, p0)<=sum(p23, p22, p21, p20)]]]]] & [47<=sum(p7, p6, p5, p4) | [[sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & [99<=sum(p15, p14, p13, p12) | [16<=sum(p3, p2, p1, p0) | [38<=sum(p7, p6, p5, p4) & sum(p19, p18, p17, p16)<=14]]]] & [~ [EG [~ [sum(p23, p22, p21, p20)<=57]]] & ~ [E [~ [sum(p23, p22, p21, p20)<=57] U [~ [sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)] & ~ [sum(p23, p22, p21, p20)<=57]]]]]]]]]]] | [~ [EG [~ [E [sum(p23, p22, p21, p20)<=77 U E [true U [sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16) & [sum(p19, p18, p17, p16)<=52 | sum(p15, p14, p13, p12)<=15]]]]]]] & ~ [E [~ [E [sum(p23, p22, p21, p20)<=77 U E [true U [sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16) & [sum(p19, p18, p17, p16)<=52 | sum(p15, p14, p13, p12)<=15]]]]] U [~ [[[~ [E [true U [sum(p3, p2, p1, p0)<=sum(p19, p18, p17, p16) & sum(p19, p18, p17, p16)<=sum(p23, p22, p21, p20)]]] & EG [~ [21<=sum(p3, p2, p1, p0)]]] & EG [~ [90<=sum(p19, p18, p17, p16)]]]] & ~ [E [sum(p23, p22, p21, p20)<=77 U E [true U [sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16) & [sum(p19, p18, p17, p16)<=52 | sum(p15, p14, p13, p12)<=15]]]]]]]]]]

abstracting: (sum(p15, p14, p13, p12)<=15)
states: 540,710,084,330,928 (14)
abstracting: (sum(p19, p18, p17, p16)<=52)
states: 540,710,084,330,928 (14)
abstracting: (sum(p23, p22, p21, p20)<=sum(p19, p18, p17, p16))
states: 181,488,338,490,705 (14)
abstracting: (sum(p23, p22, p21, p20)<=77)
states: 540,710,084,330,928 (14)
abstracting: (90<=sum(p19, p18, p17, p16))
states: 0

EG iterations: 0
abstracting: (21<=sum(p3, p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6485516 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101804 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:20755 (741), effective:4264 (152)

initing FirstDep: 0m 0.000sec


iterations count:398 (14), effective:74 (2)

idd.h:1025: Timeout: after 399 sec


idd.h:1025: Timeout: after 398 sec


idd.h:1025: Timeout: after 341 sec


idd.h:1025: Timeout: after 292 sec


iterations count:48 (1), effective:5 (0)

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

idd.h:1025: Timeout: after 250 sec


idd.h:1025: Timeout: after 214 sec


iterations count:65 (2), effective:10 (0)

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

idd.h:1025: Timeout: after 184 sec

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="Murphy-COL-D3N050"
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 Murphy-COL-D3N050, 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 r522-tall-167987247200305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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