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

About the Execution of LTSMin+red for Murphy-COL-D2N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15892.783 2986750.00 11833475.00 550.80 ?FFFTF?FFT?FT?FF 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.r521-tall-167987246500289.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 ltsminxred
Input is Murphy-COL-D2N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-D2N050-CTLCardinality-00
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-01
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-02
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-03
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-04
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-05
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-06
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-07
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-08
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-09
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-10
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-11
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-12
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-13
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-14
FORMULA_NAME Murphy-COL-D2N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680893315991

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D2N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:48:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:48:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:48:38] [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 18:48:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 18:48:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2023-04-07 18:48:38] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
[2023-04-07 18:48:39] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-07 18:48:39] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-COL-D2N050-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10042 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 63) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 18:48:39] [INFO ] Computed 2 invariants in 4 ms
[2023-04-07 18:48:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:48:39] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-07 18:48:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:48:39] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-07 18:48:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 18:48:39] [INFO ] After 59ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-07 18:48:40] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-04-07 18:48:40] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Finished Parikh walk after 161 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Parikh walk visited 13 properties in 191 ms.
[2023-04-07 18:48:40] [INFO ] Flatten gal took : 14 ms
[2023-04-07 18:48:40] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-07 18:48:40] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 6 ms.
[2023-04-07 18:48:40] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:48:40] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 18:48:41] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
[2023-04-07 18:48:41] [INFO ] Invariant cache hit.
[2023-04-07 18:48:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 18:48:41] [INFO ] Invariant cache hit.
[2023-04-07 18:48:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-04-07 18:48:41] [INFO ] Invariant cache hit.
[2023-04-07 18:48:41] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 18:48:41] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:48:41] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:48:41] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 63) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-04-07 18:48:41] [INFO ] Invariant cache hit.
[2023-04-07 18:48:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 18:48:41] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-04-07 18:48:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:42] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-04-07 18:48:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:42] [INFO ] After 148ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-04-07 18:48:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-07 18:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 18:48:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-07 18:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-07 18:48:42] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-07 18:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:48:42] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-07 18:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 18:48:42] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-04-07 18:48:42] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 1 properties in 486 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:43] [INFO ] Invariant cache hit.
[2023-04-07 18:48:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 176063 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176063 steps, saw 112735 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 31 properties.
[2023-04-07 18:48:46] [INFO ] Invariant cache hit.
[2023-04-07 18:48:46] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2023-04-07 18:48:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:46] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-04-07 18:48:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:48:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:46] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-04-07 18:48:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:46] [INFO ] After 67ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-04-07 18:48:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-07 18:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-04-07 18:48:46] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-04-07 18:48:46] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 0 properties in 415 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:47] [INFO ] Invariant cache hit.
[2023-04-07 18:48:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 18:48:47] [INFO ] Invariant cache hit.
[2023-04-07 18:48:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:47] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 18:48:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:48:47] [INFO ] Invariant cache hit.
[2023-04-07 18:48:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 31 properties.
[2023-04-07 18:48:47] [INFO ] Invariant cache hit.
[2023-04-07 18:48:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:47] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-04-07 18:48:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:48:47] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-04-07 18:48:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:47] [INFO ] After 67ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-04-07 18:48:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-07 18:48:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 18:48:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2023-04-07 18:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 18:48:48] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-04-07 18:48:48] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 16 ms
[2023-04-07 18:48:48] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:48] [INFO ] Invariant cache hit.
[2023-04-07 18:48:48] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:48:48] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:48] [INFO ] Invariant cache hit.
[2023-04-07 18:48:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:48:48] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:48] [INFO ] Invariant cache hit.
[2023-04-07 18:48:48] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:48:48] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:48:48] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:48] [INFO ] Invariant cache hit.
[2023-04-07 18:48:49] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 513 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:48:49] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:48:49] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:48:49] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10045 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2237105 steps, run timeout after 3001 ms. (steps per millisecond=745 ) properties seen :{}
Probabilistic random walk after 2237105 steps, saw 1410546 distinct states, run finished after 3001 ms. (steps per millisecond=745 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:48:52] [INFO ] Invariant cache hit.
[2023-04-07 18:48:52] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:48:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:52] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:48:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:52] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:48:52] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 18:48:52] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:48:52] [INFO ] Invariant cache hit.
[2023-04-07 18:48:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 100049 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=529 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 18:48:52] [INFO ] Invariant cache hit.
[2023-04-07 18:48:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:52] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 18:48:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:48:52] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 18:48:52] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:48:52] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:48:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:52] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:48:52] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:48:52] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 18:48:52] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000033 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4138777 steps, run timeout after 6001 ms. (steps per millisecond=689 ) properties seen :{}
Probabilistic random walk after 4138777 steps, saw 2572001 distinct states, run finished after 6001 ms. (steps per millisecond=689 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:49:00] [INFO ] Invariant cache hit.
[2023-04-07 18:49:00] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:49:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:49:00] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:49:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:49:00] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:49:00] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 18:49:00] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:00] [INFO ] Invariant cache hit.
[2023-04-07 18:49:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 18:49:00] [INFO ] Invariant cache hit.
[2023-04-07 18:49:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:49:01] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-04-07 18:49:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:49:01] [INFO ] Invariant cache hit.
[2023-04-07 18:49:01] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 100050 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=1887 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 18:49:01] [INFO ] Invariant cache hit.
[2023-04-07 18:49:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:49:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:01] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 18:49:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:49:01] [INFO ] After 1ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 18:49:01] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:49:01] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:49:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:49:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:01] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:49:01] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:49:01] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 18:49:01] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2400253 steps, run timeout after 3001 ms. (steps per millisecond=799 ) properties seen :{}
Probabilistic random walk after 2400253 steps, saw 1512438 distinct states, run finished after 3001 ms. (steps per millisecond=799 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:49:04] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:49:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:49:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:04] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:49:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:49:04] [INFO ] After 25ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:49:04] [INFO ] After 29ms 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 18:49:04] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Graph (complete) has 69 edges and 18 vertex of which 9 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 9 transition count 12
Applied a total of 4 rules in 4 ms. Remains 9 /18 variables (removed 9) and now considering 12/21 (removed 9) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-04-07 18:49:04] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 9/18 places, 12/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 216 states, properties seen :0
Probabilistic random walk after 1080 steps, saw 216 distinct states, run finished after 8 ms. (steps per millisecond=135 ) properties seen :0
Explored full state space saw : 216 states, properties seen :0
Exhaustive walk after 1080 steps, saw 216 distinct states, run finished after 3 ms. (steps per millisecond=360 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions using reductions for a total of 1 simplifications.
FORMULA Murphy-COL-D2N050-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:49:04] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [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 33 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:04] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:04] [INFO ] Invariant cache hit.
[2023-04-07 18:49:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:05] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:49:05] [INFO ] Invariant cache hit.
[2023-04-07 18:49:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:49:05] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:05] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:05] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 18:49:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:49:05] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:05] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-04-07 18:49:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 26911 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/654/ctl_0_ --ctl=/tmp/654/ctl_1_ --ctl=/tmp/654/ctl_2_ --ctl=/tmp/654/ctl_3_ --ctl=/tmp/654/ctl_4_ --ctl=/tmp/654/ctl_5_ --ctl=/tmp/654/ctl_6_ --ctl=/tmp/654/ctl_7_ --ctl=/tmp/654/ctl_8_ --ctl=/tmp/654/ctl_9_ --ctl=/tmp/654/ctl_10_ --ctl=/tmp/654/ctl_11_ --ctl=/tmp/654/ctl_12_ --mu-par --mu-opt
Could not compute solution for formula : Murphy-COL-D2N050-CTLCardinality-00
FORMULA Murphy-COL-D2N050-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-COL-D2N050-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-COL-D2N050-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-COL-D2N050-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-COL-D2N050-CTLCardinality-06
FORMULA Murphy-COL-D2N050-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-COL-D2N050-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-COL-D2N050-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-COL-D2N050-CTLCardinality-10
FORMULA Murphy-COL-D2N050-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-COL-D2N050-CTLCardinality-13
FORMULA Murphy-COL-D2N050-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680896302741

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
ctl formula name Murphy-COL-D2N050-CTLCardinality-00
ctl formula formula --ctl=/tmp/654/ctl_0_
ctl formula name Murphy-COL-D2N050-CTLCardinality-01
ctl formula formula --ctl=/tmp/654/ctl_1_
ctl formula name Murphy-COL-D2N050-CTLCardinality-02
ctl formula formula --ctl=/tmp/654/ctl_2_
ctl formula name Murphy-COL-D2N050-CTLCardinality-04
ctl formula formula --ctl=/tmp/654/ctl_3_
ctl formula name Murphy-COL-D2N050-CTLCardinality-05
ctl formula formula --ctl=/tmp/654/ctl_4_
ctl formula name Murphy-COL-D2N050-CTLCardinality-06
ctl formula formula --ctl=/tmp/654/ctl_5_
ctl formula name Murphy-COL-D2N050-CTLCardinality-07
ctl formula formula --ctl=/tmp/654/ctl_6_
ctl formula name Murphy-COL-D2N050-CTLCardinality-08
ctl formula formula --ctl=/tmp/654/ctl_7_
ctl formula name Murphy-COL-D2N050-CTLCardinality-09
ctl formula formula --ctl=/tmp/654/ctl_8_
ctl formula name Murphy-COL-D2N050-CTLCardinality-10
ctl formula formula --ctl=/tmp/654/ctl_9_
ctl formula name Murphy-COL-D2N050-CTLCardinality-11
ctl formula formula --ctl=/tmp/654/ctl_10_
ctl formula name Murphy-COL-D2N050-CTLCardinality-13
ctl formula formula --ctl=/tmp/654/ctl_11_
ctl formula name Murphy-COL-D2N050-CTLCardinality-14
ctl formula formula --ctl=/tmp/654/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 18 places, 21 transitions and 81 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21->9 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 18; there are 9 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 37634 group checks and 0 next state calls
pnml2lts-sym: reachability took 1390.990 real 5049.580 user 496.660 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.100 real 0.380 user 0.000 sys
pnml2lts-sym: state space has 41538421296 states, 199733 nodes
pnml2lts-sym: Formula /tmp/654/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/654/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/654/ctl_4_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/654/ctl_2_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/654/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/654/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/654/ctl_8_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/654/ctl_7_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/654/ctl_10_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
double free or corruption (fasttop)

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-D2N050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Murphy-COL-D2N050, 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 r521-tall-167987246500289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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