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

About the Execution of Smart+red for DES-PT-60b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4129.575 788425.00 813229.00 2411.00 FFTFTTTTTTTTFTFT 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.r107-tall-167814484300502.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 DES-PT-60b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484300502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.6K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 139K 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 DES-PT-60b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678380924971

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=DES-PT-60b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 16:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 16:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:55:26] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-09 16:55:26] [INFO ] Transformed 519 places.
[2023-03-09 16:55:26] [INFO ] Transformed 470 transitions.
[2023-03-09 16:55:26] [INFO ] Found NUPN structural information;
[2023-03-09 16:55:26] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-60b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 85 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 14) seen :7
FORMULA DES-PT-60b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 470 rows 519 cols
[2023-03-09 16:55:27] [INFO ] Computed 65 place invariants in 34 ms
[2023-03-09 16:55:27] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:55:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-09 16:55:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 166 ms returned sat
[2023-03-09 16:55:34] [INFO ] After 3134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 16:55:35] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 4 ms to minimize.
[2023-03-09 16:55:35] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-09 16:55:35] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2023-03-09 16:55:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 605 ms
[2023-03-09 16:55:37] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2023-03-09 16:55:37] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-09 16:55:37] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-09 16:55:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 526 ms
[2023-03-09 16:55:37] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-09 16:55:37] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-03-09 16:55:38] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-09 16:55:38] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2023-03-09 16:55:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2023-03-09 16:55:38] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-09 16:55:38] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2023-03-09 16:55:38] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-03-09 16:55:39] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2023-03-09 16:55:40] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2023-03-09 16:55:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1515 ms
[2023-03-09 16:55:41] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-09 16:55:41] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2023-03-09 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-03-09 16:55:41] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2023-03-09 16:55:41] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2023-03-09 16:55:41] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-09 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2023-03-09 16:55:41] [INFO ] After 10407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2316 ms.
[2023-03-09 16:55:44] [INFO ] After 16568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1263 ms.
Support contains 54 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 508 transition count 450
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 495 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 493 transition count 448
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 33 place count 493 transition count 441
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 47 place count 486 transition count 441
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 63 place count 470 transition count 425
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 470 transition count 425
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 89 place count 460 transition count 415
Iterating global reduction 3 with 10 rules applied. Total rules applied 99 place count 460 transition count 415
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 3 with 9 rules applied. Total rules applied 108 place count 460 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 459 transition count 406
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 233 place count 397 transition count 344
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 239 place count 394 transition count 347
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 394 transition count 346
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 394 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 393 transition count 345
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 246 place count 393 transition count 341
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 250 place count 389 transition count 341
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 251 place count 389 transition count 340
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 252 place count 389 transition count 340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 253 place count 388 transition count 339
Applied a total of 253 rules in 255 ms. Remains 388 /519 variables (removed 131) and now considering 339/470 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 388/519 places, 339/470 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 706235 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 706235 steps, saw 113886 distinct states, run finished after 3002 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 339 rows 388 cols
[2023-03-09 16:55:49] [INFO ] Computed 61 place invariants in 13 ms
[2023-03-09 16:55:49] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:55:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-09 16:55:49] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 91 ms returned sat
[2023-03-09 16:55:50] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 16:55:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 16:55:50] [INFO ] After 325ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 549 ms
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-09 16:55:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-09 16:55:52] [INFO ] After 1636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-09 16:55:52] [INFO ] After 2941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 704 ms.
Support contains 54 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 339/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 388 /388 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 388/388 places, 339/339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 339/339 transitions.
Applied a total of 0 rules in 16 ms. Remains 388 /388 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2023-03-09 16:55:53] [INFO ] Invariant cache hit.
[2023-03-09 16:55:53] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-09 16:55:53] [INFO ] Invariant cache hit.
[2023-03-09 16:55:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 16:55:53] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-09 16:55:53] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 16:55:53] [INFO ] Invariant cache hit.
[2023-03-09 16:55:53] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 834 ms. Remains : 388/388 places, 339/339 transitions.
Applied a total of 0 rules in 16 ms. Remains 388 /388 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-09 16:55:53] [INFO ] Invariant cache hit.
[2023-03-09 16:55:54] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:55:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 16:55:54] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2023-03-09 16:55:55] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2023-03-09 16:55:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 651 ms
[2023-03-09 16:55:56] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-09 16:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 16:55:56] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-09 16:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 16:55:56] [INFO ] After 1877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 418 ms.
[2023-03-09 16:55:56] [INFO ] After 2808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-09 16:55:56] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-09 16:55:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 388 places, 339 transitions and 1537 arcs took 2 ms.
[2023-03-09 16:55:57] [INFO ] Flatten gal took : 71 ms
Total runtime 30715 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 60b
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: 388 places, 339 transitions, 1537 arcs.
Final Score: 6533.244
Took : 21 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DES-PT-60b-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( ( (tk(P214)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P214)) ) ) | ( ( ( (tk(P31)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P31)) ) ) | ( ( (tk(P20)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P20)) ) ) ) ) | ( ( ( (tk(P282)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P282)) ) ) | ( ( ( (tk(P206)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P206)) ) ) | ( ( (tk(P381)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P381)) ) ) ) ) ) | ( ( ( ( (tk(P384)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P384)) ) ) | ( ( ( (tk(P319)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P319)) ) ) | ( ( (tk(P312)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P312)) ) ) ) ) | ( ( ( ( (tk(P61)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P61)) ) ) & ( ( (tk(P290)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P290)) ) ) ) | ( ( ( ( (tk(P259)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P259)) ) ) & ( ( ( (tk(P273)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P273)) ) ) & ( ( (tk(P283)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P283)) ) ) ) ) | ( ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) & ( ( (tk(P201)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P201)) ) ) ) ) ) ) )))
PROPERTY: DES-PT-60b-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) | ( ( ( (tk(P10)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P10)) ) ) | ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) ) ) | ( ( ( (tk(P252)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P252)) ) ) | ( ( ( (tk(P54)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P54)) ) ) | ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) ) ) ) | ( ( ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) | ( ( ( (tk(P262)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P262)) ) ) | ( ( (tk(P294)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P294)) ) ) ) ) | ( ( ( (tk(P233)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P233)) ) ) | ( ( ( ( ( (tk(P296)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P296)) ) ) | ( ( ( ( (tk(P328)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P328)) ) ) & ( ( (tk(P228)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P228)) ) ) ) | ( ( ( (tk(P107)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P107)) ) ) & ( ( (tk(P279)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P279)) ) ) ) ) ) & ( ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) | ( ( ( (tk(P191)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P191)) ) ) | ( ( (tk(P332)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P332)) ) ) ) ) ) | ( ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) & ( ( (tk(P308)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P308)) ) ) ) & ( ( ( (tk(P96)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P96)) ) ) & ( ( (tk(P265)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P265)) ) ) ) ) ) ) ) )))
PROPERTY: DES-PT-60b-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( (tk(P347)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P347)) ) ) & ( ( (tk(P332)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P332)) ) ) ) & ( ( ( (tk(P289)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P289)) ) ) & ( ( (tk(P281)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P281)) ) ) ) ) & ( ( ( ( (tk(P326)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P326)) ) ) & ( ( (tk(P256)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P256)) ) ) ) & ( ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P84)) ) ) & ( ( ( (tk(P173)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P173)) ) ) | ( ( ( (tk(P29)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P29)) ) ) & ( ( (tk(P274)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P274)) ) ) ) ) ) ) )))
PROPERTY: DES-PT-60b-ReachabilityCardinality-06 (reachable & potential(( ( ( (tk(P67)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P67)) ) ) | ( ( ( (tk(P251)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P251)) ) ) & ( ( ( (tk(P126)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P126)) ) ) & ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) ) ) )))
PROPERTY: DES-PT-60b-ReachabilityCardinality-07 (reachable & potential(( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) )))
PROPERTY: DES-PT-60b-ReachabilityCardinality-13 (reachable & potential(( ( (tk(P165)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P165)) ) )))
PROPERTY: DES-PT-60b-ReachabilityCardinality-14 (reachable &!potential( ( ( ( (tk(P58)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P58)) ) ) | ( ( (tk(P147)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P147)) ) ) )))
FORMULA DES-PT-60b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-60b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-60b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-60b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-60b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-60b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-60b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678381713396

--------------------
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="DES-PT-60b"
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 DES-PT-60b, 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 r107-tall-167814484300502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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