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.r394-oct2-167903718200694.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718200694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K Feb 25 21:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 21:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 21:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 21:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 21:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 21:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 685K 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 ShieldPPPt-PT-100A-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679531771960

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:36:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:36:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:36:14] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2023-03-23 00:36:14] [INFO ] Transformed 2503 places.
[2023-03-23 00:36:14] [INFO ] Transformed 1803 transitions.
[2023-03-23 00:36:14] [INFO ] Found NUPN structural information;
[2023-03-23 00:36:14] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 162132 steps, run timeout after 6005 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 12=1}
Probabilistic random walk after 162132 steps, saw 160758 distinct states, run finished after 6006 ms. (steps per millisecond=26 ) properties seen :10
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-23 00:36:23] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-23 00:36:24] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 00:36:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 286 ms returned sat
[2023-03-23 00:36:31] [INFO ] After 5847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 00:36:37] [INFO ] After 11500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4096 ms.
[2023-03-23 00:36:41] [INFO ] After 16707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 637 ms.
Support contains 36 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 379 times.
Drop transitions removed 379 transitions
Iterating global reduction 0 with 379 rules applied. Total rules applied 383 place count 2501 transition count 1800
Applied a total of 383 rules in 734 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93508 steps, run timeout after 3013 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93508 steps, saw 89990 distinct states, run finished after 3015 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-23 00:36:46] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-23 00:36:46] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 00:36:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 273 ms returned sat
[2023-03-23 00:36:52] [INFO ] After 4322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 00:36:52] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-23 00:36:54] [INFO ] After 2667ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 00:36:57] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 1 ms to minimize.
[2023-03-23 00:36:57] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-23 00:36:58] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:36:58] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 5 ms to minimize.
[2023-03-23 00:36:59] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 0 ms to minimize.
[2023-03-23 00:36:59] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 3 ms to minimize.
[2023-03-23 00:36:59] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 1 ms to minimize.
[2023-03-23 00:36:59] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-23 00:37:00] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-23 00:37:00] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-23 00:37:01] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:37:01] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-23 00:37:01] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-23 00:37:01] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-23 00:37:02] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-23 00:37:02] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-23 00:37:02] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-23 00:37:03] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2023-03-23 00:37:04] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-23 00:37:05] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-23 00:37:05] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 2 ms to minimize.
[2023-03-23 00:37:06] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:37:06] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-23 00:37:06] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-23 00:37:07] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 9883 ms
[2023-03-23 00:37:07] [INFO ] After 14842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3654 ms.
[2023-03-23 00:37:10] [INFO ] After 23883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 560 ms.
Support contains 36 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 147 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 134 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-23 00:37:11] [INFO ] Invariant cache hit.
[2023-03-23 00:37:14] [INFO ] Implicit Places using invariants in 3024 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3031 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 172 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-23 00:37:14] [INFO ] Computed 1100 place invariants in 13 ms
[2023-03-23 00:37:17] [INFO ] Implicit Places using invariants in 2737 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2743 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 413 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-23 00:37:17] [INFO ] Computed 1098 place invariants in 13 ms
[2023-03-23 00:37:19] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2023-03-23 00:37:19] [INFO ] Invariant cache hit.
[2023-03-23 00:37:20] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-23 00:37:26] [INFO ] Implicit Places using invariants and state equation in 6680 ms returned []
Implicit Place search using SMT with State Equation took 8088 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 14582 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 95408 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95408 steps, saw 91847 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 00:37:29] [INFO ] Invariant cache hit.
[2023-03-23 00:37:30] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 00:37:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 275 ms returned sat
[2023-03-23 00:37:33] [INFO ] After 2894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 00:37:33] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-23 00:37:37] [INFO ] After 3330ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 00:37:39] [INFO ] After 5660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 717 ms.
[2023-03-23 00:37:40] [INFO ] After 10060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 2538 steps, including 0 resets, run visited all 1 properties in 50 ms. (steps per millisecond=50 )
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 180 ms.
All properties solved without resorting to model-checking.
Total runtime 85959 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPt_PT_100A
(NrP: 2503 NrTr: 1803 NrArc: 7206)

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

