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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 17K Feb 25 12:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 365K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:31 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 7.1K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 349K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 363K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 777K Feb 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M Feb 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 3.1M 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-V80P20N20-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678707416040

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-V80P20N20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:36:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:36:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:36:58] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2023-03-13 11:36:58] [INFO ] Transformed 198 places.
[2023-03-13 11:36:58] [INFO ] Transformed 3728 transitions.
[2023-03-13 11:36:58] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1531 ms. (steps per millisecond=6 ) properties (out of 16) seen :3
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1349 ms. (steps per millisecond=7 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 1264 ms. (steps per millisecond=7 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 2547 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 2044 ms. (steps per millisecond=4 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-13 11:37:11] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2023-03-13 11:37:11] [INFO ] Computed 7 place invariants in 31 ms
[2023-03-13 11:37:28] [INFO ] [Real]Absence check using 7 positive place invariants in 42 ms returned sat
[2023-03-13 11:37:28] [INFO ] After 1275ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:11
[2023-03-13 11:37:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 11:37:30] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :5
[2023-03-13 11:37:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 11:37:32] [INFO ] After 2428ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :8 sat :5
[2023-03-13 11:37:34] [INFO ] Deduced a trap composed of 24 places in 723 ms of which 6 ms to minimize.
[2023-03-13 11:37:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 746 ms
[2023-03-13 11:37:34] [INFO ] After 4698ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :4
Attempting to minimize the solution found.
Minimization took 1619 ms.
[2023-03-13 11:37:36] [INFO ] After 8331ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :4
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 48 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 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 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 3726
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 192 transition count 3725
Applied a total of 8 rules in 1146 ms. Remains 192 /198 variables (removed 6) and now considering 3725/3728 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1148 ms. Remains : 192/198 places, 3725/3728 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 114151 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114151 steps, saw 39226 distinct states, run finished after 3008 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 11:37:41] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
// Phase 1: matrix 407 rows 192 cols
[2023-03-13 11:37:41] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-13 11:37:41] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 11:37:42] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 11:37:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:37:43] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 11:37:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 11:37:44] [INFO ] After 859ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 11:37:44] [INFO ] After 1724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 759 ms.
[2023-03-13 11:37:45] [INFO ] After 3411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 54 ms.
Support contains 48 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 3725/3725 transitions.
Applied a total of 0 rules in 608 ms. Remains 192 /192 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 192/192 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 3725/3725 transitions.
Applied a total of 0 rules in 446 ms. Remains 192 /192 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2023-03-13 11:37:46] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-13 11:37:46] [INFO ] Invariant cache hit.
[2023-03-13 11:37:47] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-13 11:37:47] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-13 11:37:47] [INFO ] Invariant cache hit.
[2023-03-13 11:37:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 11:37:48] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1966 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 190/192 places, 3725/3725 transitions.
Applied a total of 0 rules in 432 ms. Remains 190 /190 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2849 ms. Remains : 190/192 places, 3725/3725 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 137523 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137523 steps, saw 47132 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 11:37:52] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
// Phase 1: matrix 407 rows 190 cols
[2023-03-13 11:37:52] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 11:37:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:37:53] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 11:37:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-13 11:37:53] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 11:37:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 11:37:54] [INFO ] After 986ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 11:37:55] [INFO ] After 1829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-13 11:37:56] [INFO ] After 2790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 54 ms.
Support contains 48 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 3725/3725 transitions.
Applied a total of 0 rules in 523 ms. Remains 190 /190 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 190/190 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 3725/3725 transitions.
Applied a total of 0 rules in 500 ms. Remains 190 /190 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2023-03-13 11:37:57] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-13 11:37:57] [INFO ] Invariant cache hit.
[2023-03-13 11:37:57] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-13 11:37:57] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-13 11:37:57] [INFO ] Invariant cache hit.
[2023-03-13 11:37:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 11:37:58] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
[2023-03-13 11:37:59] [INFO ] Redundant transitions in 308 ms returned []
[2023-03-13 11:37:59] [INFO ] Flow matrix only has 407 transitions (discarded 3318 similar events)
[2023-03-13 11:37:59] [INFO ] Invariant cache hit.
[2023-03-13 11:38:00] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3642 ms. Remains : 190/190 places, 3725/3725 transitions.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 190 transition count 407
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3320 place count 190 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3322 place count 188 transition count 405
Applied a total of 3322 rules in 20 ms. Remains 188 /190 variables (removed 2) and now considering 405/3725 (removed 3320) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 405 rows 188 cols
[2023-03-13 11:38:00] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-13 11:38:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:38:00] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 11:38:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 11:38:00] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 11:38:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 11:38:01] [INFO ] After 141ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 11:38:01] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-13 11:38:01] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 11:38:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-13 11:38:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 3725 transitions and 28176 arcs took 52 ms.
[2023-03-13 11:38:02] [INFO ] Flatten gal took : 302 ms
Total runtime 64003 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_V80P20N20
(NrP: 190 NrTr: 3725 NrArc: 28176)

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

net check time: 0m 0.003sec

init dd package: 0m 2.995sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9940224 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16084668 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.009sec

4045 4224 4400 4457 4629 4799 4966 5023 5184 5341 5495 5552 5702 5850 5995 6137 6193 6332 6468 6601 6730 6857 6981 7102 16302 16417 16388 16359 16330 16300 16271 16242 16127 16098 16068 16039 16010 15980 15951 15836 15807 15777 15658 15629 15513 15484 15369 15340 15224 15109 14994 14879 14677 14558 14256 14070 13611 163443 1111794 1111792 1111961 1111793 1115793 1115759 1119718 1120281 1123641 1127578 1127567 1131504 1131493 1135430 1135419 1139356 1139345 1143283 1143271 1147210 1147200 1151137 1151125 1155064 1155053 1158991 1158982 1162921 1162908 1166847 1166838 1170776 1170764 1171081 1174693 1174664 1178622 1178591 1182917 1182974 1183031 1183087 1183144 1183201 1183258 1183314 1183369 1183424 1183481 1183535 1183590 1183645 1183700 1183687 1183811 1183866 1183921 1183975 1184030 1184085 1184140 1184196 1184251 1183288 1183277 1187552 1187609 1187665 1187722 1187779 1187836 1187892 1187949

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

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