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

About the Execution of Marcie+red for ResAllocation-PT-R020C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.260 16411.00 27619.00 255.00 FFTFFTTFTTFFTFTF 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.r330-tall-167889203700759.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 ResAllocation-PT-R020C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700759
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679181820025

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:23:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:23:41] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-18 23:23:41] [INFO ] Transformed 80 places.
[2023-03-18 23:23:41] [INFO ] Transformed 42 transitions.
[2023-03-18 23:23:41] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 12) seen :2
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :2
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :2
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 42 rows 80 cols
[2023-03-18 23:23:42] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-18 23:23:42] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2023-03-18 23:23:42] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-18 23:23:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2023-03-18 23:23:42] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-18 23:23:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 5 ms to minimize.
[2023-03-18 23:23:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-18 23:23:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-03-18 23:23:43] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 23:23:43] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
Support contains 58 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
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 0 with 3 rules applied. Total rules applied 3 place count 78 transition count 41
Applied a total of 3 rules in 29 ms. Remains 78 /80 variables (removed 2) and now considering 41/42 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 78/80 places, 41/42 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1217430 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 1217430 steps, saw 232613 distinct states, run finished after 3002 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 78 cols
[2023-03-18 23:23:46] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-18 23:23:46] [INFO ] [Real]Absence check using 39 positive place invariants in 5 ms returned sat
[2023-03-18 23:23:46] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:23:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 4 ms returned sat
[2023-03-18 23:23:46] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:23:46] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-18 23:23:46] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 58 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-18 23:23:46] [INFO ] Invariant cache hit.
[2023-03-18 23:23:46] [INFO ] Implicit Places using invariants in 56 ms returned [45, 47, 49, 51, 53, 57, 77]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 57 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/78 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61 ms. Remains : 71/78 places, 41/41 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1510748 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :{}
Probabilistic random walk after 1510748 steps, saw 281608 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 71 cols
[2023-03-18 23:23:49] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-18 23:23:49] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-18 23:23:49] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:23:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-18 23:23:50] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 80 ms
[2023-03-18 23:23:50] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-18 23:23:50] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 58 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 71/71 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-18 23:23:50] [INFO ] Invariant cache hit.
[2023-03-18 23:23:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 23:23:50] [INFO ] Invariant cache hit.
[2023-03-18 23:23:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-18 23:23:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:23:50] [INFO ] Invariant cache hit.
[2023-03-18 23:23:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 71/71 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-18 23:23:50] [INFO ] Invariant cache hit.
[2023-03-18 23:23:50] [INFO ] [Real]Absence check using 32 positive place invariants in 3 ms returned sat
[2023-03-18 23:23:50] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:23:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-18 23:23:50] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2023-03-18 23:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-18 23:23:50] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-18 23:23:50] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 23:23:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-18 23:23:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 41 transitions and 182 arcs took 1 ms.
[2023-03-18 23:23:50] [INFO ] Flatten gal took : 22 ms
Total runtime 9414 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ResAllocation_PT_R020C002
(NrP: 71 NrTr: 41 NrArc: 182)

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

net check time: 0m 0.000sec

init dd package: 0m 2.774sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 188 (1.9e+02) #states 11,010,048 (7)



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

checking: EF [[[1<=p23 & 1<=p55] & [1<=p56 & [[1<=p36 & 1<=p39] | [[1<=p30 & 1<=p33] & [[p34<=0 | p37<=0] & [[[1<=p0 & 1<=p3] | [1<=p28 & [1<=p31 & [p17<=0 | [p50<=0 | p51<=0]]]]] | [[1<=p35 & [1<=p67 & 1<=p68]] | [[1<=p18 & 1<=p21] | [[1<=p14 & [1<=p17 & 1<=p5]] & [1<=p43 & [1<=p44 & [1<=p20 | [1<=p0 & 1<=p3]]]]]]]]]]]]]]
normalized: E [true U [[1<=p56 & [[[[[[[[[p50<=0 | p51<=0] | p17<=0] & 1<=p31] & 1<=p28] | [1<=p0 & 1<=p3]] | [[[1<=p67 & 1<=p68] & 1<=p35] | [[1<=p18 & 1<=p21] | [[[1<=p17 & 1<=p5] & 1<=p14] & [[[[1<=p0 & 1<=p3] | 1<=p20] & 1<=p44] & 1<=p43]]]]] & [p34<=0 | p37<=0]] & [1<=p30 & 1<=p33]] | [1<=p36 & 1<=p39]]] & [1<=p23 & 1<=p55]]]

