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

About the Execution of Marcie+red for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6058.056 49180.00 64952.00 98.50 TTTTFTFTTTTFTTFT 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-167813695400207.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 BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695400207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Feb 25 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 194K Feb 25 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 798K Feb 25 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 434K 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 BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678700575873

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=BridgeAndVehicles-PT-V20P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:42:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:42:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:42:57] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-13 09:42:57] [INFO ] Transformed 68 places.
[2023-03-13 09:42:57] [INFO ] Transformed 548 transitions.
[2023-03-13 09:42:57] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 56 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 09:43:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-13 09:43:00] [INFO ] Computed 7 place invariants in 11 ms
[2023-03-13 09:43:01] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 09:43:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 09:43:01] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-13 09:43:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:43:01] [INFO ] After 90ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-03-13 09:43:01] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-13 09:43:01] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 26 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 53 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-13 09:43:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-13 09:43:01] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-13 09:43:01] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 65/68 places, 547/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 628530 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 628530 steps, saw 154416 distinct states, run finished after 3002 ms. (steps per millisecond=209 ) properties seen :2
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-13 09:43:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:05] [INFO ] Invariant cache hit.
[2023-03-13 09:43:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 09:43:05] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:43:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:05] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:43:05] [INFO ] After 64ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:05] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-13 09:43:05] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 30 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 65/65 places, 547/547 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 577688 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 577688 steps, saw 142631 distinct states, run finished after 3006 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:43:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:09] [INFO ] Invariant cache hit.
[2023-03-13 09:43:09] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:43:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:09] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:43:09] [INFO ] After 93ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:09] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-13 09:43:09] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 24 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 46 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 31 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-13 09:43:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:09] [INFO ] Invariant cache hit.
[2023-03-13 09:43:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-13 09:43:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:09] [INFO ] Invariant cache hit.
[2023-03-13 09:43:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:43:09] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 291 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/65 places, 547/547 transitions.
Applied a total of 0 rules in 39 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 361 ms. Remains : 64/65 places, 547/547 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 562997 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 562997 steps, saw 139388 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:43:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2023-03-13 09:43:13] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 09:43:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:13] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:43:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:13] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:43:13] [INFO ] After 101ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:13] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-13 09:43:13] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 24 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 29 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 64/64 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 26 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2023-03-13 09:43:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:13] [INFO ] Invariant cache hit.
[2023-03-13 09:43:13] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-13 09:43:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:13] [INFO ] Invariant cache hit.
[2023-03-13 09:43:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 09:43:14] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-13 09:43:14] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-13 09:43:14] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-13 09:43:14] [INFO ] Invariant cache hit.
[2023-03-13 09:43:14] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 64/64 places, 547/547 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 129
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 422 place count 62 transition count 127
Applied a total of 422 rules in 11 ms. Remains 62 /64 variables (removed 2) and now considering 127/547 (removed 420) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 62 cols
[2023-03-13 09:43:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:43:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:14] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:43:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 09:43:14] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:14] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-13 09:43:14] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:43:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 09:43:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 64 places, 547 transitions and 4025 arcs took 8 ms.
[2023-03-13 09:43:14] [INFO ] Flatten gal took : 84 ms
Total runtime 17118 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: BridgeAndVehicles_PT_V20P20N10
(NrP: 64 NrTr: 547 NrArc: 4025)

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

net check time: 0m 0.000sec

init dd package: 0m 3.341sec


RS generation: 0m 7.707sec


-> reachability set: #nodes 222034 (2.2e+05) #states 6,732,570 (6)



starting MCC model checker
--------------------------

checking: EF [[[1<=p63 & 1<=p32] & [1<=p1 & 1<=p24]]]
normalized: E [true U [[1<=p63 & 1<=p32] & [1<=p1 & 1<=p24]]]

abstracting: (1<=p24)
states: 1,440,651 (6)
abstracting: (1<=p1)
states: 710,820 (5)
abstracting: (1<=p32)
states: 470,222 (5)
abstracting: (1<=p63)
states: 643,944 (5)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.280sec

