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

About the Execution of Marcie+red for SafeBus-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6360.140 3600000.00 3640236.00 11089.70 ???FF???F??T???F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r362-smll-167891812500274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SafeBus-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812500274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 19K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 393K Feb 26 01:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 26 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 26 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 244K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 SafeBus-PT-10-CTLFireability-00
FORMULA_NAME SafeBus-PT-10-CTLFireability-01
FORMULA_NAME SafeBus-PT-10-CTLFireability-02
FORMULA_NAME SafeBus-PT-10-CTLFireability-03
FORMULA_NAME SafeBus-PT-10-CTLFireability-04
FORMULA_NAME SafeBus-PT-10-CTLFireability-05
FORMULA_NAME SafeBus-PT-10-CTLFireability-06
FORMULA_NAME SafeBus-PT-10-CTLFireability-07
FORMULA_NAME SafeBus-PT-10-CTLFireability-08
FORMULA_NAME SafeBus-PT-10-CTLFireability-09
FORMULA_NAME SafeBus-PT-10-CTLFireability-10
FORMULA_NAME SafeBus-PT-10-CTLFireability-11
FORMULA_NAME SafeBus-PT-10-CTLFireability-12
FORMULA_NAME SafeBus-PT-10-CTLFireability-13
FORMULA_NAME SafeBus-PT-10-CTLFireability-14
FORMULA_NAME SafeBus-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679086854965

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 21:00:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 21:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 21:00:59] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2023-03-17 21:00:59] [INFO ] Transformed 316 places.
[2023-03-17 21:00:59] [INFO ] Transformed 1631 transitions.
[2023-03-17 21:00:59] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 54 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 306 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 36 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 21:00:59] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 21:00:59] [INFO ] Computed 45 place invariants in 56 ms
[2023-03-17 21:01:00] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-17 21:01:00] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 21:01:00] [INFO ] Invariant cache hit.
[2023-03-17 21:01:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 21:01:00] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2023-03-17 21:01:00] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 21:01:00] [INFO ] Invariant cache hit.
[2023-03-17 21:01:02] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 12 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2732 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 306 out of 306 places after structural reductions.
[2023-03-17 21:01:03] [INFO ] Flatten gal took : 362 ms
[2023-03-17 21:01:03] [INFO ] Flatten gal took : 207 ms
[2023-03-17 21:01:04] [INFO ] Input system was already deterministic with 1531 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 991 ms. (steps per millisecond=10 ) properties (out of 79) seen :57
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-17 21:01:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 21:01:06] [INFO ] Computed 45 place invariants in 20 ms
[2023-03-17 21:01:07] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-17 21:01:07] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-17 21:01:07] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:12
[2023-03-17 21:01:07] [INFO ] [Nat]Absence check using 24 positive place invariants in 14 ms returned sat
[2023-03-17 21:01:07] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 21:01:08] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :2
[2023-03-17 21:01:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 21:01:08] [INFO ] After 385ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :15 sat :2
[2023-03-17 21:01:08] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-17 21:01:09] [INFO ] After 1590ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :2
Fused 17 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 306 transition count 1521
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 296 transition count 1521
Applied a total of 20 rules in 808 ms. Remains 296 /306 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 810 ms. Remains : 296/306 places, 1521/1531 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :1
Finished Best-First random walk after 4609 steps, including 1 resets, run visited all 1 properties in 21 ms. (steps per millisecond=219 )
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA SafeBus-PT-10-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 21:01:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-17 21:01:10] [INFO ] Flatten gal took : 151 ms
FORMULA SafeBus-PT-10-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 21:01:10] [INFO ] Flatten gal took : 128 ms
[2023-03-17 21:01:11] [INFO ] Input system was already deterministic with 1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:11] [INFO ] Flatten gal took : 61 ms
[2023-03-17 21:01:11] [INFO ] Flatten gal took : 69 ms
[2023-03-17 21:01:11] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:11] [INFO ] Flatten gal took : 62 ms
[2023-03-17 21:01:11] [INFO ] Flatten gal took : 73 ms
[2023-03-17 21:01:11] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:11] [INFO ] Flatten gal took : 63 ms
[2023-03-17 21:01:12] [INFO ] Flatten gal took : 72 ms
[2023-03-17 21:01:12] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 254 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 260 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:12] [INFO ] Flatten gal took : 63 ms
[2023-03-17 21:01:12] [INFO ] Flatten gal took : 72 ms
[2023-03-17 21:01:12] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:12] [INFO ] Flatten gal took : 69 ms
[2023-03-17 21:01:13] [INFO ] Flatten gal took : 92 ms
[2023-03-17 21:01:13] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 212 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 213 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:13] [INFO ] Flatten gal took : 53 ms
[2023-03-17 21:01:13] [INFO ] Flatten gal took : 65 ms
[2023-03-17 21:01:13] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 230 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 231 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:13] [INFO ] Flatten gal took : 56 ms
[2023-03-17 21:01:14] [INFO ] Flatten gal took : 59 ms
[2023-03-17 21:01:14] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:14] [INFO ] Flatten gal took : 51 ms
[2023-03-17 21:01:14] [INFO ] Flatten gal took : 58 ms
[2023-03-17 21:01:14] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 122 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 124 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:14] [INFO ] Flatten gal took : 51 ms
[2023-03-17 21:01:14] [INFO ] Flatten gal took : 59 ms
[2023-03-17 21:01:14] [INFO ] Input system was already deterministic with 1531 transitions.
Finished random walk after 5865 steps, including 1 resets, run visited all 1 properties in 60 ms. (steps per millisecond=97 )
FORMULA SafeBus-PT-10-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 134 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 135 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:14] [INFO ] Flatten gal took : 59 ms
[2023-03-17 21:01:15] [INFO ] Flatten gal took : 59 ms
[2023-03-17 21:01:15] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:15] [INFO ] Flatten gal took : 51 ms
[2023-03-17 21:01:15] [INFO ] Flatten gal took : 59 ms
[2023-03-17 21:01:15] [INFO ] Input system was already deterministic with 1531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 306/306 places, 1531/1531 transitions.
[2023-03-17 21:01:15] [INFO ] Flatten gal took : 51 ms
[2023-03-17 21:01:15] [INFO ] Flatten gal took : 58 ms
[2023-03-17 21:01:15] [INFO ] Input system was already deterministic with 1531 transitions.
[2023-03-17 21:01:15] [INFO ] Flatten gal took : 103 ms
[2023-03-17 21:01:16] [INFO ] Flatten gal took : 105 ms
[2023-03-17 21:01:16] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 40 ms.
[2023-03-17 21:01:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 13 ms.
Total runtime 17491 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 306 NrTr: 1531 NrArc: 10404)

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

net check time: 0m 0.002sec

init dd package: 0m 3.476sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9781436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094556 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.011sec

579708 904236 1155582 1389948

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="SafeBus-PT-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is SafeBus-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r362-smll-167891812500274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;