abstracting: (1<=p55)
states: 7,864,320 (6)
abstracting: (1<=p23)
states: 5,242,880 (6)
abstracting: (1<=p39)
states: 5,242,880 (6)
abstracting: (1<=p36)
states: 786,432 (5)
abstracting: (1<=p33)
states: 5,242,880 (6)
abstracting: (1<=p30)
states: 1,572,864 (6)
abstracting: (p37<=0)
states: 5,767,168 (6)
abstracting: (p34<=0)
states: 9,961,472 (6)
abstracting: (1<=p43)
states: 10,223,616 (7)
abstracting: (1<=p44)
states: 1,048,576 (6)
abstracting: (1<=p20)
states: 2,883,584 (6)
abstracting: (1<=p3)
states: 5,242,880 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (1<=p14)
states: 3,670,016 (6)
abstracting: (1<=p5)
states: 5,242,880 (6)
abstracting: (1<=p17)
states: 5,242,880 (6)
abstracting: (1<=p21)
states: 5,242,880 (6)
abstracting: (1<=p18)
states: 3,145,728 (6)
abstracting: (1<=p35)
states: 5,242,880 (6)
abstracting: (1<=p68)
states: 4,980,736 (6)
abstracting: (1<=p67)
states: 6,291,456 (6)
abstracting: (1<=p3)
states: 5,242,880 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (1<=p28)
states: 1,835,008 (6)
abstracting: (1<=p31)
states: 5,242,880 (6)
abstracting: (p17<=0)
states: 5,767,168 (6)
abstracting: (p51<=0)
states: 8,388,608 (6)
abstracting: (p50<=0)
states: 2,359,296 (6)
abstracting: (1<=p56)
states: 3,407,872 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[[[1<=p16 & 1<=p19] & [1<=p3 & 1<=p41]] & [[1<=p42 & 1<=p27] & [1<=p59 & 1<=p60]]] & [[[1<=p10 & 1<=p13] & [[p4<=0 | p7<=0] & [p28<=0 | p31<=0]]] & [[[p21<=0 | [p53<=0 | p54<=0]] & [[1<=p26 & 1<=p29] | [[p31<=0 | [p63<=0 | p64<=0]] & [p33<=0 | [p65<=0 | p66<=0]]]]] & [[[1<=p23 & [1<=p55 & 1<=p56]] | [1<=p6 & 1<=p9]] & [[p26<=0 | p29<=0] & [p14<=0 | p17<=0]]]]]]]
normalized: E [true U [[[[[[p14<=0 | p17<=0] & [p26<=0 | p29<=0]] & [[1<=p6 & 1<=p9] | [1<=p23 & [1<=p55 & 1<=p56]]]] & [[[[p33<=0 | [p65<=0 | p66<=0]] & [p31<=0 | [p63<=0 | p64<=0]]] | [1<=p26 & 1<=p29]] & [p21<=0 | [p53<=0 | p54<=0]]]] & [[[p28<=0 | p31<=0] & [p4<=0 | p7<=0]] & [1<=p10 & 1<=p13]]] & [[[1<=p59 & 1<=p60] & [1<=p42 & 1<=p27]] & [[1<=p3 & 1<=p41] & [1<=p16 & 1<=p19]]]]]

abstracting: (1<=p19)
states: 5,242,880 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
abstracting: (1<=p41)
states: 10,485,760 (7)
abstracting: (1<=p3)
states: 5,242,880 (6)
abstracting: (1<=p27)
states: 5,242,880 (6)
abstracting: (1<=p42)
states: 786,432 (5)
abstracting: (1<=p60)
states: 3,932,160 (6)
abstracting: (1<=p59)
states: 7,340,032 (6)
abstracting: (1<=p13)
states: 5,242,880 (6)
abstracting: (1<=p10)
states: 4,194,304 (6)
abstracting: (p7<=0)
states: 5,767,168 (6)
abstracting: (p4<=0)
states: 6,029,312 (6)
abstracting: (p31<=0)
states: 5,767,168 (6)
abstracting: (p28<=0)
states: 9,175,040 (6)
abstracting: (p54<=0)
states: 7,864,320 (6)
abstracting: (p53<=0)
states: 2,883,584 (6)
abstracting: (p21<=0)
states: 5,767,168 (6)
abstracting: (1<=p29)
states: 5,242,880 (6)
abstracting: (1<=p26)
states: 2,097,152 (6)
abstracting: (p64<=0)
states: 6,553,600 (6)
abstracting: (p63<=0)
states: 4,194,304 (6)
abstracting: (p31<=0)
states: 5,767,168 (6)
abstracting: (p66<=0)
states: 6,291,456 (6)
abstracting: (p65<=0)
states: 4,456,448 (6)
abstracting: (p33<=0)
states: 5,767,168 (6)
abstracting: (1<=p56)
states: 3,407,872 (6)
abstracting: (1<=p55)
states: 7,864,320 (6)
abstracting: (1<=p23)
states: 5,242,880 (6)
abstracting: (1<=p9)
states: 5,242,880 (6)
abstracting: (1<=p6)
states: 4,718,592 (6)
abstracting: (p29<=0)
states: 5,767,168 (6)
abstracting: (p26<=0)
states: 8,912,896 (6)
abstracting: (p17<=0)
states: 5,767,168 (6)
abstracting: (p14<=0)
states: 7,340,032 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[p34<=0 | p37<=0] | [p23<=0 | [p55<=0 | p56<=0]]] | [[[1<=p6 & 1<=p9] | [[[1<=p5 & 1<=p43] & [1<=p44 & [[p37<=0 | [p69<=0 | p70<=0]] | [[p31<=0 | p63<=0] | [p64<=0 | [1<=p0 & 1<=p3]]]]]] | [[[1<=p16 & 1<=p19] & [1<=p5 & 1<=p43]] & [[1<=p44 & 1<=p33] & [1<=p65 & 1<=p66]]]]] | [[1<=p16 & [1<=p19 & [[1<=p25 & [1<=p57 & 1<=p58]] | [1<=p12 & 1<=p15]]]] | [[[1<=p0 & 1<=p3] & [1<=p38 & [p32<=0 | p35<=0]]] | [[1<=p32 & 1<=p35] & [[p35<=0 | [p67<=0 | p68<=0]] & [p29<=0 | [p61<=0 | p62<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p29<=0 | [p61<=0 | p62<=0]] & [p35<=0 | [p67<=0 | p68<=0]]] & [1<=p32 & 1<=p35]] | [[1<=p38 & [p32<=0 | p35<=0]] & [1<=p0 & 1<=p3]]] | [1<=p16 & [1<=p19 & [[1<=p12 & 1<=p15] | [1<=p25 & [1<=p57 & 1<=p58]]]]]] | [[[[[1<=p65 & 1<=p66] & [1<=p44 & 1<=p33]] & [[1<=p5 & 1<=p43] & [1<=p16 & 1<=p19]]] | [[1<=p44 & [[[p64<=0 | [1<=p0 & 1<=p3]] | [p31<=0 | p63<=0]] | [p37<=0 | [p69<=0 | p70<=0]]]] & [1<=p5 & 1<=p43]]] | [1<=p6 & 1<=p9]]] | [[p23<=0 | [p55<=0 | p56<=0]] | [p34<=0 | p37<=0]]]]]]

