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-167813695700378.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-q3m256, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K 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 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q3m256-CTLFireability-00
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-01
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-02
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-03
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-04
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-05
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-06
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-07
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-08
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-09
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-10
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-11
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-12
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-13
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-14
FORMULA_NAME BugTracking-PT-q3m256-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678717149282

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-q3m256
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 14:19:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 14:19:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:19:12] [INFO ] Load time of PNML (sax parser for PT used): 1027 ms
[2023-03-13 14:19:12] [INFO ] Transformed 754 places.
[2023-03-13 14:19:12] [INFO ] Transformed 27370 transitions.
[2023-03-13 14:19:12] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1323 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Deduced a syphon composed of 514 places in 187 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m256-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 99 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-13 14:19:13] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-13 14:19:13] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-13 14:19:14] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-13 14:19:14] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 14:19:14] [INFO ] Invariant cache hit.
[2023-03-13 14:19:15] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 14:19:17] [INFO ] Implicit Places using invariants and state equation in 2626 ms returned []
Implicit Place search using SMT with State Equation took 3695 ms to find 0 implicit places.
[2023-03-13 14:19:17] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 14:19:17] [INFO ] Invariant cache hit.
[2023-03-13 14:19:17] [INFO ] Dead Transitions using invariants and state equation in 830 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 4633 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 19 out of 237 places after structural reductions.
[2023-03-13 14:19:18] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2023-03-13 14:19:18] [INFO ] Flatten gal took : 249 ms
FORMULA BugTracking-PT-q3m256-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 14:19:18] [INFO ] Flatten gal took : 132 ms
[2023-03-13 14:19:18] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 12 out of 237 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10216 steps, including 10 resets, run finished after 230 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 147284 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147284 steps, saw 70556 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 14:19:22] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 14:19:22] [INFO ] Invariant cache hit.
[2023-03-13 14:19:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:19:23] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-13 14:19:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 14:19:24] [INFO ] After 879ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 14:19:24] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 14:19:24] [INFO ] After 571ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-13 14:19:25] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 7 ms to minimize.
[2023-03-13 14:19:25] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 1 ms to minimize.
[2023-03-13 14:19:26] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2023-03-13 14:19:26] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 3 ms to minimize.
[2023-03-13 14:19:26] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-13 14:19:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1642 ms
[2023-03-13 14:19:27] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2023-03-13 14:19:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 439 ms
[2023-03-13 14:19:27] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2023-03-13 14:19:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-13 14:19:27] [INFO ] After 3312ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-13 14:19:28] [INFO ] After 4671ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 5 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 3 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 332 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 335 ms. Remains : 230/237 places, 2748/2750 transitions.
Incomplete random walk after 10009 steps, including 5 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 145171 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145171 steps, saw 95242 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 14:19:31] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2023-03-13 14:19:31] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-13 14:19:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 14:19:32] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:19:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 14:19:33] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:19:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:19:33] [INFO ] After 293ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 14:19:33] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 1 ms to minimize.
[2023-03-13 14:19:34] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 0 ms to minimize.
[2023-03-13 14:19:34] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 1 ms to minimize.
[2023-03-13 14:19:36] [INFO ] Deduced a trap composed of 31 places in 2113 ms of which 1 ms to minimize.
[2023-03-13 14:19:37] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2023-03-13 14:19:37] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2023-03-13 14:19:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4072 ms
[2023-03-13 14:19:37] [INFO ] After 4668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-13 14:19:37] [INFO ] After 5536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 160 ms.
Support contains 5 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 59 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 60 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 55 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2023-03-13 14:19:38] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:19:38] [INFO ] Invariant cache hit.
[2023-03-13 14:19:38] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-13 14:19:38] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:19:38] [INFO ] Invariant cache hit.
[2023-03-13 14:19:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 14:19:40] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2310 ms to find 0 implicit places.
[2023-03-13 14:19:40] [INFO ] Redundant transitions in 238 ms returned []
[2023-03-13 14:19:40] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2023-03-13 14:19:40] [INFO ] Invariant cache hit.
[2023-03-13 14:19:41] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3713 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 295 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:19:42] [INFO ] Computed 9 place invariants in 27 ms
[2023-03-13 14:19:42] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 14:19:43] [INFO ] After 665ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-13 14:19:43] [INFO ] After 851ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:19:43] [INFO ] After 918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 14:19:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 14:19:43] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 14:19:44] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-13 14:19:44] [INFO ] After 1000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m256-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 14:19:44] [INFO ] Flatten gal took : 145 ms
[2023-03-13 14:19:44] [INFO ] Flatten gal took : 155 ms
[2023-03-13 14:19:44] [INFO ] Input system was already deterministic with 2750 transitions.
Computed a total of 6 stabilizing places and 111 stable 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 12 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:19:45] [INFO ] Flatten gal took : 124 ms
[2023-03-13 14:19:45] [INFO ] Flatten gal took : 125 ms
[2023-03-13 14:19: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 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 10 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:19:45] [INFO ] Flatten gal took : 100 ms
[2023-03-13 14:19:45] [INFO ] Flatten gal took : 100 ms
[2023-03-13 14:19: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 8 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 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:19:45] [INFO ] Flatten gal took : 104 ms
[2023-03-13 14:19:46] [INFO ] Flatten gal took : 101 ms
[2023-03-13 14:19: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 8 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 9 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 14:19:46] [INFO ] Flatten gal took : 93 ms
[2023-03-13 14:19:46] [INFO ] Flatten gal took : 96 ms
[2023-03-13 14:19:46] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-13 14:19:46] [INFO ] Flatten gal took : 94 ms
[2023-03-13 14:19:46] [INFO ] Flatten gal took : 90 ms
[2023-03-13 14:19:46] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 14:19:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 18 ms.
Total runtime 35382 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.063sec

net check time: 0m 0.002sec

init dd package: 0m 3.113sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9029956 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16084968 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.049sec

9456 19427 28311 35566 47089 55021 61276 74259 81331 86586 101029 107241 111496 127399 132751

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

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 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 ;