checking: EF [[[[[[[[1<=p53 & 1<=p44] | [[1<=p63 & 1<=p26] & 1<=p16]] & 1<=p47] & [1<=p25 & 1<=p33]] & [1<=p36 & [1<=p59 & 1<=p23]]] & [[[1<=p0 & 1<=p10] & 1<=p58] & [[1<=p24 & 1<=p35] & 1<=p1]]] | [[1<=p24 & 1<=p1] & [[1<=p61 & [[[[[p53<=0 | [[[[p0<=0 | p2<=0] & 1<=p59] & 1<=p26] & [[1<=p25 & 1<=p10] & 1<=p56]]] | p34<=0] | [p24<=0 | p1<=0]] & [[p16<=0 | p25<=0] | [p26<=0 | p60<=0]]] | [[1<=p26 & 1<=p59] & [1<=p2 & 1<=p25]]]] & 1<=p40]]]]
normalized: E [true U [[[1<=p40 & [1<=p61 & [[[1<=p2 & 1<=p25] & [1<=p26 & 1<=p59]] | [[[p26<=0 | p60<=0] | [p16<=0 | p25<=0]] & [[p24<=0 | p1<=0] | [p34<=0 | [p53<=0 | [[1<=p56 & [1<=p25 & 1<=p10]] & [1<=p26 & [1<=p59 & [p0<=0 | p2<=0]]]]]]]]]]] & [1<=p24 & 1<=p1]] | [[[1<=p1 & [1<=p24 & 1<=p35]] & [1<=p58 & [1<=p0 & 1<=p10]]] & [[1<=p36 & [1<=p59 & 1<=p23]] & [[1<=p25 & 1<=p33] & [1<=p47 & [[1<=p16 & [1<=p63 & 1<=p26]] | [1<=p53 & 1<=p44]]]]]]]]

abstracting: (1<=p44)
states: 40,551 (4)
abstracting: (1<=p53)
states: 751,689 (5)
abstracting: (1<=p26)
states: 710,760 (5)
abstracting: (1<=p63)
states: 643,944 (5)
abstracting: (1<=p16)
states: 110,880 (5)
abstracting: (1<=p47)
states: 6,021,810 (6)
abstracting: (1<=p33)
states: 426,408 (5)
abstracting: (1<=p25)
states: 1,440,630 (6)
abstracting: (1<=p23)
states: 6,732,570 (6)
abstracting: (1<=p59)
states: 706,944 (5)
abstracting: (1<=p36)
states: 295,338 (5)
abstracting: (1<=p10)
states: 338,963 (5)
abstracting: (1<=p0)
states: 5,999,475 (6)
abstracting: (1<=p58)
states: 674,604 (5)
abstracting: (1<=p35)
states: 338,966 (5)
abstracting: (1<=p24)
states: 1,440,651 (6)
abstracting: (1<=p1)
states: 710,820 (5)
abstracting: (1<=p1)
states: 710,820 (5)
abstracting: (1<=p24)
states: 1,440,651 (6)
abstracting: (p2<=0)
states: 6,042,351 (6)
abstracting: (p0<=0)
states: 733,095 (5)
abstracting: (1<=p59)
states: 706,944 (5)
abstracting: (1<=p26)
states: 710,760 (5)
abstracting: (1<=p10)
states: 338,963 (5)
abstracting: (1<=p25)
states: 1,440,630 (6)
abstracting: (1<=p56)
states: 534,576 (5)
abstracting: (p53<=0)
states: 5,980,881 (6)
abstracting: (p34<=0)
states: 6,349,914 (6)
abstracting: (p1<=0)
states: 6,021,750 (6)
abstracting: (p24<=0)
states: 5,291,919 (6)
abstracting: (p25<=0)
states: 5,291,940 (6)
abstracting: (p16<=0)
states: 6,621,690 (6)
abstracting: (p60<=0)
states: 6,015,042 (6)
abstracting: (p26<=0)
states: 6,021,810 (6)
abstracting: (1<=p59)
states: 706,944 (5)
abstracting: (1<=p26)
states: 710,760 (5)
abstracting: (1<=p25)
states: 1,440,630 (6)
abstracting: (1<=p2)
states: 690,219 (5)
abstracting: (1<=p61)
states: 708,876 (5)
abstracting: (1<=p40)
states: 140,151 (5)
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.429sec

totally nodes used: 8215414 (8.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20323923 75998463 96322386
used/not used/entry size/cache size: 46986253 20122611 16 1024MB
basic ops cache: hits/miss/sum: 6313143 8521990 14835133
used/not used/entry size/cache size: 10222838 6554378 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 163787 587108 750895
used/not used/entry size/cache size: 568696 7819912 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 59862008
1 6453374
2 663327
3 106576
4 17894
5 2862
6 710
7 317
8 239
9 259
>= 10 1298

Total processing time: 0m29.853sec


BK_STOP 1678700625053

--------------------
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 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.000sec

23823 24158 24125 24238 24350
iterations count:591819 (1081), effective:9324 (17)

initing FirstDep: 0m 0.000sec

18292 42563 72947 94422 122519 144768
iterations count:663023 (1212), effective:3539 (6)
31445
iterations count:166479 (304), effective:1059 (1)

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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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-167813695400207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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