abstracting: (p37<=0)
states: 5,767,168 (6)
abstracting: (p34<=0)
states: 9,961,472 (6)
abstracting: (p56<=0)
states: 7,602,176 (6)
abstracting: (p55<=0)
states: 3,145,728 (6)
abstracting: (p23<=0)
states: 5,767,168 (6)
abstracting: (1<=p9)
states: 5,242,880 (6)
abstracting: (1<=p6)
states: 4,718,592 (6)
abstracting: (1<=p43)
states: 10,223,616 (7)
abstracting: (1<=p5)
states: 5,242,880 (6)
abstracting: (p70<=0)
states: 5,767,168 (6)
abstracting: (p69<=0)
states: 4,980,736 (6)
abstracting: (p37<=0)
states: 5,767,168 (6)
abstracting: (p63<=0)
states: 4,194,304 (6)
abstracting: (p31<=0)
states: 5,767,168 (6)
abstracting: (1<=p3)
states: 5,242,880 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (p64<=0)
states: 6,553,600 (6)
abstracting: (1<=p44)
states: 1,048,576 (6)
abstracting: (1<=p19)
states: 5,242,880 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
abstracting: (1<=p43)
states: 10,223,616 (7)
abstracting: (1<=p5)
states: 5,242,880 (6)
abstracting: (1<=p33)
states: 5,242,880 (6)
abstracting: (1<=p44)
states: 1,048,576 (6)
abstracting: (1<=p66)
states: 4,718,592 (6)
abstracting: (1<=p65)
states: 6,553,600 (6)
abstracting: (1<=p58)
states: 3,670,016 (6)
abstracting: (1<=p57)
states: 7,602,176 (6)
abstracting: (1<=p25)
states: 5,242,880 (6)
abstracting: (1<=p15)
states: 5,242,880 (6)
abstracting: (1<=p12)
states: 3,932,160 (6)
abstracting: (1<=p19)
states: 5,242,880 (6)
abstracting: (1<=p16)
states: 3,407,872 (6)
abstracting: (1<=p3)
states: 5,242,880 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (p35<=0)
states: 5,767,168 (6)
abstracting: (p32<=0)
states: 9,699,328 (6)
abstracting: (1<=p38)
states: 524,288 (5)
abstracting: (1<=p35)
states: 5,242,880 (6)
abstracting: (1<=p32)
states: 1,310,720 (6)
abstracting: (p68<=0)
states: 6,029,312 (6)
abstracting: (p67<=0)
states: 4,718,592 (6)
abstracting: (p35<=0)
states: 5,767,168 (6)
abstracting: (p62<=0)
states: 6,815,744 (6)
abstracting: (p61<=0)
states: 3,932,160 (6)
abstracting: (p29<=0)
states: 5,767,168 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 22548 (2.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10827 39423 50250
used/not used/entry size/cache size: 48329 67060535 16 1024MB
basic ops cache: hits/miss/sum: 5033 20026 25059
used/not used/entry size/cache size: 49415 16727801 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: 1760 5020 6780
used/not used/entry size/cache size: 5019 8383589 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 67086426
1 22329
2 108
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.651sec


BK_STOP 1679181836436

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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:1414 (34), effective:400 (9)

initing FirstDep: 0m 0.000sec

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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="ReachabilityFireability"
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 ResAllocation-PT-R020C002, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203700759"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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