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

About the Execution of Marcie+red for CANInsertWithFailure-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6633.863 3600000.00 3634834.00 684.00 ??T???T??T?????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696100706.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100706
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678743081751

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=CTLFireability
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:31:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:31:23] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-13 21:31:23] [INFO ] Transformed 324 places.
[2023-03-13 21:31:23] [INFO ] Transformed 660 transitions.
[2023-03-13 21:31:23] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 90 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 35 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-13 21:31:23] [INFO ] Computed 12 place invariants in 21 ms
[2023-03-13 21:31:24] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-13 21:31:24] [INFO ] Invariant cache hit.
[2023-03-13 21:31:24] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-13 21:31:24] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-13 21:31:24] [INFO ] Invariant cache hit.
[2023-03-13 21:31:24] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1073 ms. Remains : 323/324 places, 660/660 transitions.
Support contains 90 out of 323 places after structural reductions.
[2023-03-13 21:31:25] [INFO ] Flatten gal took : 66 ms
[2023-03-13 21:31:25] [INFO ] Flatten gal took : 29 ms
[2023-03-13 21:31:25] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 89 out of 323 places (down from 90) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 69) seen :61
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 21:31:26] [INFO ] Invariant cache hit.
[2023-03-13 21:31:26] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 21:31:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-13 21:31:26] [INFO ] After 308ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:1
[2023-03-13 21:31:26] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-13 21:31:26] [INFO ] After 155ms SMT Verify possible using 190 Read/Feed constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-13 21:31:26] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-13 21:31:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-13 21:31:26] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-13 21:31:27] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-13 21:31:27] [INFO ] After 307ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-13 21:31:27] [INFO ] After 657ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-13 21:31:28] [INFO ] After 1365ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 18 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 323 transition count 602
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 118 place count 265 transition count 600
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 263 transition count 600
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 120 place count 263 transition count 597
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 126 place count 260 transition count 597
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 290 place count 178 transition count 515
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 3 with 69 rules applied. Total rules applied 359 place count 178 transition count 446
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 365 place count 178 transition count 440
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 371 place count 172 transition count 440
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 470 place count 172 transition count 440
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 493 place count 172 transition count 440
Applied a total of 493 rules in 123 ms. Remains 172 /323 variables (removed 151) and now considering 440/660 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 172/323 places, 440/660 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 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 440 rows 172 cols
[2023-03-13 21:31:28] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 21:31:28] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 21:31:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-13 21:31:28] [INFO ] After 98ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-13 21:31:28] [INFO ] State equation strengthened by 361 read => feed constraints.
[2023-03-13 21:31:28] [INFO ] After 48ms SMT Verify possible using 361 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:31:28] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:31:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 21:31:28] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:31:29] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:31:29] [INFO ] After 105ms SMT Verify possible using 361 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:31:29] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-13 21:31:29] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 9 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 440/440 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 168 transition count 436
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 168 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 167 transition count 435
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 32 place count 167 transition count 435
Applied a total of 32 rules in 38 ms. Remains 167 /172 variables (removed 5) and now considering 435/440 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 167/172 places, 435/440 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 999925 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 999925 steps, saw 132170 distinct states, run finished after 3002 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 435 rows 167 cols
[2023-03-13 21:31:32] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-13 21:31:32] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 21:31:32] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:31:32] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-13 21:31:32] [INFO ] State equation strengthened by 396 read => feed constraints.
[2023-03-13 21:31:32] [INFO ] After 51ms SMT Verify possible using 396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:31:32] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:31:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 21:31:32] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:31:32] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:31:33] [INFO ] After 85ms SMT Verify possible using 396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:31:33] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-13 21:31:33] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 435/435 transitions.
Applied a total of 0 rules in 13 ms. Remains 167 /167 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 167/167 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 435/435 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-13 21:31:33] [INFO ] Invariant cache hit.
[2023-03-13 21:31:33] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-13 21:31:33] [INFO ] Invariant cache hit.
[2023-03-13 21:31:33] [INFO ] State equation strengthened by 396 read => feed constraints.
[2023-03-13 21:31:33] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-13 21:31:34] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-13 21:31:34] [INFO ] Invariant cache hit.
[2023-03-13 21:31:34] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 167/167 places, 435/435 transitions.
Graph (trivial) has 329 edges and 167 vertex of which 97 / 167 are part of one of the 2 SCC in 3 ms
Free SCC test removed 95 places
Drop transitions removed 209 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 301 transitions.
Graph (complete) has 198 edges and 72 vertex of which 51 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 51 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 23 place count 51 transition count 106
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 25 place count 50 transition count 106
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 41 place count 34 transition count 74
Iterating global reduction 1 with 16 rules applied. Total rules applied 57 place count 34 transition count 74
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 68 place count 34 transition count 63
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 2 with 2 rules applied. Total rules applied 70 place count 33 transition count 62
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 33 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 32 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 32 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 32 transition count 55
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 32 transition count 52
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 29 transition count 52
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 29 transition count 56
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 89 place count 27 transition count 53
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 91 place count 27 transition count 53
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 96 place count 27 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 27 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 26 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 26 transition count 47
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 104 place count 26 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 25 transition count 41
Applied a total of 105 rules in 44 ms. Remains 25 /167 variables (removed 142) and now considering 41/435 (removed 394) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 25 cols
[2023-03-13 21:31:34] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 21:31:34] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 21:31:34] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-13 21:31:34] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:31:34] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:31:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 21:31:34] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:31:34] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 21:31:34] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-010-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 31 ms
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 31 ms
[2023-03-13 21:31:34] [INFO ] Input system was already deterministic with 660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 323 transition count 594
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 257 transition count 594
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 132 place count 257 transition count 592
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 247 transition count 584
Applied a total of 152 rules in 36 ms. Remains 247 /323 variables (removed 76) and now considering 584/660 (removed 76) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 247/323 places, 584/660 transitions.
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 22 ms
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 23 ms
[2023-03-13 21:31:34] [INFO ] Input system was already deterministic with 584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 25 ms
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 25 ms
[2023-03-13 21:31:34] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 22 ms
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 23 ms
[2023-03-13 21:31:34] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 17 ms
[2023-03-13 21:31:34] [INFO ] Flatten gal took : 18 ms
[2023-03-13 21:31:34] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 255 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 158 place count 244 transition count 581
Applied a total of 158 rules in 24 ms. Remains 244 /323 variables (removed 79) and now considering 581/660 (removed 79) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 244/323 places, 581/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 581 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 156 place count 245 transition count 582
Applied a total of 156 rules in 24 ms. Remains 245 /323 variables (removed 78) and now considering 582/660 (removed 78) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 245/323 places, 582/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 14 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 18 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 582 transitions.
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
FORMULA CANInsertWithFailure-PT-010-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 15 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 15 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 14 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 14 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 243 transition count 580
Applied a total of 160 rules in 16 ms. Remains 243 /323 variables (removed 80) and now considering 580/660 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 243/323 places, 580/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 580 transitions.
Finished random walk after 223 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=74 )
FORMULA CANInsertWithFailure-PT-010-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 14 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 256 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 156 place count 245 transition count 582
Applied a total of 156 rules in 17 ms. Remains 245 /323 variables (removed 78) and now considering 582/660 (removed 78) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 245/323 places, 582/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 10 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 11 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 11 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Input system was already deterministic with 660 transitions.
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:31:35] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 21:31:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 660 transitions and 1780 arcs took 2 ms.
Total runtime 12317 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 323 NrTr: 660 NrArc: 1780)

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

net check time: 0m 0.000sec

init dd package: 0m 3.158sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9514408 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100920 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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.001sec

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="CTLFireability"
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 CTLFireability"
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-167813696100706"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;