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

About the Execution of Marcie+red for CANConstruction-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9342.447 3600000.00 3650920.00 801.10 TFTFFTTT?T?TT?TT 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-167813696100655.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 CANConstruction-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.8M 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 CANConstruction-PT-050-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678738904643

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:21:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:21:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:21:46] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2023-03-13 20:21:46] [INFO ] Transformed 5602 places.
[2023-03-13 20:21:46] [INFO ] Transformed 10400 transitions.
[2023-03-13 20:21:46] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 16) seen :11
FORMULA CANConstruction-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10400 rows 5602 cols
[2023-03-13 20:21:47] [INFO ] Computed 101 place invariants in 139 ms
[2023-03-13 20:21:48] [INFO ] [Real]Absence check using 51 positive place invariants in 132 ms returned sat
[2023-03-13 20:21:48] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 88 ms returned sat
[2023-03-13 20:21:49] [INFO ] After 1523ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-13 20:21:50] [INFO ] [Nat]Absence check using 51 positive place invariants in 154 ms returned sat
[2023-03-13 20:21:50] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 115 ms returned sat
[2023-03-13 20:21:56] [INFO ] After 5634ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 20:21:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:21:59] [INFO ] After 3158ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-13 20:22:03] [INFO ] After 6751ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2523 ms.
[2023-03-13 20:22:05] [INFO ] After 16817ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA CANConstruction-PT-050-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA CANConstruction-PT-050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 102 ms.
Support contains 78 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 5602 transition count 10089
Reduce places removed 311 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 312 rules applied. Total rules applied 623 place count 5291 transition count 10088
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 624 place count 5290 transition count 10088
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 624 place count 5290 transition count 10073
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 654 place count 5275 transition count 10073
Discarding 2372 places :
Symmetric choice reduction at 3 with 2372 rule applications. Total rules 3026 place count 2903 transition count 5329
Iterating global reduction 3 with 2372 rules applied. Total rules applied 5398 place count 2903 transition count 5329
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 5466 place count 2869 transition count 5295
Free-agglomeration rule applied 56 times.
Iterating global reduction 3 with 56 rules applied. Total rules applied 5522 place count 2869 transition count 5239
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 5578 place count 2813 transition count 5239
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 5600 place count 2813 transition count 5217
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 5622 place count 2791 transition count 5217
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 5 with 59 rules applied. Total rules applied 5681 place count 2791 transition count 5217
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 5690 place count 2791 transition count 5217
Applied a total of 5690 rules in 2949 ms. Remains 2791 /5602 variables (removed 2811) and now considering 5217/10400 (removed 5183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2951 ms. Remains : 2791/5602 places, 5217/10400 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 88975 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88975 steps, saw 41798 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5217 rows 2791 cols
[2023-03-13 20:22:12] [INFO ] Computed 101 place invariants in 39 ms
[2023-03-13 20:22:12] [INFO ] [Real]Absence check using 51 positive place invariants in 44 ms returned sat
[2023-03-13 20:22:12] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 21 ms returned sat
[2023-03-13 20:22:13] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:22:13] [INFO ] [Nat]Absence check using 51 positive place invariants in 44 ms returned sat
[2023-03-13 20:22:13] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 22 ms returned sat
[2023-03-13 20:22:15] [INFO ] After 2049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:22:15] [INFO ] State equation strengthened by 5018 read => feed constraints.
[2023-03-13 20:22:17] [INFO ] After 2013ms SMT Verify possible using 5018 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:22:19] [INFO ] After 3549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1266 ms.
[2023-03-13 20:22:20] [INFO ] After 7466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 78 out of 2791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2791/2791 places, 5217/5217 transitions.
Applied a total of 0 rules in 337 ms. Remains 2791 /2791 variables (removed 0) and now considering 5217/5217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 2791/2791 places, 5217/5217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2791/2791 places, 5217/5217 transitions.
Applied a total of 0 rules in 310 ms. Remains 2791 /2791 variables (removed 0) and now considering 5217/5217 (removed 0) transitions.
[2023-03-13 20:22:21] [INFO ] Invariant cache hit.
[2023-03-13 20:22:23] [INFO ] Implicit Places using invariants in 1974 ms returned [6, 11, 17, 21, 25, 29, 33, 40, 46, 52, 56, 62, 68, 74, 78, 82, 86, 92, 97, 103, 108, 114, 118, 124, 131, 135, 139, 144, 150, 156, 160, 164, 168, 174, 180, 187, 193, 200, 204, 209, 214, 220, 225, 232, 236, 240, 245, 251, 257, 262]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1982 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2741/2791 places, 5217/5217 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 2741 transition count 5198
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 2722 transition count 5198
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 2713 transition count 5189
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 2713 transition count 5189
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 2709 transition count 5185
Applied a total of 64 rules in 708 ms. Remains 2709 /2741 variables (removed 32) and now considering 5185/5217 (removed 32) transitions.
// Phase 1: matrix 5185 rows 2709 cols
[2023-03-13 20:22:23] [INFO ] Computed 51 place invariants in 59 ms
[2023-03-13 20:22:25] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2023-03-13 20:22:25] [INFO ] Invariant cache hit.
[2023-03-13 20:22:26] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:22:36] [INFO ] Implicit Places using invariants and state equation in 11491 ms returned []
Implicit Place search using SMT with State Equation took 13151 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2709/2791 places, 5185/5217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16153 ms. Remains : 2709/2791 places, 5185/5217 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93346 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93346 steps, saw 45120 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 20:22:40] [INFO ] Invariant cache hit.
[2023-03-13 20:22:40] [INFO ] [Real]Absence check using 51 positive place invariants in 50 ms returned sat
[2023-03-13 20:22:40] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:22:41] [INFO ] [Nat]Absence check using 51 positive place invariants in 39 ms returned sat
[2023-03-13 20:22:43] [INFO ] After 1874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:22:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:22:44] [INFO ] After 1542ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:22:46] [INFO ] After 2981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1236 ms.
[2023-03-13 20:22:47] [INFO ] After 6582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 39 ms.
Support contains 78 out of 2709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 5185/5185 transitions.
Applied a total of 0 rules in 291 ms. Remains 2709 /2709 variables (removed 0) and now considering 5185/5185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 2709/2709 places, 5185/5185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 5185/5185 transitions.
Applied a total of 0 rules in 329 ms. Remains 2709 /2709 variables (removed 0) and now considering 5185/5185 (removed 0) transitions.
[2023-03-13 20:22:48] [INFO ] Invariant cache hit.
[2023-03-13 20:22:49] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2023-03-13 20:22:49] [INFO ] Invariant cache hit.
[2023-03-13 20:22:50] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 20:23:01] [INFO ] Implicit Places using invariants and state equation in 11533 ms returned []
Implicit Place search using SMT with State Equation took 12990 ms to find 0 implicit places.
[2023-03-13 20:23:01] [INFO ] Redundant transitions in 509 ms returned []
[2023-03-13 20:23:01] [INFO ] Invariant cache hit.
[2023-03-13 20:23:03] [INFO ] Dead Transitions using invariants and state equation in 2211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16051 ms. Remains : 2709/2709 places, 5185/5185 transitions.
Graph (trivial) has 4198 edges and 2709 vertex of which 1710 / 2709 are part of one of the 34 SCC in 6 ms
Free SCC test removed 1676 places
Drop transitions removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Graph (complete) has 2042 edges and 1033 vertex of which 979 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 979 transition count 1750
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 721 Post agglomeration using F-continuation condition.Transition count delta: 721
Iterating post reduction 1 with 814 rules applied. Total rules applied 909 place count 932 transition count 983
Reduce places removed 721 places and 0 transitions.
Ensure Unique test removed 706 transitions
Reduce isomorphic transitions removed 706 transitions.
Iterating post reduction 2 with 1427 rules applied. Total rules applied 2336 place count 211 transition count 277
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2336 place count 211 transition count 271
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2348 place count 205 transition count 271
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2358 place count 195 transition count 261
Iterating global reduction 3 with 10 rules applied. Total rules applied 2368 place count 195 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2370 place count 194 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2372 place count 193 transition count 261
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 2374 place count 193 transition count 259
Free-agglomeration rule applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 2391 place count 193 transition count 242
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 2408 place count 176 transition count 242
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 2421 place count 176 transition count 242
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 2428 place count 169 transition count 235
Iterating global reduction 4 with 7 rules applied. Total rules applied 2435 place count 169 transition count 235
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2439 place count 165 transition count 231
Applied a total of 2439 rules in 154 ms. Remains 165 /2709 variables (removed 2544) and now considering 231/5185 (removed 4954) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 231 rows 165 cols
[2023-03-13 20:23:04] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-13 20:23:04] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-13 20:23:04] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 20:23:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-13 20:23:04] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 20:23:04] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-13 20:23:04] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 20:23:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 20:23:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2709 places, 5185 transitions and 20444 arcs took 35 ms.
[2023-03-13 20:23:05] [INFO ] Flatten gal took : 285 ms
Total runtime 78748 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 2709 NrTr: 5185 NrArc: 20444)

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

net check time: 0m 0.008sec

init dd package: 0m 3.029sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6796648 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16093500 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 ReachabilityFireability -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.045sec

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="CANConstruction-PT-050"
export BK_EXAMINATION="ReachabilityFireability"
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 CANConstruction-PT-050, examination is ReachabilityFireability"
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-167813696100655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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