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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K 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.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 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 22M 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-060-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678747468048

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-060
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 22:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:44:30] [INFO ] Load time of PNML (sax parser for PT used): 492 ms
[2023-03-13 22:44:30] [INFO ] Transformed 7924 places.
[2023-03-13 22:44:30] [INFO ] Transformed 21960 transitions.
[2023-03-13 22:44:30] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 657 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 21960 rows 7924 cols
[2023-03-13 22:44:34] [INFO ] Computed 63 place invariants in 2418 ms
[2023-03-13 22:44:37] [INFO ] [Real]Absence check using 61 positive place invariants in 142 ms returned sat
[2023-03-13 22:44:37] [INFO ] [Real]Absence check using 61 positive and 2 generalized place invariants in 153 ms returned sat
[2023-03-13 22:44:38] [INFO ] After 4150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 22:44:41] [INFO ] [Nat]Absence check using 61 positive place invariants in 96 ms returned sat
[2023-03-13 22:44:41] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 153 ms returned sat
[2023-03-13 22:45:01] [INFO ] After 18395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 22:45:01] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-13 22:45:03] [INFO ] After 1596ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-13 22:45:03] [INFO ] After 1598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-13 22:45:03] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 227 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.39 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 299 place count 7923 transition count 21662
Reduce places removed 298 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 359 rules applied. Total rules applied 658 place count 7625 transition count 21601
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 719 place count 7564 transition count 21601
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 719 place count 7564 transition count 21580
Deduced a syphon composed of 21 places in 11 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 761 place count 7543 transition count 21580
Performed 3309 Post agglomeration using F-continuation condition.Transition count delta: 3309
Deduced a syphon composed of 3309 places in 19 ms
Reduce places removed 3309 places and 0 transitions.
Iterating global reduction 3 with 6618 rules applied. Total rules applied 7379 place count 4234 transition count 18271
Drop transitions removed 3216 transitions
Redundant transition composition rules discarded 3216 transitions
Iterating global reduction 3 with 3216 rules applied. Total rules applied 10595 place count 4234 transition count 15055
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10596 place count 4234 transition count 15054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10597 place count 4233 transition count 15054
Partial Free-agglomeration rule applied 3786 times.
Drop transitions removed 3786 transitions
Iterating global reduction 4 with 3786 rules applied. Total rules applied 14383 place count 4233 transition count 15054
Partial Free-agglomeration rule applied 1212 times.
Drop transitions removed 1212 transitions
Iterating global reduction 4 with 1212 rules applied. Total rules applied 15595 place count 4233 transition count 15054
Applied a total of 15595 rules in 6885 ms. Remains 4233 /7924 variables (removed 3691) and now considering 15054/21960 (removed 6906) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6887 ms. Remains : 4233/7924 places, 15054/21960 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 13) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 15054 rows 4233 cols
[2023-03-13 22:45:11] [INFO ] Computed 62 place invariants in 672 ms
[2023-03-13 22:45:13] [INFO ] [Real]Absence check using 60 positive place invariants in 73 ms returned sat
[2023-03-13 22:45:13] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 80 ms returned sat
[2023-03-13 22:45:13] [INFO ] After 1374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 22:45:14] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2023-03-13 22:45:14] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 50 ms returned sat
[2023-03-13 22:45:26] [INFO ] After 11322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 22:45:26] [INFO ] State equation strengthened by 14111 read => feed constraints.
[2023-03-13 22:45:38] [INFO ] After 12110ms SMT Verify possible using 14111 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 22:45:38] [INFO ] After 12113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 22:45:38] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 586 ms.
Support contains 201 out of 4233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4233/4233 places, 15054/15054 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4233 transition count 15053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4232 transition count 15053
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 38 place count 4214 transition count 15035
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 4214 transition count 15035
Applied a total of 46 rules in 2229 ms. Remains 4214 /4233 variables (removed 19) and now considering 15035/15054 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2229 ms. Remains : 4214/4233 places, 15035/15054 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 11) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 15035 rows 4214 cols
[2023-03-13 22:45:42] [INFO ] Computed 62 place invariants in 702 ms
[2023-03-13 22:45:43] [INFO ] [Real]Absence check using 60 positive place invariants in 70 ms returned sat
[2023-03-13 22:45:43] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 77 ms returned sat
[2023-03-13 22:45:44] [INFO ] After 1407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 22:45:45] [INFO ] [Nat]Absence check using 60 positive place invariants in 47 ms returned sat
[2023-03-13 22:45:45] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-13 22:45:56] [INFO ] After 10587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 22:45:56] [INFO ] State equation strengthened by 14153 read => feed constraints.
[2023-03-13 22:46:09] [INFO ] After 12471ms SMT Verify possible using 14153 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 22:46:09] [INFO ] After 12472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-13 22:46:09] [INFO ] After 25093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 434 ms.
Support contains 185 out of 4214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4214/4214 places, 15035/15035 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 4214 transition count 15033
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4212 transition count 15033
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 4202 transition count 15023
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 4202 transition count 15023
Applied a total of 28 rules in 1875 ms. Remains 4202 /4214 variables (removed 12) and now considering 15023/15035 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1876 ms. Remains : 4202/4214 places, 15023/15035 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 50633 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50633 steps, saw 34671 distinct states, run finished after 3002 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 15023 rows 4202 cols
[2023-03-13 22:46:15] [INFO ] Computed 62 place invariants in 806 ms
[2023-03-13 22:46:17] [INFO ] [Real]Absence check using 60 positive place invariants in 45 ms returned sat
[2023-03-13 22:46:17] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-13 22:46:17] [INFO ] After 1530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 22:46:18] [INFO ] [Nat]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-13 22:46:18] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-13 22:46:31] [INFO ] After 11469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 22:46:31] [INFO ] State equation strengthened by 14177 read => feed constraints.
[2023-03-13 22:46:42] [INFO ] After 11506ms SMT Verify possible using 14177 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 22:46:42] [INFO ] After 11509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 22:46:42] [INFO ] After 25111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 435 ms.
Support contains 185 out of 4202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4202/4202 places, 15023/15023 transitions.
Applied a total of 0 rules in 803 ms. Remains 4202 /4202 variables (removed 0) and now considering 15023/15023 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 4202/4202 places, 15023/15023 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4202/4202 places, 15023/15023 transitions.
Applied a total of 0 rules in 684 ms. Remains 4202 /4202 variables (removed 0) and now considering 15023/15023 (removed 0) transitions.
[2023-03-13 22:46:44] [INFO ] Invariant cache hit.
[2023-03-13 22:46:47] [INFO ] Implicit Places using invariants in 2431 ms returned []
Implicit Place search using SMT only with invariants took 2432 ms to find 0 implicit places.
[2023-03-13 22:46:47] [INFO ] Invariant cache hit.
[2023-03-13 22:46:54] [INFO ] Dead Transitions using invariants and state equation in 7089 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10207 ms. Remains : 4202/4202 places, 15023/15023 transitions.
Graph (trivial) has 11432 edges and 4202 vertex of which 2379 / 4202 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2377 places
Drop transitions removed 5944 transitions
Ensure Unique test removed 3004 transitions
Reduce isomorphic transitions removed 8948 transitions.
Graph (complete) has 6540 edges and 1825 vertex of which 1750 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.2 ms
Discarding 75 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 657 transitions
Reduce isomorphic transitions removed 657 transitions.
Iterating post reduction 0 with 657 rules applied. Total rules applied 659 place count 1750 transition count 5394
Discarding 783 places :
Symmetric choice reduction at 1 with 783 rule applications. Total rules 1442 place count 967 transition count 3462
Iterating global reduction 1 with 783 rules applied. Total rules applied 2225 place count 967 transition count 3462
Ensure Unique test removed 724 transitions
Reduce isomorphic transitions removed 724 transitions.
Iterating post reduction 1 with 724 rules applied. Total rules applied 2949 place count 967 transition count 2738
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 2984 place count 932 transition count 2668
Iterating global reduction 2 with 35 rules applied. Total rules applied 3019 place count 932 transition count 2668
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 3054 place count 932 transition count 2633
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3056 place count 931 transition count 2632
Drop transitions removed 114 transitions
Redundant transition composition rules discarded 114 transitions
Iterating global reduction 3 with 114 rules applied. Total rules applied 3170 place count 931 transition count 2518
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 21 rules applied. Total rules applied 3191 place count 931 transition count 2497
Reduce places removed 21 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 4 with 41 rules applied. Total rules applied 3232 place count 910 transition count 2477
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 3252 place count 890 transition count 2477
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 3255 place count 887 transition count 2469
Iterating global reduction 6 with 3 rules applied. Total rules applied 3258 place count 887 transition count 2469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3261 place count 887 transition count 2466
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 3277 place count 879 transition count 2458
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 3299 place count 879 transition count 2436
Free-agglomeration rule applied 57 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 57 rules applied. Total rules applied 3356 place count 879 transition count 2378
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 7 with 119 rules applied. Total rules applied 3475 place count 822 transition count 2316
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 3482 place count 822 transition count 2309
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3483 place count 822 transition count 2308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3484 place count 821 transition count 2308
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3485 place count 821 transition count 2307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 3486 place count 821 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3487 place count 820 transition count 2306
Partial Free-agglomeration rule applied 618 times.
Drop transitions removed 618 transitions
Iterating global reduction 11 with 618 rules applied. Total rules applied 4105 place count 820 transition count 2306
Discarding 45 places :
Symmetric choice reduction at 11 with 45 rule applications. Total rules 4150 place count 775 transition count 2216
Iterating global reduction 11 with 45 rules applied. Total rules applied 4195 place count 775 transition count 2216
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 4200 place count 775 transition count 2211
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 2 rules applied. Total rules applied 4202 place count 775 transition count 2209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 4204 place count 773 transition count 2209
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 4206 place count 773 transition count 2207
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 4213 place count 773 transition count 2207
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 4220 place count 766 transition count 2200
Iterating global reduction 13 with 7 rules applied. Total rules applied 4227 place count 766 transition count 2200
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 4231 place count 766 transition count 2196
Applied a total of 4231 rules in 11146 ms. Remains 766 /4202 variables (removed 3436) and now considering 2196/15023 (removed 12827) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 2196 rows 766 cols
[2023-03-13 22:47:05] [INFO ] Computed 35 place invariants in 32 ms
[2023-03-13 22:47:05] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-13 22:47:05] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 22:47:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-13 22:47:07] [INFO ] After 1330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 22:47:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:47:08] [INFO ] After 1056ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 22:47:09] [INFO ] After 2516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1023 ms.
[2023-03-13 22:47:10] [INFO ] After 5131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-13 22:47:10] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 22:47:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4202 places, 15023 transitions and 59235 arcs took 88 ms.
[2023-03-13 22:47:11] [INFO ] Flatten gal took : 714 ms
Total runtime 162220 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: 4202 NrTr: 15023 NrArc: 59235)

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

net check time: 0m 0.009sec

init dd package: 0m 3.248sec

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

4391420

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

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