About the Execution of Marcie+red for GPPP-PT-C0001N0000000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5520.327 | 12704.00 | 18779.00 | 243.80 | TFTFTFFFFTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857800790.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is GPPP-PT-C0001N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800790
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678638987036
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=GPPP-PT-C0001N0000000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:36:28] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-12 16:36:28] [INFO ] Transformed 33 places.
[2023-03-12 16:36:28] [INFO ] Transformed 22 transitions.
[2023-03-12 16:36:28] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10002 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 16) seen :1
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 441083 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 441083 steps, saw 119827 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:36:32] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-12 16:36:32] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 16:36:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:36:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 16:36:32] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :1
[2023-03-12 16:36:32] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 16:36:32] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :1
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1095 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=273 )
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 4093 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: GPPP_PT_C0001N0000000100
(NrP: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.747sec
RS generation: 0m 0.080sec
-> reachability set: #nodes 1358 (1.4e+03) #states 145,476,966 (8)
starting MCC model checker
--------------------------
checking: EF [38<=_2PG]
normalized: E [true U 38<=_2PG]
abstracting: (38<=_2PG)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [104<=DHAP]
normalized: E [true U 104<=DHAP]
abstracting: (104<=DHAP)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [Gluc<=323]
normalized: ~ [E [true U ~ [Gluc<=323]]]
abstracting: (Gluc<=323)
states: 145,476,966 (8)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [184<=_3PG]
normalized: E [true U 184<=_3PG]
abstracting: (184<=_3PG)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[~ [179<=a1] & 331<=c2]]
normalized: E [true U [~ [179<=a1] & 331<=c2]]
abstracting: (331<=c2)
states: 0
abstracting: (179<=a1)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [R5P<=Pi]]
normalized: E [true U ~ [R5P<=Pi]]
abstracting: (R5P<=Pi)
states: 145,476,966 (8)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[183<=F6P & 172<=Xu5P] | [~ [[[324<=FBP & ATP<=390] & [c1<=352 & _3PG<=NADPH]]] | b2<=NADplus]]]
normalized: ~ [E [true U ~ [[[b2<=NADplus | ~ [[[c1<=352 & _3PG<=NADPH] & [324<=FBP & ATP<=390]]]] | [183<=F6P & 172<=Xu5P]]]]]
abstracting: (172<=Xu5P)
states: 0
abstracting: (183<=F6P)
states: 0
abstracting: (ATP<=390)
states: 0
abstracting: (324<=FBP)
states: 0
abstracting: (_3PG<=NADPH)
states: 144,985,702 (8)
abstracting: (c1<=352)
states: 145,476,966 (8)
abstracting: (b2<=NADplus)
states: 145,476,966 (8)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.080sec
checking: AG [[~ [[NADplus<=Ru5P | [[[387<=Pyr & ~ [[a2<=174 | GSSG<=192]]] | ~ [[152<=c2 & GAP<=230]]] & 199<=G6P]]] & NADPH<=313]]
normalized: ~ [E [true U ~ [[NADPH<=313 & ~ [[NADplus<=Ru5P | [199<=G6P & [~ [[152<=c2 & GAP<=230]] | [387<=Pyr & ~ [[a2<=174 | GSSG<=192]]]]]]]]]]]
abstracting: (GSSG<=192)
states: 145,476,966 (8)
abstracting: (a2<=174)
states: 145,476,966 (8)
abstracting: (387<=Pyr)
states: 0
abstracting: (GAP<=230)
states: 145,476,966 (8)
abstracting: (152<=c2)
states: 0
abstracting: (199<=G6P)
states: 0
abstracting: (NADplus<=Ru5P)
states: 0
abstracting: (NADPH<=313)
states: 145,476,966 (8)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [~ [[[~ [[R5P<=18 | [[277<=Gluc & GSSG<=Pi] | [b1<=start | S7P<=376]]]] | ~ [PEP<=_1_3_BPG]] & NADPplus<=101]]]
normalized: ~ [E [true U [NADPplus<=101 & [~ [PEP<=_1_3_BPG] | ~ [[R5P<=18 | [[b1<=start | S7P<=376] | [277<=Gluc & GSSG<=Pi]]]]]]]]
abstracting: (GSSG<=Pi)
states: 5,655,537 (6)
abstracting: (277<=Gluc)
states: 0
abstracting: (S7P<=376)
states: 145,476,966 (8)
abstracting: (b1<=start)
states: 406,020 (5)
abstracting: (R5P<=18)
states: 145,476,966 (8)
abstracting: (PEP<=_1_3_BPG)
states: 101,789,214 (8)
abstracting: (NADPplus<=101)
states: 73,824,132 (7)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.607sec
checking: EF [~ [[FBP<=185 & ~ [[[[~ [[c2<=c2 | G6P<=343]] & ~ [[start<=NADH & Gluc<=384]]] | NADplus<=122] | [[[[c1<=_2PG | NADPH<=209] & [_3PG<=c2 | Xu5P<=DHAP]] & [~ [_2PG<=c1] | [111<=Xu5P & Lac<=2]]] | ~ [[~ [179<=NADPH] | NADPplus<=170]]]]]]]]
normalized: E [true U ~ [[FBP<=185 & ~ [[[[[~ [_2PG<=c1] | [111<=Xu5P & Lac<=2]] & [[_3PG<=c2 | Xu5P<=DHAP] & [c1<=_2PG | NADPH<=209]]] | ~ [[NADPplus<=170 | ~ [179<=NADPH]]]] | [NADplus<=122 | [~ [[start<=NADH & Gluc<=384]] & ~ [[c2<=c2 | G6P<=343]]]]]]]]]
abstracting: (G6P<=343)
states: 145,476,966 (8)
abstracting: (c2<=c2)
states: 145,476,966 (8)
abstracting: (Gluc<=384)
states: 145,476,966 (8)
abstracting: (start<=NADH)
states: 145,456,665 (8)
abstracting: (NADplus<=122)
states: 0
abstracting: (179<=NADPH)
states: 15,922,852 (7)
abstracting: (NADPplus<=170)
states: 123,763,986 (8)
abstracting: (NADPH<=209)
states: 145,476,966 (8)
abstracting: (c1<=_2PG)
states: 4,872,240 (6)
abstracting: (Xu5P<=DHAP)
states: 139,691,181 (8)
abstracting: (_3PG<=c2)
states: 128,606,835 (8)
abstracting: (Lac<=2)
states: 136,605,429 (8)
abstracting: (111<=Xu5P)
states: 0
abstracting: (_2PG<=c1)
states: 145,476,966 (8)
abstracting: (FBP<=185)
states: 145,476,966 (8)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [~ [[[[[[NADPH<=12 | 192<=Pi] & [b1<=88 & R5P<=FBP]] & [Lac<=229 & 170<=GSSG]] | [[[NADH<=285 & FBP<=FBP] | [Pi<=390 & 263<=Pi]] | [[FBP<=90 | DHAP<=Pi] & Gluc<=a2]]] | [[~ [_1_3_BPG<=115] & [~ [344<=FBP] & [b1<=ADP & 282<=NADPH]]] & 322<=DHAP]]]]
normalized: E [true U ~ [[[322<=DHAP & [[[b1<=ADP & 282<=NADPH] & ~ [344<=FBP]] & ~ [_1_3_BPG<=115]]] | [[[Gluc<=a2 & [FBP<=90 | DHAP<=Pi]] | [[Pi<=390 & 263<=Pi] | [NADH<=285 & FBP<=FBP]]] | [[Lac<=229 & 170<=GSSG] & [[b1<=88 & R5P<=FBP] & [NADPH<=12 | 192<=Pi]]]]]]]
abstracting: (192<=Pi)
states: 0
abstracting: (NADPH<=12)
states: 9,408,958 (6)
abstracting: (R5P<=FBP)
states: 144,664,926 (8)
abstracting: (b1<=88)
states: 145,476,966 (8)
abstracting: (170<=GSSG)
states: 0
abstracting: (Lac<=229)
states: 145,476,966 (8)
abstracting: (FBP<=FBP)
states: 145,476,966 (8)
abstracting: (NADH<=285)
states: 145,476,966 (8)
abstracting: (263<=Pi)
states: 0
abstracting: (Pi<=390)
states: 145,476,966 (8)
abstracting: (DHAP<=Pi)
states: 145,476,966 (8)
abstracting: (FBP<=90)
states: 145,476,966 (8)
abstracting: (Gluc<=a2)
states: 144,786,732 (8)
abstracting: (_1_3_BPG<=115)
states: 145,476,966 (8)
abstracting: (344<=FBP)
states: 0
abstracting: (282<=NADPH)
states: 0
abstracting: (b1<=ADP)
states: 143,710,779 (8)
abstracting: (322<=DHAP)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [[~ [[[[FBP<=NADPplus | [[[261<=FBP | ~ [60<=GAP]] & [~ [294<=NADPplus] & ~ [c2<=290]]] | [[~ [Xu5P<=_1_3_BPG] | NADPH<=Lac] & ~ [[GSH<=c1 & 316<=a2]]]]] & [[~ [Pi<=206] | ~ [b1<=5]] | ~ [[start<=232 & [[NADPH<=335 & 350<=c1] & [_1_3_BPG<=NADH & a2<=308]]]]]] | [b2<=151 | [PEP<=178 & Pyr<=230]]]] & ~ [[[~ [Lac<=Gluc] & b2<=286] | 271<=NADPH]]]]
normalized: E [true U [~ [[271<=NADPH | [b2<=286 & ~ [Lac<=Gluc]]]] & ~ [[[b2<=151 | [PEP<=178 & Pyr<=230]] | [[~ [[start<=232 & [[_1_3_BPG<=NADH & a2<=308] & [NADPH<=335 & 350<=c1]]]] | [~ [b1<=5] | ~ [Pi<=206]]] & [FBP<=NADPplus | [[~ [[GSH<=c1 & 316<=a2]] & [NADPH<=Lac | ~ [Xu5P<=_1_3_BPG]]] | [[~ [c2<=290] & ~ [294<=NADPplus]] & [261<=FBP | ~ [60<=GAP]]]]]]]]]]
abstracting: (60<=GAP)
states: 0
abstracting: (261<=FBP)
states: 0
abstracting: (294<=NADPplus)
states: 0
abstracting: (c2<=290)
states: 145,476,966 (8)
abstracting: (Xu5P<=_1_3_BPG)
states: 139,447,569 (8)
abstracting: (NADPH<=Lac)
states: 1,215,030 (6)
abstracting: (316<=a2)
states: 0
abstracting: (GSH<=c1)
states: 4,089,144 (6)
abstracting: (FBP<=NADPplus)
states: 145,337,182 (8)
abstracting: (Pi<=206)
states: 145,476,966 (8)
abstracting: (b1<=5)
states: 145,476,966 (8)
abstracting: (350<=c1)
states: 0
abstracting: (NADPH<=335)
states: 145,476,966 (8)
abstracting: (a2<=308)
states: 145,476,966 (8)
abstracting: (_1_3_BPG<=NADH)
states: 145,476,966 (8)
abstracting: (start<=232)
states: 145,476,966 (8)
abstracting: (Pyr<=230)
states: 145,476,966 (8)
abstracting: (PEP<=178)
states: 145,476,966 (8)
abstracting: (b2<=151)
states: 145,476,966 (8)
abstracting: (Lac<=Gluc)
states: 85,913,832 (7)
abstracting: (b2<=286)
states: 145,476,966 (8)
abstracting: (271<=NADPH)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: EF [[Gluc<=GSSG & [[[30<=E4P | [~ [F6P<=ATP] & [~ [[325<=DHAP | ~ [b1<=a2]]] | [~ [[359<=c1 & PEP<=E4P]] | [~ [Pyr<=151] | GAP<=226]]]]] | [[~ [[~ [NADPH<=G6P] & FBP<=NADPH]] | ~ [[[~ [ATP<=_1_3_BPG] & [a2<=NADH | 292<=NADH]] | [[R5P<=a2 | 46<=Ru5P] | [250<=_2PG & 75<=Gluc]]]]] | 149<=GSSG]] & ~ [R5P<=43]]]]
normalized: E [true U [Gluc<=GSSG & [~ [R5P<=43] & [[149<=GSSG | [~ [[[[250<=_2PG & 75<=Gluc] | [R5P<=a2 | 46<=Ru5P]] | [[a2<=NADH | 292<=NADH] & ~ [ATP<=_1_3_BPG]]]] | ~ [[FBP<=NADPH & ~ [NADPH<=G6P]]]]] | [30<=E4P | [[[[GAP<=226 | ~ [Pyr<=151]] | ~ [[359<=c1 & PEP<=E4P]]] | ~ [[325<=DHAP | ~ [b1<=a2]]]] & ~ [F6P<=ATP]]]]]]]
abstracting: (F6P<=ATP)
states: 145,476,966 (8)
abstracting: (b1<=a2)
states: 913,545 (5)
abstracting: (325<=DHAP)
states: 0
abstracting: (PEP<=E4P)
states: 91,882,326 (7)
abstracting: (359<=c1)
states: 0
abstracting: (Pyr<=151)
states: 145,476,966 (8)
abstracting: (GAP<=226)
states: 145,476,966 (8)
abstracting: (30<=E4P)
states: 0
abstracting: (NADPH<=G6P)
states: 774,064 (5)
abstracting: (FBP<=NADPH)
states: 145,337,182 (8)
abstracting: (ATP<=_1_3_BPG)
states: 0
abstracting: (292<=NADH)
states: 0
abstracting: (a2<=NADH)
states: 142,249,107 (8)
abstracting: (46<=Ru5P)
states: 0
abstracting: (R5P<=a2)
states: 145,375,461 (8)
abstracting: (75<=Gluc)
states: 0
abstracting: (250<=_2PG)
states: 0
abstracting: (149<=GSSG)
states: 0
abstracting: (R5P<=43)
states: 145,476,966 (8)
abstracting: (Gluc<=GSSG)
states: 145,376,868 (8)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.513sec
checking: AG [[[~ [[E4P<=132 & ~ [125<=ATP]]] & [[~ [[~ [[[_2PG<=Lac | PEP<=Pyr] & c2<=NADPplus]] | ~ [[b2<=ATP | 72<=G6P]]]] & [DHAP<=138 | ~ [[GSSG<=115 | ~ [134<=ATP]]]]] | ~ [[~ [317<=Gluc] | [[[Pi<=25 & NADPplus<=_1_3_BPG] & [[365<=G6P | G6P<=69] & [277<=_3PG | 141<=FBP]]] | 315<=NADPH]]]]] & ~ [[245<=NADH & [[_3PG<=200 & ~ [[272<=NADPH & _2PG<=E4P]]] & [Pi<=95 | FBP<=296]]]]]]
normalized: ~ [E [true U ~ [[~ [[245<=NADH & [[Pi<=95 | FBP<=296] & [_3PG<=200 & ~ [[272<=NADPH & _2PG<=E4P]]]]]] & [[~ [[[315<=NADPH | [[[277<=_3PG | 141<=FBP] & [365<=G6P | G6P<=69]] & [Pi<=25 & NADPplus<=_1_3_BPG]]] | ~ [317<=Gluc]]] | [[DHAP<=138 | ~ [[GSSG<=115 | ~ [134<=ATP]]]] & ~ [[~ [[b2<=ATP | 72<=G6P]] | ~ [[c2<=NADPplus & [_2PG<=Lac | PEP<=Pyr]]]]]]] & ~ [[E4P<=132 & ~ [125<=ATP]]]]]]]]
abstracting: (125<=ATP)
states: 145,476,966 (8)
abstracting: (E4P<=132)
states: 145,476,966 (8)
abstracting: (PEP<=Pyr)
states: 101,789,214 (8)
abstracting: (_2PG<=Lac)
states: 101,789,214 (8)
abstracting: (c2<=NADPplus)
states: 143,455,754 (8)
abstracting: (72<=G6P)
states: 0
abstracting: (b2<=ATP)
states: 145,476,966 (8)
abstracting: (134<=ATP)
states: 145,476,966 (8)
abstracting: (GSSG<=115)
states: 145,476,966 (8)
abstracting: (DHAP<=138)
states: 145,476,966 (8)
abstracting: (317<=Gluc)
states: 0
abstracting: (NADPplus<=_1_3_BPG)
states: 1,215,030 (6)
abstracting: (Pi<=25)
states: 145,476,966 (8)
abstracting: (G6P<=69)
states: 145,476,966 (8)
abstracting: (365<=G6P)
states: 0
abstracting: (141<=FBP)
states: 0
abstracting: (277<=_3PG)
states: 0
abstracting: (315<=NADPH)
states: 0
abstracting: (_2PG<=E4P)
states: 91,882,326 (7)
abstracting: (272<=NADPH)
states: 0
abstracting: (_3PG<=200)
states: 145,476,966 (8)
abstracting: (FBP<=296)
states: 145,476,966 (8)
abstracting: (Pi<=95)
states: 145,476,966 (8)
abstracting: (245<=NADH)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.188sec
checking: AG [[[~ [77<=S7P] & S7P<=72] | [~ [[[[[[[196<=NADPplus | 241<=a1] & [GSSG<=237 & DHAP<=62]] | [[_2PG<=NADPH & ATP<=137] | [_3PG<=_2PG & a1<=147]]] & [[~ [80<=GSH] | 226<=b2] | [[260<=S7P & GSSG<=GSH] & [c2<=NADH | 226<=NADplus]]]] | [[NADplus<=291 & [[NADPplus<=147 & a2<=E4P] | [371<=GAP & FBP<=GSH]]] & _3PG<=245]] & NADH<=GSSG]] & [~ [NADH<=c1] | DHAP<=132]]]]
normalized: ~ [E [true U ~ [[[[DHAP<=132 | ~ [NADH<=c1]] & ~ [[NADH<=GSSG & [[_3PG<=245 & [NADplus<=291 & [[371<=GAP & FBP<=GSH] | [NADPplus<=147 & a2<=E4P]]]] | [[[[c2<=NADH | 226<=NADplus] & [260<=S7P & GSSG<=GSH]] | [226<=b2 | ~ [80<=GSH]]] & [[[_3PG<=_2PG & a1<=147] | [_2PG<=NADPH & ATP<=137]] | [[GSSG<=237 & DHAP<=62] & [196<=NADPplus | 241<=a1]]]]]]]] | [S7P<=72 & ~ [77<=S7P]]]]]]
abstracting: (77<=S7P)
states: 0
abstracting: (S7P<=72)
states: 145,476,966 (8)
abstracting: (241<=a1)
states: 0
abstracting: (196<=NADPplus)
states: 3,618,830 (6)
abstracting: (DHAP<=62)
states: 145,476,966 (8)
abstracting: (GSSG<=237)
states: 145,476,966 (8)
abstracting: (ATP<=137)
states: 0
abstracting: (_2PG<=NADPH)
states: 144,985,702 (8)
abstracting: (a1<=147)
states: 145,476,966 (8)
abstracting: (_3PG<=_2PG)
states: 101,789,214 (8)
abstracting: (80<=GSH)
states: 87,862,326 (7)
abstracting: (226<=b2)
states: 0
abstracting: (GSSG<=GSH)
states: 96,504,522 (7)
abstracting: (260<=S7P)
states: 0
abstracting: (226<=NADplus)
states: 0
abstracting: (c2<=NADH)
states: 88,146,942 (7)
abstracting: (a2<=E4P)
states: 144,076,197 (8)
abstracting: (NADPplus<=147)
states: 107,117,368 (8)
abstracting: (FBP<=GSH)
states: 145,226,922 (8)
abstracting: (371<=GAP)
states: 0
abstracting: (NADplus<=291)
states: 145,476,966 (8)
abstracting: (_3PG<=245)
states: 145,476,966 (8)
abstracting: (NADH<=GSSG)
states: 140,588,646 (8)
abstracting: (NADH<=c1)
states: 145,476,966 (8)
abstracting: (DHAP<=132)
states: 145,476,966 (8)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.130sec
checking: AG [[~ [[~ [[[[c1<=GAP | [[E4P<=E4P & b1<=R5P] & 67<=a2]] | ~ [[344<=DHAP & [NADplus<=264 | E4P<=R5P]]]] & [[ATP<=186 & 305<=Gluc] | NADPplus<=ATP]]] & ~ [[b1<=PEP | DHAP<=362]]]] & [[[[~ [NADPplus<=DHAP] & [[~ [c1<=154] | [[F6P<=Lac & FBP<=NADPH] | [c2<=230 | 93<=b1]]] | _1_3_BPG<=5]] & [[[~ [[GAP<=236 | b2<=362]] & [[PEP<=c2 & E4P<=a1] & [GSH<=95 & b2<=c1]]] | 254<=b2] & [129<=b1 | ~ [[[a2<=Xu5P | NADH<=Ru5P] | [222<=GAP | 275<=c1]]]]]] | [NADPH<=311 | [[~ [[250<=F6P & 322<=E4P]] | [~ [[133<=_2PG & a1<=344]] | [~ [319<=ATP] | [GAP<=b1 & 245<=Pyr]]]] | start<=77]]] & [~ [[[[~ [281<=Pyr] & [Xu5P<=366 | 197<=G6P]] & ~ [[107<=c2 | ADP<=Pi]]] & ~ [[[S7P<=GSSG & Lac<=start] & 316<=R5P]]]] | ~ [[[[106<=FBP | [Pyr<=DHAP & 295<=S7P]] & [GSSG<=347 & _1_3_BPG<=_1_3_BPG]] & 286<=NADPH]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[286<=NADPH & [[GSSG<=347 & _1_3_BPG<=_1_3_BPG] & [106<=FBP | [Pyr<=DHAP & 295<=S7P]]]]] | ~ [[~ [[316<=R5P & [S7P<=GSSG & Lac<=start]]] & [~ [[107<=c2 | ADP<=Pi]] & [[Xu5P<=366 | 197<=G6P] & ~ [281<=Pyr]]]]]] & [[NADPH<=311 | [start<=77 | [[[[GAP<=b1 & 245<=Pyr] | ~ [319<=ATP]] | ~ [[133<=_2PG & a1<=344]]] | ~ [[250<=F6P & 322<=E4P]]]]] | [[[129<=b1 | ~ [[[222<=GAP | 275<=c1] | [a2<=Xu5P | NADH<=Ru5P]]]] & [254<=b2 | [[[GSH<=95 & b2<=c1] & [PEP<=c2 & E4P<=a1]] & ~ [[GAP<=236 | b2<=362]]]]] & [[_1_3_BPG<=5 | [[[c2<=230 | 93<=b1] | [F6P<=Lac & FBP<=NADPH]] | ~ [c1<=154]]] & ~ [NADPplus<=DHAP]]]]] & ~ [[~ [[b1<=PEP | DHAP<=362]] & ~ [[[NADPplus<=ATP | [ATP<=186 & 305<=Gluc]] & [~ [[344<=DHAP & [NADplus<=264 | E4P<=R5P]]] | [c1<=GAP | [67<=a2 & [E4P<=E4P & b1<=R5P]]]]]]]]]]]]
abstracting: (b1<=R5P)
states: 710,535 (5)
abstracting: (E4P<=E4P)
states: 145,476,966 (8)
abstracting: (67<=a2)
states: 0
abstracting: (c1<=GAP)
states: 14,210,700 (7)
abstracting: (E4P<=R5P)
states: 112,589,346 (8)
abstracting: (NADplus<=264)
states: 145,476,966 (8)
abstracting: (344<=DHAP)
states: 0
abstracting: (305<=Gluc)
states: 0
abstracting: (ATP<=186)
states: 0
abstracting: (NADPplus<=ATP)
states: 145,476,966 (8)
abstracting: (DHAP<=362)
states: 145,476,966 (8)
abstracting: (b1<=PEP)
states: 10,495,617 (7)
abstracting: (NADPplus<=DHAP)
states: 1,224,322 (6)
abstracting: (c1<=154)
states: 145,476,966 (8)
abstracting: (FBP<=NADPH)
states: 145,337,182 (8)
abstracting: (F6P<=Lac)
states: 128,647,437 (8)
abstracting: (93<=b1)
states: 0
abstracting: (c2<=230)
states: 145,476,966 (8)
abstracting: (_1_3_BPG<=5)
states: 145,314,558 (8)
abstracting: (b2<=362)
states: 145,476,966 (8)
abstracting: (GAP<=236)
states: 145,476,966 (8)
abstracting: (E4P<=a1)
states: 145,476,966 (8)
abstracting: (PEP<=c2)
states: 128,606,835 (8)
abstracting: (b2<=c1)
states: 144,908,538 (8)
abstracting: (GSH<=95)
states: 69,137,568 (7)
abstracting: (254<=b2)
states: 0
abstracting: (NADH<=Ru5P)
states: 9,297,858 (6)
abstracting: (a2<=Xu5P)
states: 119,714,997 (8)
abstracting: (275<=c1)
states: 0
abstracting: (222<=GAP)
states: 0
abstracting: (129<=b1)
states: 0
abstracting: (322<=E4P)
states: 0
abstracting: (250<=F6P)
states: 0
abstracting: (a1<=344)
states: 145,476,966 (8)
abstracting: (133<=_2PG)
states: 0
abstracting: (319<=ATP)
states: 145,476,966 (8)
abstracting: (245<=Pyr)
states: 0
abstracting: (GAP<=b1)
states: 142,025,796 (8)
abstracting: (start<=77)
states: 145,476,966 (8)
abstracting: (NADPH<=311)
states: 145,476,966 (8)
abstracting: (281<=Pyr)
states: 0
abstracting: (197<=G6P)
states: 0
abstracting: (Xu5P<=366)
states: 145,476,966 (8)
abstracting: (ADP<=Pi)
states: 203,010 (5)
abstracting: (107<=c2)
states: 0
abstracting: (Lac<=start)
states: 83,924,334 (7)
abstracting: (S7P<=GSSG)
states: 145,470,534 (8)
abstracting: (316<=R5P)
states: 0
abstracting: (295<=S7P)
states: 0
abstracting: (Pyr<=DHAP)
states: 101,789,214 (8)
abstracting: (106<=FBP)
states: 0
abstracting: (_1_3_BPG<=_1_3_BPG)
states: 145,476,966 (8)
abstracting: (GSSG<=347)
states: 145,476,966 (8)
abstracting: (286<=NADPH)
states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.141sec
totally nodes used: 667323 (6.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3583024 1330483 4913507
used/not used/entry size/cache size: 1642750 65466114 16 1024MB
basic ops cache: hits/miss/sum: 1268702 2196372 3465074
used/not used/entry size/cache size: 2809643 13967573 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 30446 31899 62345
used/not used/entry size/cache size: 31847 8356761 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66725963
1 379975
2 1867
3 110
4 24
5 16
6 49
7 9
8 6
9 5
>= 10 840
Total processing time: 0m 6.333sec
BK_STOP 1678638999740
--------------------
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.000sec
iterations count:15790 (717), effective:3705 (168)
initing FirstDep: 0m 0.000sec
iterations count:9721 (441), effective:2378 (108)
iterations count:400 (18), effective:93 (4)
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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r170-tall-167838857800790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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 '
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 ;