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

About the Execution of Marcie+red for BugTracking-PT-q8m064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5593.256 3600000.00 3651914.00 667.60 FF?FFTTFFTTF?FF? 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-167813695700426.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 BugTracking-PT-q8m064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 07:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m064-CTLFireability-00
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-01
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-02
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-03
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-04
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-05
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-06
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-07
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-08
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-09
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-10
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-11
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-12
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-13
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-14
FORMULA_NAME BugTracking-PT-q8m064-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678723455906

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=BugTracking-PT-q8m064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:04:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 16:04:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:04:18] [INFO ] Load time of PNML (sax parser for PT used): 695 ms
[2023-03-13 16:04:18] [INFO ] Transformed 754 places.
[2023-03-13 16:04:18] [INFO ] Transformed 27370 transitions.
[2023-03-13 16:04:18] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 899 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 474 places in 118 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m064-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Applied a total of 2 rules in 108 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2023-03-13 16:04:18] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2023-03-13 16:04:18] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-13 16:04:19] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-13 16:04:19] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-13 16:04:19] [INFO ] Invariant cache hit.
[2023-03-13 16:04:20] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 16:04:21] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2686 ms to find 0 implicit places.
[2023-03-13 16:04:21] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-13 16:04:21] [INFO ] Invariant cache hit.
[2023-03-13 16:04:22] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3904/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3993 ms. Remains : 278/280 places, 3904/3904 transitions.
Support contains 13 out of 278 places after structural reductions.
[2023-03-13 16:04:23] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-13 16:04:23] [INFO ] Flatten gal took : 420 ms
[2023-03-13 16:04:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m064-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:04:23] [INFO ] Flatten gal took : 264 ms
[2023-03-13 16:04:24] [INFO ] Input system was already deterministic with 3904 transitions.
Support contains 6 out of 278 places (down from 13) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 136283 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136283 steps, saw 67927 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 16:04:27] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-13 16:04:27] [INFO ] Invariant cache hit.
[2023-03-13 16:04:27] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-13 16:04:28] [INFO ] After 1091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:04:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:04:29] [INFO ] After 1059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:04:29] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 16:04:30] [INFO ] After 574ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 16:04:30] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 5 ms to minimize.
[2023-03-13 16:04:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 478 ms
[2023-03-13 16:04:31] [INFO ] After 1396ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-13 16:04:31] [INFO ] After 2744ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 269 transition count 3871
Applied a total of 18 rules in 451 ms. Remains 269 /278 variables (removed 9) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 269/278 places, 3871/3904 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131406 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131406 steps, saw 52625 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:04:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:04:34] [INFO ] Computed 8 place invariants in 38 ms
[2023-03-13 16:04:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:04:35] [INFO ] After 969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:04:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:04:36] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:04:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:04:37] [INFO ] After 361ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:04:37] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 1 ms to minimize.
[2023-03-13 16:04:37] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 1 ms to minimize.
[2023-03-13 16:04:38] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-13 16:04:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1213 ms
[2023-03-13 16:04:38] [INFO ] After 1693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-13 16:04:38] [INFO ] After 2663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 88 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:04:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:04:38] [INFO ] Invariant cache hit.
[2023-03-13 16:04:39] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-13 16:04:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:04:39] [INFO ] Invariant cache hit.
[2023-03-13 16:04:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:04:40] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2023-03-13 16:04:41] [INFO ] Redundant transitions in 384 ms returned []
[2023-03-13 16:04:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:04:41] [INFO ] Invariant cache hit.
[2023-03-13 16:04:42] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4005 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 266 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-13 16:04:42] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-13 16:04:43] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 16:04:43] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:04:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 16:04:44] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:04:44] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-13 16:04:44] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q8m064-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:04:45] [INFO ] Flatten gal took : 207 ms
[2023-03-13 16:04:45] [INFO ] Flatten gal took : 227 ms
[2023-03-13 16:04:45] [INFO ] Input system was already deterministic with 3904 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 55 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:04:45] [INFO ] Flatten gal took : 137 ms
[2023-03-13 16:04:46] [INFO ] Flatten gal took : 199 ms
[2023-03-13 16:04:46] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 33 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:04:46] [INFO ] Flatten gal took : 126 ms
[2023-03-13 16:04:46] [INFO ] Flatten gal took : 146 ms
[2023-03-13 16:04:47] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 24 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:04:47] [INFO ] Flatten gal took : 124 ms
[2023-03-13 16:04:47] [INFO ] Flatten gal took : 135 ms
[2023-03-13 16:04:47] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-13 16:04:48] [INFO ] Flatten gal took : 209 ms
[2023-03-13 16:04:48] [INFO ] Flatten gal took : 235 ms
[2023-03-13 16:04:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 16:04:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 278 places, 3904 transitions and 19190 arcs took 39 ms.
Total runtime 30823 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: 278 NrTr: 3904 NrArc: 19190)

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

net check time: 0m 0.003sec

init dd package: 0m 3.387sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 10536420 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16084428 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.062sec

17021 36395 54061 62567 110268 128349 141416 128055 204076

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="BugTracking-PT-q8m064"
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 BugTracking-PT-q8m064, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695700426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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