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-167903718200662.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-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718200662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 21:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:02 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 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 21:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 268K 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-040A-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679528081814

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-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 23:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:34:44] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-22 23:34:44] [INFO ] Transformed 1003 places.
[2023-03-22 23:34:44] [INFO ] Transformed 723 transitions.
[2023-03-22 23:34:44] [INFO ] Found NUPN structural information;
[2023-03-22 23:34:44] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 11) seen :1
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 108596 steps, run timeout after 3018 ms. (steps per millisecond=35 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 108596 steps, saw 107387 distinct states, run finished after 3020 ms. (steps per millisecond=35 ) properties seen :7
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-22 23:34:49] [INFO ] Computed 441 place invariants in 19 ms
[2023-03-22 23:34:50] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-22 23:34:50] [INFO ] [Nat]Absence check using 441 positive place invariants in 79 ms returned sat
[2023-03-22 23:34:51] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 23:34:51] [INFO ] After 1278ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 794 ms.
[2023-03-22 23:34:52] [INFO ] After 2407ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 169 ms.
Support contains 45 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 142 times.
Drop transitions removed 142 transitions
Iterating global reduction 0 with 142 rules applied. Total rules applied 146 place count 1001 transition count 720
Applied a total of 146 rules in 228 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 187095 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{1=1}
Probabilistic random walk after 187095 steps, saw 181293 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :1
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 23:34:56] [INFO ] Computed 441 place invariants in 12 ms
[2023-03-22 23:34:56] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 23:34:56] [INFO ] [Nat]Absence check using 441 positive place invariants in 119 ms returned sat
[2023-03-22 23:34:57] [INFO ] After 974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 23:34:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 23:34:58] [INFO ] After 236ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 23:34:58] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-22 23:34:58] [INFO ] After 2021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 65 ms.
Support contains 34 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1001 transition count 720
Applied a total of 2 rules in 60 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1001/1001 places, 720/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 270971 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270971 steps, saw 263669 distinct states, run finished after 3005 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-22 23:35:01] [INFO ] Computed 441 place invariants in 11 ms
[2023-03-22 23:35:02] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 23:35:02] [INFO ] [Nat]Absence check using 441 positive place invariants in 94 ms returned sat
[2023-03-22 23:35:03] [INFO ] After 896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 23:35:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 23:35:03] [INFO ] After 337ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 23:35:04] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-22 23:35:04] [INFO ] After 1937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 77 ms.
Support contains 34 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 34 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1001/1001 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 26 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2023-03-22 23:35:04] [INFO ] Invariant cache hit.
[2023-03-22 23:35:05] [INFO ] Implicit Places using invariants in 882 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 889 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 720/720 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 1000 transition count 718
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 58 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-22 23:35:05] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-22 23:35:05] [INFO ] Implicit Places using invariants in 668 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 670 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 996/1001 places, 718/720 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 995 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 995 transition count 717
Applied a total of 2 rules in 82 ms. Remains 995 /996 variables (removed 1) and now considering 717/718 (removed 1) transitions.
// Phase 1: matrix 717 rows 995 cols
[2023-03-22 23:35:06] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 23:35:06] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-22 23:35:06] [INFO ] Invariant cache hit.
[2023-03-22 23:35:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-22 23:35:08] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 995/1001 places, 717/720 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4004 ms. Remains : 995/1001 places, 717/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 271452 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271452 steps, saw 264052 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 23:35:11] [INFO ] Invariant cache hit.
[2023-03-22 23:35:11] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 23:35:11] [INFO ] [Nat]Absence check using 438 positive place invariants in 71 ms returned sat
[2023-03-22 23:35:12] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 23:35:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-22 23:35:12] [INFO ] After 201ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 23:35:12] [INFO ] After 422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-22 23:35:13] [INFO ] After 1413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 714 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=32 )
FORMULA ShieldPPPt-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 22 ms.
All properties solved without resorting to model-checking.
Total runtime 28501 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_040A
(NrP: 1003 NrTr: 723 NrArc: 2886)

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

net check time: 0m 0.000sec

init dd package: 0m 3.138sec


before gc: list nodes free: 1813677

after gc: idd nodes used:2777, unused:63997223; list nodes free:278903333

before gc: list nodes free: 1345471

after gc: idd nodes used:2540, unused:63997460; list nodes free:278904375

before gc: list nodes free: 1246709

after gc: idd nodes used:2927, unused:63997073; list nodes free:278902209

before gc: list nodes free: 793564

after gc: idd nodes used:2888, unused:63997112; list nodes free:278902299

before gc: list nodes free: 502297

after gc: idd nodes used:2879, unused:63997121; list nodes free:278902366

before gc: list nodes free: 893428

after gc: idd nodes used:3037, unused:63996963; list nodes free:278901466

before gc: list nodes free: 168183

after gc: idd nodes used:3005, unused:63996995; list nodes free:278901510

