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

About the Execution of Marcie+red for BugTracking-PT-q3m128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6936.604 3600000.00 3668619.00 621.00 FFF?FFFFTF??TTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695700370.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BugTracking-PT-q3m128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K Feb 26 07:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 07:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 07:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-00
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-01
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-02
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-03
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-04
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-05
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-06
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-07
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-08
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-09
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-10
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-11
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-12
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-13
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-14
FORMULA_NAME BugTracking-PT-q3m128-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678716679928

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 14:11:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 14:11:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:11:22] [INFO ] Load time of PNML (sax parser for PT used): 812 ms
[2023-03-13 14:11:22] [INFO ] Transformed 754 places.
[2023-03-13 14:11:22] [INFO ] Transformed 27370 transitions.
[2023-03-13 14:11:22] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 957 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 514 places in 107 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 75 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-13 14:11:22] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-13 14:11:22] [INFO ] Computed 8 place invariants in 60 ms
[2023-03-13 14:11:23] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-13 14:11:23] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 14:11:23] [INFO ] Invariant cache hit.
[2023-03-13 14:11:24] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 14:11:26] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 3417 ms to find 0 implicit places.
[2023-03-13 14:11:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 14:11:26] [INFO ] Invariant cache hit.
[2023-03-13 14:11:27] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4498 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 13 out of 237 places after structural reductions.
[2023-03-13 14:11:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-13 14:11:27] [INFO ] Flatten gal took : 244 ms
[2023-03-13 14:11:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m128-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 14:11:27] [INFO ] Flatten gal took : 138 ms
[2023-03-13 14:11:28] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 11 out of 237 places (down from 13) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 151819 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151819 steps, saw 73329 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 14:11:31] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 14:11:31] [INFO ] Invariant cache hit.
[2023-03-13 14:11:32] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 14:11:32] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 14:11:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:11:33] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 14:11:33] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 14:11:34] [INFO ] After 634ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 14:11:34] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 5 ms to minimize.
[2023-03-13 14:11:35] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2023-03-13 14:11:35] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-13 14:11:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 931 ms
[2023-03-13 14:11:35] [INFO ] Deduced a trap composed of 16 places in 343 ms of which 1 ms to minimize.
[2023-03-13 14:11:36] [INFO ] Deduced a trap composed of 20 places in 345 ms of which 1 ms to minimize.
[2023-03-13 14:11:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 828 ms
[2023-03-13 14:11:36] [INFO ] After 2828ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-13 14:11:36] [INFO ] After 3886ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 199 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 158855 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158855 steps, saw 104122 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 14:11:40] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-13 14:11:40] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-13 14:11:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:11:40] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:11:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:11:41] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:11:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:11:41] [INFO ] After 376ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 14:11:42] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 2 ms to minimize.
[2023-03-13 14:11:42] [INFO ] Deduced a trap composed of 25 places in 345 ms of which 2 ms to minimize.
[2023-03-13 14:11:42] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2023-03-13 14:11:43] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 0 ms to minimize.
[2023-03-13 14:11:43] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2023-03-13 14:11:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1651 ms
[2023-03-13 14:11:43] [INFO ] After 2247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-13 14:11:43] [INFO ] After 3129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 103 ms.
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 63 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 45 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-13 14:11:44] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:11:44] [INFO ] Invariant cache hit.
[2023-03-13 14:11:44] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-13 14:11:44] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:11:44] [INFO ] Invariant cache hit.
[2023-03-13 14:11:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:11:46] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2023-03-13 14:11:46] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-13 14:11:46] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:11:46] [INFO ] Invariant cache hit.
[2023-03-13 14:11:47] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3348 ms. Remains : 230/230 places, 2748/2748 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 230 transition count 2618
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 229 transition count 2617
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 229 transition count 2616
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 229 transition count 2611
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 188 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2611 rows 224 cols
[2023-03-13 14:11:47] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-13 14:11:47] [INFO ] [Real]Absence check using 9 positive place invariants in 38 ms returned sat
[2023-03-13 14:11:48] [INFO ] After 682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:11:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 14:11:48] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:11:49] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-13 14:11:49] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2023-03-13 14:11:49] [INFO ] Flatten gal took : 103 ms
[2023-03-13 14:11:49] [INFO ] Flatten gal took : 99 ms
[2023-03-13 14:11:49] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 3 out of 237 places (down from 6) after GAL structural reductions.
Computed a total of 6 stabilizing places and 111 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 114 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:11:50] [INFO ] Flatten gal took : 229 ms
[2023-03-13 14:11:50] [INFO ] Flatten gal took : 218 ms
[2023-03-13 14:11:50] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 197916 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197916 steps, saw 96066 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 14:11:53] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-13 14:11:53] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-13 14:11:53] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-13 14:11:54] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 14:11:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:11:55] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 14:11:55] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 14:11:55] [INFO ] After 206ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 14:11:55] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2023-03-13 14:11:55] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 0 ms to minimize.
[2023-03-13 14:11:56] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 0 ms to minimize.
[2023-03-13 14:11:56] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 0 ms to minimize.
[2023-03-13 14:11:56] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2023-03-13 14:11:56] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2023-03-13 14:11:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1394 ms
[2023-03-13 14:11:56] [INFO ] After 1671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-13 14:11:56] [INFO ] After 2292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 866 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 95 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 1000000 steps, including 661 resets, run finished after 4308 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 109 resets, run finished after 1802 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1065672 steps, run timeout after 18001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 1065672 steps, saw 692705 distinct states, run finished after 18001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 14:12:21] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-13 14:12:21] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-13 14:12:22] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 14:12:22] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 14:12:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 14:12:23] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 14:12:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:12:23] [INFO ] After 171ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 14:12:23] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-13 14:12:23] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 0 ms to minimize.
[2023-03-13 14:12:24] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 0 ms to minimize.
[2023-03-13 14:12:24] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 2 ms to minimize.
[2023-03-13 14:12:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1256 ms
[2023-03-13 14:12:24] [INFO ] After 1504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-13 14:12:24] [INFO ] After 2131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1709 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 38 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 37 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-13 14:12:26] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:12:26] [INFO ] Invariant cache hit.
[2023-03-13 14:12:26] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-13 14:12:26] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:12:26] [INFO ] Invariant cache hit.
[2023-03-13 14:12:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:12:28] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2023-03-13 14:12:28] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-13 14:12:28] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:12:28] [INFO ] Invariant cache hit.
[2023-03-13 14:12:29] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2676 ms. Remains : 230/230 places, 2748/2748 transitions.
Incomplete random walk after 100000 steps, including 47 resets, run finished after 1085 ms. (steps per millisecond=92 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-13 14:12:30] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:12:30] [INFO ] Invariant cache hit.
[2023-03-13 14:12:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:12:30] [INFO ] After 355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 14:12:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:12:30] [INFO ] After 209ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-13 14:12:31] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2023-03-13 14:12:31] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2023-03-13 14:12:31] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 0 ms to minimize.
[2023-03-13 14:12:31] [INFO ] Deduced a trap composed of 19 places in 419 ms of which 0 ms to minimize.
[2023-03-13 14:12:32] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 0 ms to minimize.
[2023-03-13 14:12:32] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2023-03-13 14:12:32] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 1 ms to minimize.
[2023-03-13 14:12:32] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 0 ms to minimize.
[2023-03-13 14:12:33] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2023-03-13 14:12:33] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 9 ms to minimize.
[2023-03-13 14:12:33] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 1 ms to minimize.
[2023-03-13 14:12:34] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 0 ms to minimize.
[2023-03-13 14:12:34] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 1 ms to minimize.
[2023-03-13 14:12:34] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 1 ms to minimize.
[2023-03-13 14:12:34] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 1 ms to minimize.
[2023-03-13 14:12:35] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2023-03-13 14:12:35] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 0 ms to minimize.
[2023-03-13 14:12:35] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 1 ms to minimize.
[2023-03-13 14:12:36] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 1 ms to minimize.
[2023-03-13 14:12:36] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 1 ms to minimize.
[2023-03-13 14:12:36] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 1 ms to minimize.
[2023-03-13 14:12:37] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 1 ms to minimize.
[2023-03-13 14:12:37] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 0 ms to minimize.
[2023-03-13 14:12:37] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 0 ms to minimize.
[2023-03-13 14:12:37] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 1 ms to minimize.
[2023-03-13 14:12:38] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2023-03-13 14:12:38] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 0 ms to minimize.
[2023-03-13 14:12:38] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 0 ms to minimize.
[2023-03-13 14:12:39] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 0 ms to minimize.
[2023-03-13 14:12:39] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 1 ms to minimize.
[2023-03-13 14:12:39] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 0 ms to minimize.
[2023-03-13 14:12:39] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 4 ms to minimize.
[2023-03-13 14:12:39] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 0 ms to minimize.
[2023-03-13 14:12:40] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 0 ms to minimize.
[2023-03-13 14:12:40] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 1 ms to minimize.
[2023-03-13 14:12:40] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 1 ms to minimize.
[2023-03-13 14:12:40] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2023-03-13 14:12:41] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 1 ms to minimize.
[2023-03-13 14:12:41] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2023-03-13 14:12:41] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 0 ms to minimize.
[2023-03-13 14:12:41] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 12 ms to minimize.
[2023-03-13 14:12:41] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2023-03-13 14:12:42] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 15 ms to minimize.
[2023-03-13 14:12:42] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2023-03-13 14:12:42] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2023-03-13 14:12:42] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 0 ms to minimize.
[2023-03-13 14:12:42] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2023-03-13 14:12:43] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 0 ms to minimize.
[2023-03-13 14:12:43] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 0 ms to minimize.
[2023-03-13 14:12:43] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 12462 ms
[2023-03-13 14:12:43] [INFO ] After 12714ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 14:12:43] [INFO ] After 13150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 14:12:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:12:43] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 14:12:43] [INFO ] After 120ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-13 14:12:44] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 1 ms to minimize.
[2023-03-13 14:12:44] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-03-13 14:12:44] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
[2023-03-13 14:12:44] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 1 ms to minimize.
[2023-03-13 14:12:45] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 0 ms to minimize.
[2023-03-13 14:12:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1388 ms
[2023-03-13 14:12:45] [INFO ] After 1548ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-13 14:12:45] [INFO ] After 1915ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA BugTracking-PT-q3m128-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 9 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:12:45] [INFO ] Flatten gal took : 105 ms
[2023-03-13 14:12:45] [INFO ] Flatten gal took : 105 ms
[2023-03-13 14:12:45] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 7 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:12:45] [INFO ] Flatten gal took : 155 ms
[2023-03-13 14:12:46] [INFO ] Flatten gal took : 90 ms
[2023-03-13 14:12:46] [INFO ] Input system was already deterministic with 2750 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:12:46] [INFO ] Flatten gal took : 85 ms
[2023-03-13 14:12:46] [INFO ] Flatten gal took : 78 ms
[2023-03-13 14:12:46] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-13 14:12:46] [INFO ] Flatten gal took : 126 ms
[2023-03-13 14:12:46] [INFO ] Flatten gal took : 124 ms
[2023-03-13 14:12:46] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 14:12:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 25 ms.
Total runtime 85408 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 237 NrTr: 2750 NrArc: 13477)

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

net check time: 0m 0.002sec

init dd package: 0m 3.183sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9192152 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16083764 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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.039sec

8304 17093 25367 31854 41423 49517 55004 67316 73267 77754 91606 96617 100104 115111 119567 122054 138521 142117 143604 161523 164294 164850 184363 186414

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="BugTracking-PT-q3m128"
export BK_EXAMINATION="CTLFireability"
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 BugTracking-PT-q3m128, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695700370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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