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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5561.712 3600000.00 3666695.00 420.00 FT?FT????FFF?FFF 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-167813695700409.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-q8m016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 08:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 07:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 07:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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-q8m016-CTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m016-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678720769562

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-q8m016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 15:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 15:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:19:32] [INFO ] Load time of PNML (sax parser for PT used): 766 ms
[2023-03-13 15:19:32] [INFO ] Transformed 754 places.
[2023-03-13 15:19:32] [INFO ] Transformed 27370 transitions.
[2023-03-13 15:19:32] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 963 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 474 places in 146 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m016-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 95 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-13 15:19:32] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-13 15:19:33] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-13 15:19:33] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-13 15:19:33] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 15:19:33] [INFO ] Invariant cache hit.
[2023-03-13 15:19:34] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 15:19:36] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
[2023-03-13 15:19:36] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 15:19:36] [INFO ] Invariant cache hit.
[2023-03-13 15:19:37] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4556 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 21 out of 277 places after structural reductions.
[2023-03-13 15:19:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 15:19:38] [INFO ] Flatten gal took : 398 ms
FORMULA BugTracking-PT-q8m016-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:19:38] [INFO ] Flatten gal took : 248 ms
[2023-03-13 15:19:38] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 14 out of 277 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 39 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 66550 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66550 steps, saw 35245 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-13 15:19:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 15:19:43] [INFO ] Invariant cache hit.
[2023-03-13 15:19:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:19:43] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2023-03-13 15:19:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 15:19:45] [INFO ] After 1720ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-13 15:19:45] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 15:19:47] [INFO ] After 1780ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2023-03-13 15:19:47] [INFO ] Deduced a trap composed of 24 places in 443 ms of which 8 ms to minimize.
[2023-03-13 15:19:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 526 ms
[2023-03-13 15:19:48] [INFO ] Deduced a trap composed of 67 places in 642 ms of which 1 ms to minimize.
[2023-03-13 15:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 842 ms
[2023-03-13 15:19:49] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 2 ms to minimize.
[2023-03-13 15:19:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 359 ms
[2023-03-13 15:19:50] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 1 ms to minimize.
[2023-03-13 15:19:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 451 ms
[2023-03-13 15:19:50] [INFO ] After 4862ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 482 ms.
[2023-03-13 15:19:50] [INFO ] After 7401ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
Fused 12 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 310 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10002 steps, including 43 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-13 15:19:51] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-13 15:19:51] [INFO ] Computed 8 place invariants in 42 ms
[2023-03-13 15:19:51] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:19:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:19:52] [INFO ] After 806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:19:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:19:53] [INFO ] After 531ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:19:53] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 1 ms to minimize.
[2023-03-13 15:19:54] [INFO ] Deduced a trap composed of 46 places in 454 ms of which 1 ms to minimize.
[2023-03-13 15:19:55] [INFO ] Deduced a trap composed of 88 places in 401 ms of which 1 ms to minimize.
[2023-03-13 15:19:55] [INFO ] Deduced a trap composed of 96 places in 600 ms of which 1 ms to minimize.
[2023-03-13 15:19:56] [INFO ] Deduced a trap composed of 95 places in 482 ms of which 1 ms to minimize.
[2023-03-13 15:19:57] [INFO ] Deduced a trap composed of 58 places in 865 ms of which 1 ms to minimize.
[2023-03-13 15:19:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4113 ms
[2023-03-13 15:19:57] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2023-03-13 15:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2023-03-13 15:19:58] [INFO ] After 5343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-13 15:19:58] [INFO ] After 6561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 438 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 102 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 10002 steps, including 54 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 77496 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77496 steps, saw 51033 distinct states, run finished after 3014 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 15:20:02] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:20:02] [INFO ] Invariant cache hit.
[2023-03-13 15:20:02] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:20:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:20:03] [INFO ] After 856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:20:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:20:03] [INFO ] After 443ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 15:20:04] [INFO ] Deduced a trap composed of 47 places in 470 ms of which 1 ms to minimize.
[2023-03-13 15:20:05] [INFO ] Deduced a trap composed of 28 places in 517 ms of which 1 ms to minimize.
[2023-03-13 15:20:06] [INFO ] Deduced a trap composed of 89 places in 822 ms of which 1 ms to minimize.
[2023-03-13 15:20:06] [INFO ] Deduced a trap composed of 93 places in 416 ms of which 1 ms to minimize.
[2023-03-13 15:20:07] [INFO ] Deduced a trap composed of 62 places in 472 ms of which 0 ms to minimize.
[2023-03-13 15:20:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3403 ms
[2023-03-13 15:20:07] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2023-03-13 15:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-13 15:20:08] [INFO ] After 4506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-13 15:20:08] [INFO ] After 5784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 162 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 140 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 75 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-13 15:20:08] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:20:08] [INFO ] Invariant cache hit.
[2023-03-13 15:20:09] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-13 15:20:09] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:20:09] [INFO ] Invariant cache hit.
[2023-03-13 15:20:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:20:11] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 2594 ms to find 0 implicit places.
[2023-03-13 15:20:11] [INFO ] Redundant transitions in 345 ms returned []
[2023-03-13 15:20:11] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 15:20:11] [INFO ] Invariant cache hit.
[2023-03-13 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4112 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 241 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-13 15:20:13] [INFO ] Computed 9 place invariants in 40 ms
[2023-03-13 15:20:13] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 15:20:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 15:20:14] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 15:20:14] [INFO ] After 1180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-13 15:20:14] [INFO ] After 1491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
FORMULA BugTracking-PT-q8m016-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:20:15] [INFO ] Flatten gal took : 258 ms
[2023-03-13 15:20:15] [INFO ] Flatten gal took : 272 ms
[2023-03-13 15:20:16] [INFO ] Input system was already deterministic with 3871 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 24 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:20:16] [INFO ] Flatten gal took : 219 ms
[2023-03-13 15:20:16] [INFO ] Flatten gal took : 158 ms
[2023-03-13 15:20:17] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 13 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:20:17] [INFO ] Flatten gal took : 266 ms
[2023-03-13 15:20:17] [INFO ] Flatten gal took : 144 ms
[2023-03-13 15:20:17] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:20:18] [INFO ] Flatten gal took : 230 ms
[2023-03-13 15:20:18] [INFO ] Flatten gal took : 189 ms
[2023-03-13 15:20:18] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:20:18] [INFO ] Flatten gal took : 226 ms
[2023-03-13 15:20:19] [INFO ] Flatten gal took : 167 ms
[2023-03-13 15:20:19] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 12 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:20:19] [INFO ] Flatten gal took : 119 ms
[2023-03-13 15:20:19] [INFO ] Flatten gal took : 121 ms
[2023-03-13 15:20:19] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 12 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 15:20:20] [INFO ] Flatten gal took : 131 ms
[2023-03-13 15:20:20] [INFO ] Flatten gal took : 132 ms
[2023-03-13 15:20:20] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-13 15:20:20] [INFO ] Flatten gal took : 154 ms
[2023-03-13 15:20:20] [INFO ] Flatten gal took : 127 ms
[2023-03-13 15:20:20] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2023-03-13 15:20:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 35 ms.
Total runtime 49340 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: 277 NrTr: 3871 NrArc: 19025)

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

net check time: 0m 0.003sec

init dd package: 0m 3.138sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10567500 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16083620 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 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.062sec

8302 36965 56199 73167 82055 90055 151668 170677 183105

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

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