before gc: list nodes free: 1565217

after gc: idd nodes used:2781, unused:63997219; list nodes free:280999861

before gc: list nodes free: 1350898

after gc: idd nodes used:2893, unused:63997107; list nodes free:280999392

before gc: list nodes free: 1774836

after gc: idd nodes used:2832, unused:63997168; list nodes free:280999774

before gc: list nodes free: 1744618

after gc: idd nodes used:3202, unused:63996798; list nodes free:280997762

before gc: list nodes free: 2159411

after gc: idd nodes used:3012, unused:63996988; list nodes free:280998664

before gc: list nodes free: 1914332

after gc: idd nodes used:2924, unused:63997076; list nodes free:280999147

before gc: list nodes free: 1884349

after gc: idd nodes used:2686, unused:63997314; list nodes free:281000329

before gc: list nodes free: 544046

after gc: idd nodes used:2818, unused:63997182; list nodes free:280999542

before gc: list nodes free: 1409135

after gc: idd nodes used:2996, unused:63997004; list nodes free:280998716

before gc: list nodes free: 176755

after gc: idd nodes used:2949, unused:63997051; list nodes free:280998864

before gc: list nodes free: 14486

after gc: idd nodes used:3272, unused:63996728; list nodes free:280997121

before gc: list nodes free: 1945280

after gc: idd nodes used:3152, unused:63996848; list nodes free:283095040

before gc: list nodes free: 1890181

after gc: idd nodes used:3238, unused:63996762; list nodes free:283094439

before gc: list nodes free: 1945736

after gc: idd nodes used:3229, unused:63996771; list nodes free:283094663

before gc: list nodes free: 2310638

after gc: idd nodes used:3185, unused:63996815; list nodes free:283094771

before gc: list nodes free: 2349473

after gc: idd nodes used:2959, unused:63997041; list nodes free:283096027

before gc: list nodes free: 2593947

after gc: idd nodes used:3158, unused:63996842; list nodes free:283094917

before gc: list nodes free: 2862836

after gc: idd nodes used:2892, unused:63997108; list nodes free:283096258

before gc: list nodes free: 2503638

after gc: idd nodes used:2896, unused:63997104; list nodes free:283096203

before gc: list nodes free: 3417064

after gc: idd nodes used:2968, unused:63997032; list nodes free:283095996

before gc: list nodes free: 2801593

after gc: idd nodes used:2941, unused:63997059; list nodes free:283096035

before gc: list nodes free: 2590723

after gc: idd nodes used:2848, unused:63997152; list nodes free:283096601

before gc: list nodes free: 1748949

after gc: idd nodes used:2830, unused:63997170; list nodes free:283096451

before gc: list nodes free: 2651712

after gc: idd nodes used:3100, unused:63996900; list nodes free:283095238

before gc: list nodes free: 2529156

after gc: idd nodes used:3078, unused:63996922; list nodes free:283095387

before gc: list nodes free: 2386458

after gc: idd nodes used:2961, unused:63997039; list nodes free:283095839

before gc: list nodes free: 1238813

after gc: idd nodes used:2997, unused:63997003; list nodes free:283095672

before gc: list nodes free: 2047927

after gc: idd nodes used:3220, unused:63996780; list nodes free:283094725
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6289300 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095312 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 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.002sec

2629 2564 2853 2878 2863 2979 3020 2700 2801 2920 3029 3030 3037 2633 2743 2776 2723 2767 2848 2878 2882 3023 3094 2932 2820 3033 2945 3115 2992 2895 3073 2939 2762 2820 2749 2854 2933 2937 2983 2969 2969 2972 2854 3090 2856 2806 2965 3062 3066 2977 2935 3169 3218 3119 2993 2850 2919 3154 3064 3020 2956 3229 3214 3106 2996 2952 2902 3075 3119 2983 2724 3094 3014 2809 2779 2709 2811 2759 2737 2769 2837 2766 2771 2770 2787 2975 3019 2925 3014 3013 2927 2971 3060 2928 2971 2852 2928 3190 3139 3139 3241 3095 3140 2984 2985 3022 3024 2928 3024 3237 3192 3102 3240 3148 3103 2984 2984 2931 2986 3287 2913 3150 3098 3055 3191 3057 3056 2937 3259 3246 3146 3192 3247 3101 3016 2930 2930 2974 2931 2872 3146 3098 3049 3005 3097 3043 2745 2745 2782 2758 2783 3138 2785 2784 2988 2940 2808 3140 2840 3171 2810 2809 3177 3132 2861 3057 2770 2984 2908 2869 3041 2953 3042 3000 2955 2903 3045 2993 2951 2994 2994 2919 3083 2952 2996 3039 2952 2944 3083 2989 2989 2876 2990 2945 2893 3205 3252 3155 3246 3156 3156 3247 3203 3110 3248 3157 3149 3039

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

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