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

About the Execution of Smart+red for ResAllocation-PT-R050C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
362.523 22721.00 41932.00 472.10 FFFFTFFFTTTFTFTT 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.r331-tall-167889204900766.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 smartxred
Input is ResAllocation-PT-R050C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r331-tall-167889204900766
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 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.5K 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:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 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 212K 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-R050C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679158899413

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 17:01:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 17:01:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:01:41] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-18 17:01:41] [INFO ] Transformed 200 places.
[2023-03-18 17:01:41] [INFO ] Transformed 102 transitions.
[2023-03-18 17:01:41] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 16) seen :7
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 102 rows 200 cols
[2023-03-18 17:01:42] [INFO ] Computed 100 place invariants in 15 ms
[2023-03-18 17:01:43] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-18 17:01:43] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-18 17:01:43] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-18 17:01:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 10 ms to minimize.
[2023-03-18 17:01:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-18 17:01:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-18 17:01:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 186 ms
[2023-03-18 17:01:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2023-03-18 17:01:44] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-18 17:01:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-18 17:01:44] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-18 17:01:44] [INFO ] After 795ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 169 ms.
Support contains 68 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 199 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 199 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 196 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 195 transition count 99
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 195 transition count 98
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 192 transition count 98
Applied a total of 12 rules in 82 ms. Remains 192 /200 variables (removed 8) and now considering 98/102 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 192/200 places, 98/102 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 509686 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{1=1}
Probabilistic random walk after 509686 steps, saw 134335 distinct states, run finished after 3002 ms. (steps per millisecond=169 ) properties seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 192 cols
[2023-03-18 17:01:47] [INFO ] Computed 96 place invariants in 8 ms
[2023-03-18 17:01:47] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 17:01:47] [INFO ] [Nat]Absence check using 96 positive place invariants in 20 ms returned sat
[2023-03-18 17:01:48] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 17:01:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-18 17:01:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 17:01:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-18 17:01:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-18 17:01:48] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-18 17:01:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 201 ms
[2023-03-18 17:01:48] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-18 17:01:48] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 80 ms.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 506671 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 506671 steps, saw 132866 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 17:01:51] [INFO ] Invariant cache hit.
[2023-03-18 17:01:51] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 17:01:51] [INFO ] [Nat]Absence check using 96 positive place invariants in 13 ms returned sat
[2023-03-18 17:01:52] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 17:01:52] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-18 17:01:52] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2023-03-18 17:01:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-18 17:01:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 122 ms
[2023-03-18 17:01:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-18 17:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-18 17:01:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 17:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-18 17:01:52] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-18 17:01:52] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 65 ms.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 192/192 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 17:01:52] [INFO ] Invariant cache hit.
[2023-03-18 17:01:52] [INFO ] Implicit Places using invariants in 123 ms returned [101, 107, 109, 113, 115, 121, 123, 127, 129, 131, 135, 137, 139, 141, 143, 145, 147, 149, 153, 155, 157, 159, 161, 163, 167, 171, 173, 177, 179, 181, 183, 187, 189, 191]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 127 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/192 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 138 ms. Remains : 158/192 places, 98/98 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 507527 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507527 steps, saw 133275 distinct states, run finished after 3002 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 98 rows 158 cols
[2023-03-18 17:01:56] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-18 17:01:56] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 17:01:56] [INFO ] [Nat]Absence check using 62 positive place invariants in 9 ms returned sat
[2023-03-18 17:01:56] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 17:01:56] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2023-03-18 17:01:56] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-03-18 17:01:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-18 17:01:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-18 17:01:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2023-03-18 17:01:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-18 17:01:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 227 ms
[2023-03-18 17:01:56] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-18 17:01:56] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 82 ms.
Support contains 53 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 17:01:56] [INFO ] Invariant cache hit.
[2023-03-18 17:01:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 17:01:56] [INFO ] Invariant cache hit.
[2023-03-18 17:01:56] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-18 17:01:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 17:01:56] [INFO ] Invariant cache hit.
[2023-03-18 17:01:57] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 158/158 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-18 17:01:57] [INFO ] Invariant cache hit.
[2023-03-18 17:01:57] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 17:01:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 9 ms returned sat
[2023-03-18 17:01:57] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 17:01:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-18 17:01:57] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-18 17:01:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 17:01:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 17:01:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 178 ms
[2023-03-18 17:01:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 17:01:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-18 17:01:57] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-18 17:01:57] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-18 17:01:57] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-18 17:01:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 98 transitions and 412 arcs took 2 ms.
[2023-03-18 17:01:57] [INFO ] Flatten gal took : 36 ms
Total runtime 16404 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ResAllocation (PT), instance R050C002
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 158 places, 98 transitions, 412 arcs.
Final Score: 573.575
Took : 3 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ResAllocation-PT-R050C002-ReachabilityCardinality-00 (reachable &!potential( ( ( (! ( (tk(P22)) <= (tk(P2)) )) | ( (! ( (tk(P52)) <= ( 1 ) )) | ( (tk(P91)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P39)) ) | ( (! ( (tk(P95)) <= ( 0 ) )) & (! ( (tk(P29)) <= (tk(P115)) )) ) ) | ( ( (! ( (tk(P127)) <= (tk(P133)) )) & ( ( (! ( (tk(P149)) <= ( 0 ) )) | ( (tk(P124)) <= (tk(P45)) ) ) | ( (! ( ( 1 ) <= (tk(P8)) )) | (! ( (tk(P134)) <= ( 1 ) )) ) ) ) | ( ( ( ( 1 ) <= (tk(P64)) ) & ( (tk(P109)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P88)) ) & ( ( (tk(P15)) <= (tk(P89)) ) | ( ( 1 ) <= (tk(P98)) ) ) ) ) ) ) )))
PROPERTY: ResAllocation-PT-R050C002-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P43)) <= (tk(P105)) )))
PROPERTY: ResAllocation-PT-R050C002-ReachabilityCardinality-13 (reachable & potential(( (! ( (tk(P89)) <= ( 1 ) )) | ( (! ( (tk(P155)) <= ( 1 ) )) | ( ( ( (! ( ( 1 ) <= (tk(P13)) )) & ( (tk(P157)) <= (tk(P82)) ) ) & ( (! ( ( 1 ) <= (tk(P48)) )) & (! ( (tk(P51)) <= (tk(P67)) )) ) ) & ( ( (! ( (tk(P142)) <= (tk(P154)) )) & (! ( (tk(P140)) <= (tk(P119)) )) ) & ( (! ( ( 1 ) <= (tk(P1)) )) & ( (! ( (tk(P100)) <= ( 0 ) )) | ( ( (tk(P90)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) ) ) ) ) ) )))
PROPERTY: ResAllocation-PT-R050C002-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P35)) <= (tk(P113)) ) | ( ( ( 1 ) <= (tk(P128)) ) | ( (tk(P145)) <= (tk(P63)) ) ) ) | ( (! ( ( 1 ) <= (tk(P73)) )) | ( ( ( (! ( ( 1 ) <= (tk(P135)) )) & (! ( (tk(P62)) <= (tk(P37)) )) ) & ( ( ( ( 1 ) <= (tk(P130)) ) | ( ( 1 ) <= (tk(P93)) ) ) & ( ( (tk(P6)) <= ( 1 ) ) | ( ( (tk(P121)) <= ( 1 ) ) & ( (tk(P103)) <= ( 0 ) ) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P96)) )) & (! ( (tk(P27)) <= ( 1 ) )) ) ) ) )))
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679158922134

--------------------
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

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-R050C002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ResAllocation-PT-R050C002, 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 r331-tall-167889204900766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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