net check time: 0m 0.000sec

init dd package: 0m 2.928sec


before gc: list nodes free: 1083007

after gc: idd nodes used:6315, unused:63993685; list nodes free:276783950

before gc: list nodes free: 2001861

after gc: idd nodes used:6673, unused:63993327; list nodes free:278878309

before gc: list nodes free: 1952480

after gc: idd nodes used:6078, unused:63993922; list nodes free:278881645

before gc: list nodes free: 1759528

after gc: idd nodes used:6444, unused:63993556; list nodes free:278879839

before gc: list nodes free: 1797989

after gc: idd nodes used:6358, unused:63993642; list nodes free:278880216

before gc: list nodes free: 1407660

after gc: idd nodes used:6199, unused:63993801; list nodes free:278880902

before gc: list nodes free: 1351623

after gc: idd nodes used:6749, unused:63993251; list nodes free:278878080

before gc: list nodes free: 1607462

after gc: idd nodes used:5926, unused:63994074; list nodes free:278882468

before gc: list nodes free: 1496164

after gc: idd nodes used:6526, unused:63993474; list nodes free:278879168

before gc: list nodes free: 1359422

after gc: idd nodes used:6082, unused:63993918; list nodes free:278881451

before gc: list nodes free: 1349339

after gc: idd nodes used:6197, unused:63993803; list nodes free:278880939

before gc: list nodes free: 961038

after gc: idd nodes used:6289, unused:63993711; list nodes free:278880331

before gc: list nodes free: 1095951

after gc: idd nodes used:6353, unused:63993647; list nodes free:278879820

before gc: list nodes free: 895113

after gc: idd nodes used:6626, unused:63993374; list nodes free:278878563

before gc: list nodes free: 942796

after gc: idd nodes used:6826, unused:63993174; list nodes free:278877510

before gc: list nodes free: 1147592

after gc: idd nodes used:6157, unused:63993843; list nodes free:278880882

before gc: list nodes free: 1099272

after gc: idd nodes used:6080, unused:63993920; list nodes free:278881371

before gc: list nodes free: 1399682

after gc: idd nodes used:5957, unused:63994043; list nodes free:278882117

before gc: list nodes free: 1273184

after gc: idd nodes used:6481, unused:63993519; list nodes free:278879640

before gc: list nodes free: 902859

after gc: idd nodes used:6228, unused:63993772; list nodes free:278880558

before gc: list nodes free: 914440

after gc: idd nodes used:6214, unused:63993786; list nodes free:278880712

before gc: list nodes free: 1095383

after gc: idd nodes used:6773, unused:63993227; list nodes free:278878101

before gc: list nodes free: 1117627

after gc: idd nodes used:6542, unused:63993458; list nodes free:278879231

before gc: list nodes free: 548608

after gc: idd nodes used:6888, unused:63993112; list nodes free:278876758

before gc: list nodes free: 886847

after gc: idd nodes used:6809, unused:63993191; list nodes free:278877570

before gc: list nodes free: 433302

after gc: idd nodes used:6841, unused:63993159; list nodes free:278877392

before gc: list nodes free: 574455

after gc: idd nodes used:6386, unused:63993614; list nodes free:278879741

before gc: list nodes free: 586014

after gc: idd nodes used:6243, unused:63993757; list nodes free:278880606

before gc: list nodes free: 413537

after gc: idd nodes used:6387, unused:63993613; list nodes free:278879768
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6348060 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096072 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 ReachabilityCardinality -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

5649 6264 6383 6732 5722 5870 5834 6686 6155 6328 6030 6191 6708 6424 6030 6512 6610 6322 6499 6264 6004 6629 6742 6580 6249 6435 6116 6321 6008 6132 5831 5997 6111 5845 6757 6425 6301 6857 6733 6892 6645 6364 6110 6836 6550 6272 6617 6305 6979 6638 6923 6591 6359 6604 6384 6236 6811 6982 6743 6461

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="ShieldPPPt-PT-100A"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-100A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718200694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-PT-100A execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;