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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10681.728 3600000.00 3678014.00 832.50 FFTTFFTFTF?????? 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-167813695500271.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-V50P50N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695500271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 30K Feb 25 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 169K Feb 25 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 597K Feb 25 12:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Feb 25 12:34 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 11K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 241K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 708K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 25 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.1M Feb 25 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:36 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 4.5M 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-V50P50N50-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678705789547

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-V50P50N50
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:09:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:09:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:09:52] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2023-03-13 11:09:52] [INFO ] Transformed 168 places.
[2023-03-13 11:09:52] [INFO ] Transformed 5408 transitions.
[2023-03-13 11:09:52] [INFO ] Parsed PT model containing 168 places and 5408 transitions and 42330 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 177 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 886 ms. (steps per millisecond=11 ) properties (out of 13) seen :4
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 3594 ms. (steps per millisecond=2 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-13 11:09:59] [INFO ] Flow matrix only has 410 transitions (discarded 4998 similar events)
// Phase 1: matrix 410 rows 168 cols
[2023-03-13 11:09:59] [INFO ] Computed 7 place invariants in 15 ms
[2023-03-13 11:10:07] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2023-03-13 11:10:07] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-13 11:10:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-13 11:10:08] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-13 11:10:08] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:10:09] [INFO ] After 1067ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-13 11:10:11] [INFO ] After 2729ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 1272 ms.
[2023-03-13 11:10:12] [INFO ] After 4787ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N50-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 369 ms.
Support contains 42 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 5408/5408 transitions.
Graph (complete) has 1542 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 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 165 transition count 5407
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 165 transition count 5407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 163 transition count 5406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 5405
Applied a total of 8 rules in 1824 ms. Remains 162 /168 variables (removed 6) and now considering 5405/5408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1826 ms. Remains : 162/168 places, 5405/5408 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 105807 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105807 steps, saw 36341 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 11:10:19] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
// Phase 1: matrix 407 rows 162 cols
[2023-03-13 11:10:19] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-13 11:10:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:10:20] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 11:10:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:10:21] [INFO ] After 718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:10:22] [INFO ] After 926ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:23] [INFO ] After 2329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 873 ms.
[2023-03-13 11:10:24] [INFO ] After 4094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 963 ms.
Support contains 42 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 5405/5405 transitions.
Applied a total of 0 rules in 977 ms. Remains 162 /162 variables (removed 0) and now considering 5405/5405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 979 ms. Remains : 162/162 places, 5405/5405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 5405/5405 transitions.
Applied a total of 0 rules in 1330 ms. Remains 162 /162 variables (removed 0) and now considering 5405/5405 (removed 0) transitions.
[2023-03-13 11:10:27] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
[2023-03-13 11:10:27] [INFO ] Invariant cache hit.
[2023-03-13 11:10:28] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-13 11:10:28] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
[2023-03-13 11:10:28] [INFO ] Invariant cache hit.
[2023-03-13 11:10:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:10:30] [INFO ] Implicit Places using invariants and state equation in 2328 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2825 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/162 places, 5405/5405 transitions.
Applied a total of 0 rules in 1357 ms. Remains 160 /160 variables (removed 0) and now considering 5405/5405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5526 ms. Remains : 160/162 places, 5405/5405 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 104673 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104673 steps, saw 35890 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 11:10:36] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
// Phase 1: matrix 407 rows 160 cols
[2023-03-13 11:10:36] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-13 11:10:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:10:37] [INFO ] After 1157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 11:10:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:10:38] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:10:39] [INFO ] After 934ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:41] [INFO ] After 2495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1264 ms.
[2023-03-13 11:10:42] [INFO ] After 4688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 820 ms.
Support contains 42 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 5405/5405 transitions.
Applied a total of 0 rules in 897 ms. Remains 160 /160 variables (removed 0) and now considering 5405/5405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 897 ms. Remains : 160/160 places, 5405/5405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 5405/5405 transitions.
Applied a total of 0 rules in 976 ms. Remains 160 /160 variables (removed 0) and now considering 5405/5405 (removed 0) transitions.
[2023-03-13 11:10:45] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
[2023-03-13 11:10:45] [INFO ] Invariant cache hit.
[2023-03-13 11:10:45] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-13 11:10:45] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
[2023-03-13 11:10:45] [INFO ] Invariant cache hit.
[2023-03-13 11:10:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-13 11:10:48] [INFO ] Implicit Places using invariants and state equation in 2994 ms returned []
Implicit Place search using SMT with State Equation took 3448 ms to find 0 implicit places.
[2023-03-13 11:10:49] [INFO ] Redundant transitions in 429 ms returned []
[2023-03-13 11:10:49] [INFO ] Flow matrix only has 407 transitions (discarded 4998 similar events)
[2023-03-13 11:10:49] [INFO ] Invariant cache hit.
[2023-03-13 11:10:50] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6777 ms. Remains : 160/160 places, 5405/5405 transitions.
Ensure Unique test removed 4998 transitions
Reduce isomorphic transitions removed 4998 transitions.
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4998 place count 160 transition count 407
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5000 place count 160 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5002 place count 158 transition count 405
Applied a total of 5002 rules in 32 ms. Remains 158 /160 variables (removed 2) and now considering 405/5405 (removed 5000) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 405 rows 158 cols
[2023-03-13 11:10:51] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 11:10:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:10:51] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 11:10:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:10:51] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 11:10:52] [INFO ] After 325ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:52] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-13 11:10:52] [INFO ] After 1339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-13 11:10:52] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 11:10:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 5405 transitions and 41916 arcs took 41 ms.
[2023-03-13 11:10:54] [INFO ] Flatten gal took : 576 ms
Total runtime 62082 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_V50P50N50
(NrP: 160 NrTr: 5405 NrArc: 41916)

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

net check time: 0m 0.005sec

init dd package: 0m 3.423sec

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

5925 8933 10446 12891 159261 680119 680122 680119 680119 680122 680119 685664 685658 685647 685641 685629 687921 692291 692286 692275 692269 692260 696952 700049 700040 700035 700023 700014 705881 708934 708929 708918 708912 708900 715935 718946 718941 718930 718921 718913 727111 730085 730074 730065 730060 730048 739351 742340 742329 742320 742315 742303 742293 755709 755701 755690 755681 755676 755667 770184 770176 770168 770159 770154 770145 785766 785755 785747 785738 785733 785722 799591 802430 802422 802414 802403 802394 802385 820187 820179 820171 820160 820151 820146 839018 839010 839002 838994 838986 838974 856186 858902 858894 858886 858878 858869 858864 879848 879840 879832 879824 879815 879810 899186 901827

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

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