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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K Feb 26 06:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 26 06:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 06:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 06:40 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-q3m032-CTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m032-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678714558362

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 13:36:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 13:36:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:36:01] [INFO ] Load time of PNML (sax parser for PT used): 1064 ms
[2023-03-13 13:36:01] [INFO ] Transformed 754 places.
[2023-03-13 13:36:01] [INFO ] Transformed 27370 transitions.
[2023-03-13 13:36:02] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1427 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 514 places in 165 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m032-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-10 TRUE 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 124 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-13 13:36:02] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-13 13:36:02] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-13 13:36:03] [INFO ] Implicit Places using invariants in 818 ms returned []
[2023-03-13 13:36:03] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 13:36:03] [INFO ] Invariant cache hit.
[2023-03-13 13:36:06] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 13:36:07] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 4678 ms to find 0 implicit places.
[2023-03-13 13:36:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 13:36:07] [INFO ] Invariant cache hit.
[2023-03-13 13:36:08] [INFO ] Dead Transitions using invariants and state equation in 1183 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 6003 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 13 out of 237 places after structural reductions.
[2023-03-13 13:36:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 13:36:09] [INFO ] Flatten gal took : 399 ms
FORMULA BugTracking-PT-q3m032-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 13:36:09] [INFO ] Flatten gal took : 215 ms
[2023-03-13 13:36:09] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 9 out of 237 places (down from 13) after GAL structural reductions.
FORMULA BugTracking-PT-q3m032-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 40 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 78571 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78571 steps, saw 39856 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-13 13:36:13] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-13 13:36:13] [INFO ] Invariant cache hit.
[2023-03-13 13:36:14] [INFO ] [Real]Absence check using 8 positive place invariants in 55 ms returned sat
[2023-03-13 13:36:15] [INFO ] After 618ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-13 13:36:15] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-13 13:36:15] [INFO ] After 271ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 13:36:15] [INFO ] After 1542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 13:36:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 13:36:16] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-13 13:36:16] [INFO ] After 428ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-13 13:36:18] [INFO ] Deduced a trap composed of 11 places in 1218 ms of which 29 ms to minimize.
[2023-03-13 13:36:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1279 ms
[2023-03-13 13:36:18] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 2 ms to minimize.
[2023-03-13 13:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2023-03-13 13:36:19] [INFO ] After 2571ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-13 13:36:19] [INFO ] After 3938ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 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 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 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 221 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 113740 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113740 steps, saw 38600 distinct states, run finished after 3013 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 13:36:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-13 13:36:22] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-13 13:36:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 13:36:23] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 13:36:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 13:36:23] [INFO ] After 865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 13:36:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:36:24] [INFO ] After 571ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 13:36:24] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 14 ms to minimize.
[2023-03-13 13:36:25] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 12 ms to minimize.
[2023-03-13 13:36:25] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 0 ms to minimize.
[2023-03-13 13:36:25] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 1 ms to minimize.
[2023-03-13 13:36:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1435 ms
[2023-03-13 13:36:26] [INFO ] Deduced a trap composed of 17 places in 405 ms of which 1 ms to minimize.
[2023-03-13 13:36:27] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 1 ms to minimize.
[2023-03-13 13:36:27] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 1 ms to minimize.
[2023-03-13 13:36:27] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 0 ms to minimize.
[2023-03-13 13:36:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1693 ms
[2023-03-13 13:36:27] [INFO ] After 3946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-13 13:36:28] [INFO ] After 5297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 81 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 57 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-13 13:36:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:36:28] [INFO ] Invariant cache hit.
[2023-03-13 13:36:28] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-13 13:36:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:36:28] [INFO ] Invariant cache hit.
[2023-03-13 13:36:29] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-13 13:36:31] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3193 ms to find 0 implicit places.
[2023-03-13 13:36:31] [INFO ] Redundant transitions in 224 ms returned []
[2023-03-13 13:36:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-13 13:36:31] [INFO ] Invariant cache hit.
[2023-03-13 13:36:33] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4638 ms. Remains : 229/229 places, 2747/2747 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 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
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 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 360 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-13 13:36:33] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-13 13:36:33] [INFO ] [Real]Absence check using 9 positive place invariants in 80 ms returned sat
[2023-03-13 13:36:33] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 13:36:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 13:36:34] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 13:36:34] [INFO ] After 968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-13 13:36:35] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2023-03-13 13:36:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 13:36:35] [INFO ] Flatten gal took : 157 ms
FORMULA BugTracking-PT-q3m032-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 13:36:35] [INFO ] Flatten gal took : 132 ms
[2023-03-13 13:36:35] [INFO ] Input system was already deterministic with 2750 transitions.
Support contains 3 out of 237 places (down from 5) after GAL structural reductions.
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 20 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 21 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:36:35] [INFO ] Flatten gal took : 103 ms
[2023-03-13 13:36:36] [INFO ] Flatten gal took : 109 ms
[2023-03-13 13:36:36] [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 20 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 23 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:36:36] [INFO ] Flatten gal took : 84 ms
[2023-03-13 13:36:36] [INFO ] Flatten gal took : 108 ms
[2023-03-13 13:36:36] [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 22 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 23 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:36:37] [INFO ] Flatten gal took : 99 ms
[2023-03-13 13:36:37] [INFO ] Flatten gal took : 106 ms
[2023-03-13 13:36:37] [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 23 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 25 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:36:37] [INFO ] Flatten gal took : 129 ms
[2023-03-13 13:36:37] [INFO ] Flatten gal took : 107 ms
[2023-03-13 13:36:37] [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 21 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 22 ms. Remains : 237/237 places, 2750/2750 transitions.
[2023-03-13 13:36:37] [INFO ] Flatten gal took : 76 ms
[2023-03-13 13:36:38] [INFO ] Flatten gal took : 84 ms
[2023-03-13 13:36:38] [INFO ] Input system was already deterministic with 2750 transitions.
[2023-03-13 13:36:38] [INFO ] Flatten gal took : 92 ms
[2023-03-13 13:36:38] [INFO ] Flatten gal took : 110 ms
[2023-03-13 13:36:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 13:36:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 47 ms.
Total runtime 37967 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

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

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

net check time: 0m 0.002sec

init dd package: 0m 3.114sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9976584 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16079772 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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.041sec

7440 15739 23159 29070 37961 45390 50346 60121 67510 71586 82281 89630 92826 104441 111750 114066 130844 133870 135306 153219 155990 156546 176059 178110 177786 198899 200230 199026 221739 222350 220266 244594 244470 241506 267439 266590 262746 290279

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-q3m032"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is BugTracking-PT-q3m032, 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 r042-tajo-167813695600353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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