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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 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 5.6M 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-030-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678745019004

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-030
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:03:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 22:03:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:03:40] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2023-03-13 22:03:40] [INFO ] Transformed 2164 places.
[2023-03-13 22:03:41] [INFO ] Transformed 5580 transitions.
[2023-03-13 22:03:41] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 13 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 16) seen :8
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :1
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 5580 rows 2164 cols
[2023-03-13 22:03:42] [INFO ] Computed 33 place invariants in 252 ms
[2023-03-13 22:03:43] [INFO ] [Real]Absence check using 31 positive place invariants in 80 ms returned sat
[2023-03-13 22:03:43] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-13 22:03:48] [INFO ] After 5690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 22:03:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 34 ms returned sat
[2023-03-13 22:03:49] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-13 22:03:55] [INFO ] After 6143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 22:03:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-13 22:04:02] [INFO ] After 6899ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 22:04:08] [INFO ] After 13146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4352 ms.
[2023-03-13 22:04:13] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 139 ms.
Support contains 139 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 2163 transition count 5445
Reduce places removed 135 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 164 rules applied. Total rules applied 300 place count 2028 transition count 5416
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 329 place count 1999 transition count 5416
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 329 place count 1999 transition count 5406
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 349 place count 1989 transition count 5406
Performed 809 Post agglomeration using F-continuation condition.Transition count delta: 809
Deduced a syphon composed of 809 places in 5 ms
Reduce places removed 809 places and 0 transitions.
Iterating global reduction 3 with 1618 rules applied. Total rules applied 1967 place count 1180 transition count 4597
Drop transitions removed 761 transitions
Redundant transition composition rules discarded 761 transitions
Iterating global reduction 3 with 761 rules applied. Total rules applied 2728 place count 1180 transition count 3836
Partial Free-agglomeration rule applied 860 times.
Drop transitions removed 860 transitions
Iterating global reduction 3 with 860 rules applied. Total rules applied 3588 place count 1180 transition count 3836
Partial Free-agglomeration rule applied 268 times.
Drop transitions removed 268 transitions
Iterating global reduction 3 with 268 rules applied. Total rules applied 3856 place count 1180 transition count 3836
Applied a total of 3856 rules in 1118 ms. Remains 1180 /2164 variables (removed 984) and now considering 3836/5580 (removed 1744) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1119 ms. Remains : 1180/2164 places, 3836/5580 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 6) seen :2
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-03 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 14 ms. (steps per millisecond=714 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3836 rows 1180 cols
[2023-03-13 22:04:14] [INFO ] Computed 32 place invariants in 142 ms
[2023-03-13 22:04:15] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-13 22:04:15] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-13 22:04:17] [INFO ] After 2015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:04:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 33 ms returned sat
[2023-03-13 22:04:17] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-13 22:04:19] [INFO ] After 2177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:04:19] [INFO ] State equation strengthened by 3383 read => feed constraints.
[2023-03-13 22:04:22] [INFO ] After 2156ms SMT Verify possible using 3383 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:04:23] [INFO ] After 3565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1043 ms.
[2023-03-13 22:04:24] [INFO ] After 7394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 71 ms.
Support contains 110 out of 1180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1180/1180 places, 3836/3836 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1180 transition count 3835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1179 transition count 3835
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 24 place count 1168 transition count 3824
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 1168 transition count 3823
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 2 with 28 rules applied. Total rules applied 53 place count 1168 transition count 3795
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 81 place count 1140 transition count 3795
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 96 place count 1140 transition count 3795
Applied a total of 96 rules in 604 ms. Remains 1140 /1180 variables (removed 40) and now considering 3795/3836 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 1140/1180 places, 3795/3836 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 261 ms. (steps per millisecond=38 ) 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
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 :1
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3795 rows 1140 cols
[2023-03-13 22:04:25] [INFO ] Computed 32 place invariants in 87 ms
[2023-03-13 22:04:25] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-13 22:04:26] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-13 22:04:27] [INFO ] After 1840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 22:04:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-13 22:04:27] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-13 22:04:30] [INFO ] After 2152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 22:04:30] [INFO ] State equation strengthened by 3417 read => feed constraints.
[2023-03-13 22:04:31] [INFO ] After 1737ms SMT Verify possible using 3417 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 22:04:33] [INFO ] After 2940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 966 ms.
[2023-03-13 22:04:34] [INFO ] After 6461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 104 out of 1140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 3795/3795 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 1137 transition count 3792
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 1137 transition count 3792
Applied a total of 9 rules in 296 ms. Remains 1137 /1140 variables (removed 3) and now considering 3792/3795 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 1137/1140 places, 3792/3795 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 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 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 109199 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109199 steps, saw 27651 distinct states, run finished after 3005 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3792 rows 1137 cols
[2023-03-13 22:04:37] [INFO ] Computed 32 place invariants in 83 ms
[2023-03-13 22:04:38] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-13 22:04:38] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-13 22:04:39] [INFO ] After 1411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 22:04:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-13 22:04:39] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-13 22:04:41] [INFO ] After 1865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 22:04:41] [INFO ] State equation strengthened by 3425 read => feed constraints.
[2023-03-13 22:04:43] [INFO ] After 1780ms SMT Verify possible using 3425 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 22:04:44] [INFO ] After 3034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1216 ms.
[2023-03-13 22:04:45] [INFO ] After 6491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 55 ms.
Support contains 104 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 3792/3792 transitions.
Applied a total of 0 rules in 90 ms. Remains 1137 /1137 variables (removed 0) and now considering 3792/3792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1137/1137 places, 3792/3792 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 3792/3792 transitions.
Applied a total of 0 rules in 91 ms. Remains 1137 /1137 variables (removed 0) and now considering 3792/3792 (removed 0) transitions.
[2023-03-13 22:04:46] [INFO ] Invariant cache hit.
[2023-03-13 22:04:47] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2023-03-13 22:04:47] [INFO ] Invariant cache hit.
[2023-03-13 22:04:48] [INFO ] State equation strengthened by 3425 read => feed constraints.
[2023-03-13 22:05:01] [INFO ] Implicit Places using invariants and state equation in 14348 ms returned []
Implicit Place search using SMT with State Equation took 15403 ms to find 0 implicit places.
[2023-03-13 22:05:01] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-13 22:05:01] [INFO ] Invariant cache hit.
[2023-03-13 22:05:03] [INFO ] Dead Transitions using invariants and state equation in 2048 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17763 ms. Remains : 1137/1137 places, 3792/3792 transitions.
Graph (trivial) has 2804 edges and 1137 vertex of which 621 / 1137 are part of one of the 2 SCC in 4 ms
Free SCC test removed 619 places
Drop transitions removed 1510 transitions
Ensure Unique test removed 755 transitions
Reduce isomorphic transitions removed 2265 transitions.
Graph (complete) has 1715 edges and 518 vertex of which 508 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 171 place count 339 transition count 1020
Iterating global reduction 0 with 169 rules applied. Total rules applied 340 place count 339 transition count 1020
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Iterating post reduction 0 with 167 rules applied. Total rules applied 507 place count 339 transition count 853
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 511 place count 337 transition count 851
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 1 with 54 rules applied. Total rules applied 565 place count 337 transition count 797
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 569 place count 335 transition count 795
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 574 place count 335 transition count 790
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 584 place count 335 transition count 780
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 594 place count 325 transition count 780
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 595 place count 325 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 596 place count 324 transition count 779
Partial Free-agglomeration rule applied 178 times.
Drop transitions removed 178 transitions
Iterating global reduction 3 with 178 rules applied. Total rules applied 774 place count 324 transition count 779
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 775 place count 324 transition count 778
Applied a total of 775 rules in 509 ms. Remains 324 /1137 variables (removed 813) and now considering 778/3792 (removed 3014) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 778 rows 324 cols
[2023-03-13 22:05:04] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-13 22:05:04] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-13 22:05:04] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 22:05:04] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-13 22:05:05] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 22:05:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:05:05] [INFO ] After 239ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 22:05:05] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 184 ms.
[2023-03-13 22:05:05] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 22:05:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-13 22:05:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1137 places, 3792 transitions and 14760 arcs took 35 ms.
[2023-03-13 22:05:06] [INFO ] Flatten gal took : 250 ms
Total runtime 85679 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: 1137 NrTr: 3792 NrArc: 14760)

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

net check time: 0m 0.002sec

init dd package: 0m 3.111sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10019760 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16092944 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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.035sec

1536265

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

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