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-167838857800854.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-C0100N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800854
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 10:41 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.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 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-C0100N0000000100-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678642367278

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-C0100N0000000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:32:49] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-12 17:32:49] [INFO ] Transformed 33 places.
[2023-03-12 17:32:49] [INFO ] Transformed 22 transitions.
[2023-03-12 17:32:49] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10030 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=167 ) properties (out of 16) seen :2
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:32:50] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 17:32:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 17:32:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 17:32:50] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-12 17:32:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:32:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:02] [INFO ] After 11893ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :0
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 20 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-12 17:33:02] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 17:33:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 24/33 places, 14/22 transitions.
Incomplete random walk after 10042 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3578650 steps, run timeout after 3001 ms. (steps per millisecond=1192 ) properties seen :{}
Probabilistic random walk after 3578650 steps, saw 595573 distinct states, run finished after 3002 ms. (steps per millisecond=1192 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:33:05] [INFO ] Invariant cache hit.
[2023-03-12 17:33:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:05] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:05] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:33:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 17:33:05] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:33:09] [INFO ] After 3952ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 20371 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_C0100N0000000100
(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.662sec


RS generation: 0m29.655sec


-> reachability set: #nodes 562750 (5.6e+05) #states 2,454,033,179,726,092 (15)



starting MCC model checker
--------------------------

checking: AG [~ [411<=Xu5P]]
normalized: ~ [E [true U 411<=Xu5P]]

abstracting: (411<=Xu5P)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.200sec

checking: AG [Lac<=237]
normalized: ~ [E [true U ~ [Lac<=237]]]

abstracting: (Lac<=237)
states: 2,454,033,179,726,092 (15)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.505sec

checking: AG [~ [428<=Ru5P]]
normalized: ~ [E [true U 428<=Ru5P]]

abstracting: (428<=Ru5P)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: EF [407<=NADH]
normalized: E [true U 407<=NADH]

abstracting: (407<=NADH)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.511sec

checking: AG [NADH<=482]
normalized: ~ [E [true U ~ [NADH<=482]]]

abstracting: (NADH<=482)
states: 2,454,033,179,726,092 (15)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.507sec

checking: AG [_3PG<=27]
normalized: ~ [E [true U ~ [_3PG<=27]]]

abstracting: (_3PG<=27)
states: 2,454,033,179,726,092 (15)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.509sec

checking: AG [Pyr<=Gluc]
normalized: ~ [E [true U ~ [Pyr<=Gluc]]]

abstracting: (Pyr<=Gluc)
states: 2,421,035,247,551,653 (15)

before gc: list nodes free: 773510

after gc: idd nodes used:1720973, unused:62279027; list nodes free:696415543
MC time: 5m57.038sec

checking: AG [[Ru5P<=b1 | R5P<=158]]
normalized: ~ [E [true U ~ [[Ru5P<=b1 | R5P<=158]]]]

abstracting: (R5P<=158)
states: 2,454,033,179,726,092 (15)
abstracting: (Ru5P<=b1)
states: 1,312,967,343,064,891 (15)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.289sec

checking: EF [~ [[Pyr<=232 | [[326<=F6P & ~ [[[397<=DHAP & ~ [Pi<=R5P]] | ~ [574<=R5P]]]] & _1_3_BPG<=430]]]]
normalized: E [true U ~ [[Pyr<=232 | [_1_3_BPG<=430 & [326<=F6P & ~ [[~ [574<=R5P] | [397<=DHAP & ~ [Pi<=R5P]]]]]]]]]

abstracting: (Pi<=R5P)
states: 1
abstracting: (397<=DHAP)
states: 0
abstracting: (574<=R5P)
states: 0
abstracting: (326<=F6P)
states: 0
abstracting: (_1_3_BPG<=430)
states: 2,454,033,179,726,092 (15)
abstracting: (Pyr<=232)
states: 2,454,033,179,726,092 (15)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.031sec

checking: AG [[Xu5P<=DHAP | [230<=Pi | ~ [[[[[[686<=R5P & NADPplus<=387] & [ATP<=start & [GAP<=a2 & 370<=DHAP]]] | S7P<=215] & ~ [685<=start]] & [G6P<=DHAP | R5P<=535]]]]]]
normalized: ~ [E [true U ~ [[Xu5P<=DHAP | [230<=Pi | ~ [[[G6P<=DHAP | R5P<=535] & [~ [685<=start] & [S7P<=215 | [[ATP<=start & [GAP<=a2 & 370<=DHAP]] & [686<=R5P & NADPplus<=387]]]]]]]]]]]

abstracting: (NADPplus<=387)
states: 2,454,033,179,726,092 (15)
abstracting: (686<=R5P)
states: 0
abstracting: (370<=DHAP)
states: 0
abstracting: (GAP<=a2)
states: 2,450,494,496,296,090 (15)
abstracting: (ATP<=start)
states: 7,198,568,101,365 (12)
abstracting: (S7P<=215)
states: 2,454,033,179,726,092 (15)
abstracting: (685<=start)
states: 0
abstracting: (R5P<=535)
states: 2,454,033,179,726,092 (15)
abstracting: (G6P<=DHAP)
states: 68,835,756,971,716 (13)
abstracting: (230<=Pi)
states: 2,454,033,179,726,091 (15)
abstracting: (Xu5P<=DHAP)
states: 14,573,026,413,733 (13)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.092sec

checking: EF [[[[~ [693<=FBP] & [322<=R5P | 210<=PEP]] & ~ [[~ [[~ [[[GAP<=223 | 151<=c1] & [b1<=406 & 645<=a2]]] & [[[F6P<=S7P | FBP<=Lac] | ~ [GSH<=408]] & [45<=_2PG | start<=317]]]] | [66<=_1_3_BPG & Xu5P<=18]]]] & [471<=c2 & [E4P<=566 & NADPplus<=b2]]]]
normalized: E [true U [[471<=c2 & [E4P<=566 & NADPplus<=b2]] & [~ [[[66<=_1_3_BPG & Xu5P<=18] | ~ [[[[45<=_2PG | start<=317] & [~ [GSH<=408] | [F6P<=S7P | FBP<=Lac]]] & ~ [[[b1<=406 & 645<=a2] & [GAP<=223 | 151<=c1]]]]]]] & [[322<=R5P | 210<=PEP] & ~ [693<=FBP]]]]]

abstracting: (693<=FBP)
states: 0
abstracting: (210<=PEP)
states: 0
abstracting: (322<=R5P)
states: 0
abstracting: (151<=c1)
states: 3,653,037,803,572 (12)
abstracting: (GAP<=223)
states: 2,454,033,179,726,092 (15)
abstracting: (645<=a2)
states: 0
abstracting: (b1<=406)
states: 2,454,033,179,726,092 (15)
abstracting: (FBP<=Lac)
states: 2,114,110,712,853,493 (15)
abstracting: (F6P<=S7P)
states: 2,047,798,909,700,850 (15)
abstracting: (GSH<=408)
states: 2,454,033,179,726,092 (15)
abstracting: (start<=317)
states: 2,454,033,179,726,092 (15)
abstracting: (45<=_2PG)
states: 0
abstracting: (Xu5P<=18)
states: 153,851,449,636,891 (14)
abstracting: (66<=_1_3_BPG)
states: 0
abstracting: (NADPplus<=b2)
states: 1,894,552,690,753,790 (15)
abstracting: (E4P<=566)
states: 2,454,033,179,726,092 (15)
abstracting: (471<=c2)
states: 2,450,380,141,922,520 (15)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.969sec

checking: AG [[[Ru5P<=5 & ~ [[[653<=NADplus | 517<=NADplus] & 326<=GAP]]] | [~ [GSH<=Xu5P] | ~ [[[[~ [a1<=a2] & ~ [[[DHAP<=577 & Pyr<=195] | [130<=_3PG & G6P<=GAP]]]] | [[[~ [c2<=b2] & [370<=Lac | GAP<=326]] & [[GSH<=381 & Lac<=FBP] | Lac<=131]] | [426<=PEP & ATP<=Ru5P]]] | 7<=start]]]]]
normalized: ~ [E [true U ~ [[[~ [[7<=start | [[[426<=PEP & ATP<=Ru5P] | [[Lac<=131 | [GSH<=381 & Lac<=FBP]] & [[370<=Lac | GAP<=326] & ~ [c2<=b2]]]] | [~ [[[130<=_3PG & G6P<=GAP] | [DHAP<=577 & Pyr<=195]]] & ~ [a1<=a2]]]]] | ~ [GSH<=Xu5P]] | [Ru5P<=5 & ~ [[326<=GAP & [653<=NADplus | 517<=NADplus]]]]]]]]

abstracting: (517<=NADplus)
states: 0
abstracting: (653<=NADplus)
states: 0
abstracting: (326<=GAP)
states: 0
abstracting: (Ru5P<=5)
states: 96,235,608,549,852 (13)
abstracting: (GSH<=Xu5P)
states: 1,728,915,694,296,331 (15)
abstracting: (a1<=a2)
states: 1,696,353,631,398,425 (15)
abstracting: (Pyr<=195)
states: 2,454,033,179,726,092 (15)
abstracting: (DHAP<=577)
states: 2,454,033,179,726,092 (15)
abstracting: (G6P<=GAP)
states: 68,835,756,971,716 (13)
abstracting: (130<=_3PG)
states: 0
abstracting: (c2<=b2)
states: 3,653,037,803,572 (12)
abstracting: (GAP<=326)
states: 2,454,033,179,726,092 (15)
abstracting: (370<=Lac)
states: 0
abstracting: (Lac<=FBP)
states: 1,400,900,498,796,865 (15)
abstracting: (GSH<=381)
states: 2,454,033,179,726,092 (15)
abstracting: (Lac<=131)
states: 2,454,033,179,726,092 (15)
abstracting: (ATP<=Ru5P)
states: 1,586,692,813,479,671 (15)
abstracting: (426<=PEP)
states: 0
abstracting: (7<=start)
states: 0
MC time: 26m35.091sec

checking: EF [[[[[G6P<=356 & ~ [GAP<=FBP]] & ~ [[~ [E4P<=Lac] | ~ [[~ [[NADPplus<=584 & 378<=S7P]] & [[382<=R5P & c1<=NADplus] & ~ [502<=GSH]]]]]]] & [[~ [225<=NADPplus] & [~ [[~ [8<=b2] | [~ [Xu5P<=339] & [S7P<=684 | FBP<=G6P]]]] | a1<=219]] & [[239<=a2 & [[~ [[297<=GSH | Xu5P<=680]] & [Gluc<=174 & [GAP<=224 | GAP<=b1]]] | [[[330<=Ru5P | 258<=FBP] | DHAP<=R5P] | 488<=ADP]]] | ~ [163<=_2PG]]]] | ~ [[~ [192<=b1] | R5P<=620]]]]
normalized: E [true U [~ [[R5P<=620 | ~ [192<=b1]]] | [[[~ [163<=_2PG] | [239<=a2 & [[488<=ADP | [DHAP<=R5P | [330<=Ru5P | 258<=FBP]]] | [[Gluc<=174 & [GAP<=224 | GAP<=b1]] & ~ [[297<=GSH | Xu5P<=680]]]]]] & [[a1<=219 | ~ [[[[S7P<=684 | FBP<=G6P] & ~ [Xu5P<=339]] | ~ [8<=b2]]]] & ~ [225<=NADPplus]]] & [~ [[~ [[[~ [502<=GSH] & [382<=R5P & c1<=NADplus]] & ~ [[NADPplus<=584 & 378<=S7P]]]] | ~ [E4P<=Lac]]] & [G6P<=356 & ~ [GAP<=FBP]]]]]]

abstracting: (GAP<=FBP)
states: 1,402,440,840,387,886 (15)
abstracting: (G6P<=356)
states: 2,453,951,046,463,559 (15)
abstracting: (E4P<=Lac)
states: 2,316,874,061,856,658 (15)
abstracting: (378<=S7P)
states: 0
abstracting: (NADPplus<=584)
states: 2,454,033,179,726,092 (15)
abstracting: (c1<=NADplus)
states: 2,450,380,141,922,520 (15)
abstracting: (382<=R5P)
states: 0
abstracting: (502<=GSH)
states: 0
abstracting: (225<=NADPplus)
states: 0
abstracting: (8<=b2)
states: 2,405,902,465,931,758 (15)
abstracting: (Xu5P<=339)
states: 2,415,071,954,192,539 (15)
abstracting: (FBP<=G6P)
states: 2,443,325,301,515,463 (15)
abstracting: (S7P<=684)
states: 2,454,033,179,726,092 (15)
abstracting: (a1<=219)
states: 2,454,033,179,726,092 (15)
abstracting: (Xu5P<=680)
states: 2,454,033,179,726,092 (15)
abstracting: (297<=GSH)
states: 0
abstracting: (GAP<=b1)
states: 2,431,731,308,447,220 (15)
abstracting: (GAP<=224)
states: 2,454,033,179,726,092 (15)
abstracting: (Gluc<=174)
states: 2,294,215,859,625,189 (15)
abstracting: (258<=FBP)
states: 0
abstracting: (330<=Ru5P)
states: 24,024,485,096,676 (13)
abstracting: (DHAP<=R5P)
states: 1,351,774,000,725,946 (15)
abstracting: (488<=ADP)
states: 2,454,033,179,726,091 (15)
abstracting: (239<=a2)
states: 0
abstracting: (163<=_2PG)
states: 0
abstracting: (192<=b1)
states: 631,967,078,841,306 (14)
abstracting: (R5P<=620)
states: 2,454,033,179,726,092 (15)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 161048 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15772472 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.000sec


iterations count:11981 (544), effective:2887 (131)

initing FirstDep: 0m 0.000sec


sat_reach.icc:155: Timeout: after 356 sec


sat_reach.icc:155: Timeout: after 528 sec

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

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