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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.9K Feb 26 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 00:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 698K 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-010-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678743157042

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:32:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:32:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:32:39] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-13 21:32:39] [INFO ] Transformed 324 places.
[2023-03-13 21:32:39] [INFO ] Transformed 660 transitions.
[2023-03-13 21:32:39] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 45 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 16) seen :11
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 660 rows 324 cols
[2023-03-13 21:32:39] [INFO ] Computed 13 place invariants in 23 ms
[2023-03-13 21:32:40] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 21:32:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-13 21:32:40] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:32:40] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 21:32:40] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-13 21:32:40] [INFO ] After 163ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-13 21:32:41] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-13 21:32:41] [INFO ] After 950ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 64 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 323 transition count 632
Reduce places removed 28 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 41 rules applied. Total rules applied 70 place count 295 transition count 619
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 83 place count 282 transition count 619
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 83 place count 282 transition count 615
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 278 transition count 615
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 135 place count 256 transition count 593
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 152 place count 256 transition count 576
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 256 transition count 572
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 252 transition count 572
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 4 with 132 rules applied. Total rules applied 292 place count 252 transition count 572
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 353 place count 252 transition count 572
Applied a total of 353 rules in 122 ms. Remains 252 /324 variables (removed 72) and now considering 572/660 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 252/324 places, 572/660 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 572 rows 252 cols
[2023-03-13 21:32:41] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-13 21:32:41] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:32:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 21:32:41] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:32:42] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:42] [INFO ] State equation strengthened by 231 read => feed constraints.
[2023-03-13 21:32:42] [INFO ] After 169ms SMT Verify possible using 231 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:42] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-13 21:32:42] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 62 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 572/572 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 251 transition count 571
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 0 with 2 rules applied. Total rules applied 4 place count 250 transition count 570
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 21 place count 250 transition count 570
Applied a total of 21 rules in 28 ms. Remains 250 /252 variables (removed 2) and now considering 570/572 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 250/252 places, 570/572 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 672752 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 672752 steps, saw 104953 distinct states, run finished after 3004 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 570 rows 250 cols
[2023-03-13 21:32:46] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-13 21:32:46] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:32:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 21:32:46] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 21:32:46] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:46] [INFO ] State equation strengthened by 247 read => feed constraints.
[2023-03-13 21:32:46] [INFO ] After 166ms SMT Verify possible using 247 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:46] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-13 21:32:47] [INFO ] After 881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 43 ms.
Support contains 62 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 570/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 250/250 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 570/570 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-13 21:32:47] [INFO ] Invariant cache hit.
[2023-03-13 21:32:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-13 21:32:47] [INFO ] Invariant cache hit.
[2023-03-13 21:32:47] [INFO ] State equation strengthened by 247 read => feed constraints.
[2023-03-13 21:32:47] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-03-13 21:32:47] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-13 21:32:47] [INFO ] Invariant cache hit.
[2023-03-13 21:32:48] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 250/250 places, 570/570 transitions.
Graph (trivial) has 169 edges and 250 vertex of which 12 / 250 are part of one of the 1 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions removed 21 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 660 edges and 239 vertex of which 226 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 226 transition count 502
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 44 place count 226 transition count 500
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 48 place count 224 transition count 500
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 220 transition count 492
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 220 transition count 492
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 58 place count 219 transition count 491
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 103 place count 219 transition count 446
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 122 place count 219 transition count 427
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 144 place count 200 transition count 424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 197 transition count 424
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 147 place count 197 transition count 416
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 163 place count 189 transition count 416
Free-agglomeration rule applied 59 times with reduction of 7 identical transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 222 place count 189 transition count 350
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 106 rules applied. Total rules applied 328 place count 130 transition count 303
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 347 place count 130 transition count 284
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 350 place count 130 transition count 284
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 357 place count 127 transition count 280
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 127 transition count 277
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 378 place count 127 transition count 277
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 127 transition count 277
Applied a total of 379 rules in 114 ms. Remains 127 /250 variables (removed 123) and now considering 277/570 (removed 293) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 277 rows 127 cols
[2023-03-13 21:32:48] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 21:32:48] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:32:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 21:32:48] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:32:48] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:48] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-13 21:32:48] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:32:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 21:32:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 570 transitions and 1849 arcs took 7 ms.
[2023-03-13 21:32:48] [INFO ] Flatten gal took : 57 ms
Total runtime 9866 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 250 NrTr: 570 NrArc: 1849)

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

net check time: 0m 0.000sec

init dd package: 0m 3.062sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9547832 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101416 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 ReachabilityCardinality -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.004sec

500964 1989863

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-010"
export BK_EXAMINATION="ReachabilityCardinality"
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-010, examination is ReachabilityCardinality"
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-167813696100710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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