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-167813696200743.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 CANInsertWithFailure-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-167813696200743
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 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 CANInsertWithFailure-PT-050-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678746914148

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=CANInsertWithFailure-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:35:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 22:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:35:16] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2023-03-13 22:35:16] [INFO ] Transformed 5604 places.
[2023-03-13 22:35:16] [INFO ] Transformed 15300 transitions.
[2023-03-13 22:35:16] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 16) seen :11
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 15300 rows 5604 cols
[2023-03-13 22:35:18] [INFO ] Computed 53 place invariants in 1005 ms
[2023-03-13 22:35:19] [INFO ] [Real]Absence check using 51 positive place invariants in 99 ms returned sat
[2023-03-13 22:35:19] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 87 ms returned sat
[2023-03-13 22:35:20] [INFO ] After 1859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 22:35:21] [INFO ] [Nat]Absence check using 51 positive place invariants in 82 ms returned sat
[2023-03-13 22:35:21] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 87 ms returned sat
[2023-03-13 22:35:41] [INFO ] After 19712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 22:35:41] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-13 22:35:45] [INFO ] After 3395ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:35:45] [INFO ] After 3400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 22:35:45] [INFO ] After 25150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 694 ms.
Support contains 103 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.31 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 285 place count 5603 transition count 15016
Reduce places removed 284 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 285 rules applied. Total rules applied 570 place count 5319 transition count 15015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 571 place count 5318 transition count 15015
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 571 place count 5318 transition count 15001
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 599 place count 5304 transition count 15001
Performed 2400 Post agglomeration using F-continuation condition.Transition count delta: 2400
Deduced a syphon composed of 2400 places in 12 ms
Reduce places removed 2400 places and 0 transitions.
Iterating global reduction 3 with 4800 rules applied. Total rules applied 5399 place count 2904 transition count 12601
Drop transitions removed 2317 transitions
Redundant transition composition rules discarded 2317 transitions
Iterating global reduction 3 with 2317 rules applied. Total rules applied 7716 place count 2904 transition count 10284
Free-agglomeration rule (complex) applied 50 times.
Iterating global reduction 3 with 50 rules applied. Total rules applied 7766 place count 2904 transition count 10234
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 7816 place count 2854 transition count 10234
Partial Free-agglomeration rule applied 2438 times.
Drop transitions removed 2438 transitions
Iterating global reduction 4 with 2438 rules applied. Total rules applied 10254 place count 2854 transition count 10234
Partial Free-agglomeration rule applied 659 times.
Drop transitions removed 659 transitions
Iterating global reduction 4 with 659 rules applied. Total rules applied 10913 place count 2854 transition count 10234
Applied a total of 10913 rules in 4487 ms. Remains 2854 /5604 variables (removed 2750) and now considering 10234/15300 (removed 5066) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4489 ms. Remains : 2854/5604 places, 10234/15300 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 5) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10234 rows 2854 cols
[2023-03-13 22:35:51] [INFO ] Computed 52 place invariants in 427 ms
[2023-03-13 22:35:52] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2023-03-13 22:35:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-13 22:35:52] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:35:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 21 ms returned sat
[2023-03-13 22:35:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-13 22:36:00] [INFO ] After 7880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:00] [INFO ] State equation strengthened by 9787 read => feed constraints.
[2023-03-13 22:36:07] [INFO ] After 7093ms SMT Verify possible using 9787 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:11] [INFO ] After 10714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4089 ms.
[2023-03-13 22:36:15] [INFO ] After 23337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 138 ms.
Support contains 98 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10234/10234 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2851 transition count 10231
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 2851 transition count 10231
Applied a total of 8 rules in 1291 ms. Remains 2851 /2854 variables (removed 3) and now considering 10231/10234 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 2851/2854 places, 10231/10234 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67540 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67540 steps, saw 34968 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10231 rows 2851 cols
[2023-03-13 22:36:20] [INFO ] Computed 52 place invariants in 490 ms
[2023-03-13 22:36:21] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2023-03-13 22:36:21] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-13 22:36:21] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:36:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 54 ms returned sat
[2023-03-13 22:36:22] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 52 ms returned sat
[2023-03-13 22:36:27] [INFO ] After 4898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:27] [INFO ] State equation strengthened by 9795 read => feed constraints.
[2023-03-13 22:36:31] [INFO ] After 4237ms SMT Verify possible using 9795 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:35] [INFO ] After 7920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3013 ms.
[2023-03-13 22:36:38] [INFO ] After 16801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 100 ms.
Support contains 98 out of 2851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2851/2851 places, 10231/10231 transitions.
Applied a total of 0 rules in 501 ms. Remains 2851 /2851 variables (removed 0) and now considering 10231/10231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 2851/2851 places, 10231/10231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2851/2851 places, 10231/10231 transitions.
Applied a total of 0 rules in 473 ms. Remains 2851 /2851 variables (removed 0) and now considering 10231/10231 (removed 0) transitions.
[2023-03-13 22:36:39] [INFO ] Invariant cache hit.
[2023-03-13 22:36:42] [INFO ] Implicit Places using invariants in 3515 ms returned []
Implicit Place search using SMT only with invariants took 3517 ms to find 0 implicit places.
[2023-03-13 22:36:42] [INFO ] Invariant cache hit.
[2023-03-13 22:36:47] [INFO ] Dead Transitions using invariants and state equation in 4947 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8940 ms. Remains : 2851/2851 places, 10231/10231 transitions.
Graph (trivial) has 8390 edges and 2851 vertex of which 1871 / 2851 are part of one of the 2 SCC in 9 ms
Free SCC test removed 1869 places
Drop transitions removed 4798 transitions
Ensure Unique test removed 2274 transitions
Reduce isomorphic transitions removed 7072 transitions.
Graph (complete) has 3461 edges and 982 vertex of which 953 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Discarding 467 places :
Symmetric choice reduction at 0 with 467 rule applications. Total rules 469 place count 486 transition count 1758
Iterating global reduction 0 with 467 rules applied. Total rules applied 936 place count 486 transition count 1758
Ensure Unique test removed 467 transitions
Reduce isomorphic transitions removed 467 transitions.
Iterating post reduction 0 with 467 rules applied. Total rules applied 1403 place count 486 transition count 1291
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 1 with 2 rules applied. Total rules applied 1405 place count 485 transition count 1290
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 1 with 57 rules applied. Total rules applied 1462 place count 485 transition count 1233
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 1 with 2 rules applied. Total rules applied 1464 place count 484 transition count 1232
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 1466 place count 484 transition count 1230
Free-agglomeration rule applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 1500 place count 484 transition count 1196
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 1556 place count 450 transition count 1174
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1562 place count 444 transition count 1168
Iterating global reduction 2 with 6 rules applied. Total rules applied 1568 place count 444 transition count 1168
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1574 place count 438 transition count 1156
Iterating global reduction 2 with 6 rules applied. Total rules applied 1580 place count 438 transition count 1156
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 1586 place count 438 transition count 1150
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1588 place count 438 transition count 1148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1590 place count 436 transition count 1148
Partial Free-agglomeration rule applied 342 times.
Drop transitions removed 342 transitions
Iterating global reduction 3 with 342 rules applied. Total rules applied 1932 place count 436 transition count 1148
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1936 place count 436 transition count 1144
Applied a total of 1936 rules in 1572 ms. Remains 436 /2851 variables (removed 2415) and now considering 1144/10231 (removed 9087) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1144 rows 436 cols
[2023-03-13 22:36:49] [INFO ] Computed 23 place invariants in 13 ms
[2023-03-13 22:36:49] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-13 22:36:49] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:36:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 6 ms returned sat
[2023-03-13 22:36:50] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:36:50] [INFO ] After 308ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:51] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-13 22:36:51] [INFO ] After 1608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:36:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 22:36:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2851 places, 10231 transitions and 40547 arcs took 52 ms.
[2023-03-13 22:36:52] [INFO ] Flatten gal took : 459 ms
Total runtime 96452 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: 2851 NrTr: 10231 NrArc: 40547)

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

net check time: 0m 0.008sec

init dd package: 0m 3.100sec

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

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="CANInsertWithFailure-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 CANInsertWithFailure-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-167813696200743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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