About the Execution of Smart+red for ASLink-PT-01a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2188.439 | 401460.00 | 424581.00 | 59.90 | TFFTTTFTTTFTTTTF | 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.r011-oct2-167813599600014.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599600014
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 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 201K 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 ASLink-PT-01a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678719072192
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=ASLink-PT-01a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 14:51:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 14:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:51:14] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-13 14:51:14] [INFO ] Transformed 431 places.
[2023-03-13 14:51:14] [INFO ] Transformed 735 transitions.
[2023-03-13 14:51:14] [INFO ] Found NUPN structural information;
[2023-03-13 14:51:14] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 203 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 13) seen :8
FORMULA ASLink-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 728 rows 431 cols
[2023-03-13 14:51:16] [INFO ] Computed 80 place invariants in 36 ms
[2023-03-13 14:51:16] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 14:51:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-13 14:51:17] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 84 ms returned sat
[2023-03-13 14:51:26] [INFO ] After 9450ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-13 14:51:27] [INFO ] Deduced a trap composed of 44 places in 972 ms of which 14 ms to minimize.
[2023-03-13 14:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1085 ms
[2023-03-13 14:51:27] [INFO ] After 10622ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-13 14:51:27] [INFO ] After 11067ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 52 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 426 transition count 712
Reduce places removed 16 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 410 transition count 704
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 53 place count 402 transition count 704
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 53 place count 402 transition count 680
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 108 place count 371 transition count 680
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 368 transition count 669
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 367 transition count 669
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 120 place count 366 transition count 665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 364 transition count 665
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 363 transition count 657
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 363 transition count 657
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 362 transition count 649
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 362 transition count 649
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 361 transition count 641
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 361 transition count 641
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 140 place count 355 transition count 635
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 355 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 354 transition count 634
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 354 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 144 place count 353 transition count 633
Applied a total of 144 rules in 212 ms. Remains 353 /431 variables (removed 78) and now considering 633/728 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 353/431 places, 633/728 transitions.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 633 rows 353 cols
[2023-03-13 14:51:28] [INFO ] Computed 66 place invariants in 10 ms
[2023-03-13 14:51:28] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 14:51:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-13 14:51:28] [INFO ] [Nat]Absence check using 20 positive and 46 generalized place invariants in 14 ms returned sat
[2023-03-13 14:51:28] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 14:51:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 14:51:28] [INFO ] After 153ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 14:51:32] [INFO ] After 3456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-13 14:51:32] [INFO ] After 3971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 29 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 633/633 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 632
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 352 transition count 628
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 346 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 345 transition count 622
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 345 transition count 622
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 345 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 344 transition count 621
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 343 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 342 transition count 620
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 18 place count 342 transition count 619
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 20 place count 341 transition count 619
Applied a total of 20 rules in 148 ms. Remains 341 /353 variables (removed 12) and now considering 619/633 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 341/353 places, 619/633 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59406 steps, run visited all 1 properties in 372 ms. (steps per millisecond=159 )
Probabilistic random walk after 59406 steps, saw 26381 distinct states, run finished after 373 ms. (steps per millisecond=159 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 18277 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 01a
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: 431 places, 735 transitions, 2801 arcs.
Final Score: 19678.609
Took : 36 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-00 (reachable &!potential( ( (! ( ( (! ( ( ( ( ( ( 1 ) <= (tk(P55)) ) & ( ( 1 ) <= (tk(P128)) ) ) | ( ( ( 1 ) <= (tk(P96)) ) | ( (tk(P159)) <= (tk(P75)) ) ) ) | (! ( (tk(P260)) <= ( 0 ) )) ) | ( ( ( ( (tk(P372)) <= (tk(P276)) ) | ( (tk(P413)) <= ( 0 ) ) ) & ( ( (tk(P204)) <= (tk(P186)) ) | ( (tk(P68)) <= ( 1 ) ) ) ) | ( ( ( (tk(P315)) <= ( 0 ) ) | ( (tk(P427)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P185)) ) & ( (tk(P393)) <= ( 1 ) ) ) ) ) )) & (! ( (! ( ( (tk(P162)) <= ( 0 ) ) | ( (tk(P365)) <= ( 0 ) ) )) | ( ( ( 1 ) <= (tk(P291)) ) & ( ( (tk(P311)) <= (tk(P164)) ) & ( ( 1 ) <= (tk(P304)) ) ) ) )) ) & (! ( ( (! ( ( ( 1 ) <= (tk(P276)) ) & ( ( ( 1 ) <= (tk(P378)) ) | ( (tk(P315)) <= ( 1 ) ) ) )) | ( (! ( (tk(P258)) <= (tk(P285)) )) | ( (! ( (tk(P54)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P306)) ) & ( (tk(P43)) <= ( 1 ) ) ) ) ) ) & (! ( ( ( (tk(P307)) <= ( 1 ) ) | ( (tk(P86)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P334)) )) )) )) )) | ( ( ( ( ( (! ( (tk(P273)) <= (tk(P270)) )) & ( (! ( ( (tk(P40)) <= (tk(P224)) ) & ( (tk(P87)) <= ( 0 ) ) )) & ( ( ( ( 1 ) <= (tk(P324)) ) & ( ( 1 ) <= (tk(P91)) ) ) & (! ( ( 1 ) <= (tk(P351)) )) ) ) ) | ( ( (tk(P389)) <= (tk(P66)) ) & ( ( ( ( (tk(P39)) <= ( 0 ) ) | ( (tk(P88)) <= (tk(P209)) ) ) | (! ( (tk(P168)) <= (tk(P83)) )) ) & ( ( ( ( 1 ) <= (tk(P359)) ) | ( (tk(P231)) <= (tk(P341)) ) ) & ( (tk(P389)) <= (tk(P231)) ) ) ) ) ) & ( (! ( ( ( ( ( 1 ) <= (tk(P75)) ) & ( (tk(P14)) <= (tk(P35)) ) ) | (! ( (tk(P321)) <= ( 1 ) )) ) & (! ( ( (tk(P233)) <= (tk(P63)) ) & ( ( 1 ) <= (tk(P226)) ) )) )) | ( (! ( (! ( ( 1 ) <= (tk(P103)) )) | (! ( (tk(P97)) <= (tk(P65)) )) )) & ( (tk(P274)) <= (tk(P371)) ) ) ) ) & ( (tk(P325)) <= (tk(P142)) ) ) & ( ( ( (! ( (tk(P342)) <= (tk(P185)) )) & ( (! ( ( (tk(P354)) <= (tk(P247)) ) & ( ( 1 ) <= (tk(P333)) ) )) | ( ( (tk(P419)) <= ( 1 ) ) | ( ( ( (tk(P108)) <= (tk(P147)) ) | ( (tk(P379)) <= (tk(P246)) ) ) | ( ( (tk(P258)) <= ( 0 ) ) | ( (tk(P414)) <= (tk(P131)) ) ) ) ) ) ) | ( ( ( ( ( ( (tk(P396)) <= (tk(P83)) ) | ( ( 1 ) <= (tk(P79)) ) ) & ( ( 1 ) <= (tk(P252)) ) ) | ( ( (tk(P32)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P426)) ) & ( (tk(P198)) <= ( 0 ) ) ) ) ) | (! ( (! ( (tk(P326)) <= ( 1 ) )) & (! ( (tk(P173)) <= ( 0 ) )) )) ) & ( ( 1 ) <= (tk(P385)) ) ) ) | ( ( ( 1 ) <= (tk(P362)) ) | (! ( (tk(P327)) <= ( 0 ) )) ) ) ) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( ( 1 ) <= (tk(P113)) ) | (! ( ( ( ( (tk(P401)) <= ( 1 ) ) | ( (tk(P34)) <= (tk(P412)) ) ) | (! ( ( 1 ) <= (tk(P234)) )) ) & (! ( (tk(P21)) <= (tk(P123)) )) )) ) & ( ( (! ( ( 1 ) <= (tk(P211)) )) | ( ( (! ( (tk(P87)) <= (tk(P57)) )) & ( ( ( ( 1 ) <= (tk(P279)) ) & ( ( ( 1 ) <= (tk(P415)) ) | ( (tk(P358)) <= ( 0 ) ) ) ) & ( ( ( ( 1 ) <= (tk(P366)) ) & ( (tk(P26)) <= (tk(P29)) ) ) | (! ( (tk(P212)) <= ( 1 ) )) ) ) ) | ( (tk(P377)) <= (tk(P27)) ) ) ) | ( (! ( ( 1 ) <= (tk(P117)) )) & ( ( ( (tk(P380)) <= (tk(P225)) ) | ( ( ( ( (tk(P161)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P29)) ) ) & (! ( (tk(P258)) <= (tk(P416)) )) ) & ( ( ( (tk(P43)) <= ( 1 ) ) | ( (tk(P301)) <= ( 0 ) ) ) & ( ( (tk(P96)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P72)) ) ) ) ) ) | (! ( (! ( (tk(P122)) <= ( 1 ) )) | (! ( (tk(P143)) <= (tk(P37)) )) )) ) ) ) ) | ( (tk(P97)) <= ( 0 ) ) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-02 (reachable & potential((! ( (tk(P257)) <= ( 1 ) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P196)) <= ( 1 ) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-04 (reachable & potential(( ( 1 ) <= (tk(P369)) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-05 (reachable & potential((! ( (tk(P38)) <= (tk(P166)) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-06 (reachable &!potential( (! ( ( 1 ) <= (tk(P351)) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-07 (reachable & potential(( (! ( ( (! ( (! ( (! ( ( 1 ) <= (tk(P270)) )) | ( ( (tk(P289)) <= (tk(P402)) ) & ( ( 1 ) <= (tk(P305)) ) ) )) & ( ( ( (tk(P164)) <= (tk(P327)) ) | ( (tk(P76)) <= (tk(P81)) ) ) | (! ( (tk(P103)) <= ( 1 ) )) ) )) & ( ( ( 1 ) <= (tk(P233)) ) | ( ( ( ( (tk(P309)) <= ( 0 ) ) | ( (tk(P191)) <= (tk(P48)) ) ) & ( ( ( 1 ) <= (tk(P128)) ) | ( (tk(P149)) <= (tk(P391)) ) ) ) | ( (tk(P54)) <= ( 0 ) ) ) ) ) | ( ( (tk(P84)) <= (tk(P38)) ) | ( ( 1 ) <= (tk(P44)) ) ) )) | (! ( (! ( (tk(P262)) <= ( 1 ) )) | (! ( (! ( (tk(P61)) <= ( 0 ) )) & ( (tk(P281)) <= (tk(P290)) ) )) )) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-08 (reachable &!potential( ( ( ( ( (! ( (tk(P352)) <= (tk(P167)) )) | ( (tk(P1)) <= (tk(P351)) ) ) & ( (tk(P314)) <= ( 1 ) ) ) | ( (tk(P303)) <= (tk(P187)) ) ) & ( (tk(P381)) <= ( 1 ) ) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-09 (reachable & potential(( ( ( ( 1 ) <= (tk(P259)) ) | ( (tk(P155)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P231)) ) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-10 (reachable &!potential( (! ( ( 1 ) <= (tk(P362)) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P270)) <= (tk(P63)) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-12 (reachable &!potential( ( ( ( 1 ) <= (tk(P316)) ) | ( (tk(P405)) <= ( 1 ) ) )))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-13 (reachable &!potential( (! ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P216)) ) | (! ( (tk(P269)) <= (tk(P57)) )) ) | ( ( ( (tk(P187)) <= (tk(P402)) ) | ( ( 1 ) <= (tk(P380)) ) ) | (! ( (tk(P314)) <= (tk(P311)) )) ) ) & (! ( ( ( ( 1 ) <= (tk(P392)) ) | ( (tk(P285)) <= (tk(P329)) ) ) | (! ( ( 1 ) <= (tk(P94)) )) )) ) & ( ( ( ( 1 ) <= (tk(P84)) ) & (! ( (tk(P267)) <= (tk(P95)) )) ) | ( ( 1 ) <= (tk(P330)) ) ) ) & ( ( ( (! ( ( 1 ) <= (tk(P253)) )) & ( ( ( (tk(P55)) <= (tk(P319)) ) & ( ( 1 ) <= (tk(P92)) ) ) & ( ( 1 ) <= (tk(P212)) ) ) ) | ( (tk(P55)) <= (tk(P17)) ) ) & ( ( ( (tk(P354)) <= ( 0 ) ) & ( (tk(P379)) <= (tk(P289)) ) ) | ( ( 1 ) <= (tk(P222)) ) ) ) ) & ( ( (tk(P342)) <= ( 1 ) ) | ( (! ( (! ( (tk(P294)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P352)) )) )) | (! ( ( ( ( (tk(P424)) <= (tk(P26)) ) & ( (tk(P315)) <= ( 1 ) ) ) | ( ( (tk(P370)) <= (tk(P333)) ) & ( (tk(P123)) <= ( 0 ) ) ) ) & ( ( 1 ) <= (tk(P332)) ) )) ) ) ) & ( ( ( (tk(P190)) <= ( 1 ) ) & ( (tk(P66)) <= (tk(P135)) ) ) | ( (tk(P210)) <= (tk(P146)) ) ) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-14 (reachable & potential((! ( ( (! ( ( ( (tk(P322)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P407)) ) ) & (! ( (tk(P33)) <= ( 0 ) )) )) | ( ( ( (! ( (! ( (tk(P363)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P207)) )) )) & ( (tk(P119)) <= ( 0 ) ) ) | ( (tk(P252)) <= ( 0 ) ) ) & ( ( ( ( ( 1 ) <= (tk(P405)) ) | (! ( ( (tk(P288)) <= (tk(P35)) ) & ( (tk(P214)) <= (tk(P408)) ) )) ) | ( ( ( ( (tk(P10)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P200)) ) ) & ( (tk(P30)) <= (tk(P423)) ) ) & ( (! ( (tk(P323)) <= ( 0 ) )) & ( (tk(P295)) <= (tk(P396)) ) ) ) ) & ( ( ( ( (tk(P27)) <= (tk(P321)) ) & ( ( (tk(P379)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P2)) ) ) ) & ( ( 1 ) <= (tk(P137)) ) ) & ( ( ( ( (tk(P394)) <= ( 0 ) ) & ( (tk(P110)) <= ( 0 ) ) ) & ( (tk(P317)) <= (tk(P351)) ) ) | (! ( (tk(P392)) <= (tk(P222)) )) ) ) ) ) ) | (! ( (tk(P136)) <= ( 1 ) )) ))))
PROPERTY: ASLink-PT-01a-ReachabilityCardinality-15 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P312)) ) & ( ( ( (! ( (tk(P308)) <= (tk(P429)) )) | ( (tk(P396)) <= (tk(P90)) ) ) | ( ( ( (tk(P291)) <= (tk(P20)) ) | ( ( ( (tk(P162)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P305)) ) ) | ( ( (tk(P71)) <= (tk(P313)) ) | ( (tk(P108)) <= ( 0 ) ) ) ) ) | ( ( ( 1 ) <= (tk(P262)) ) & ( (tk(P352)) <= ( 1 ) ) ) ) ) | ( ( (! ( (! ( (tk(P305)) <= (tk(P166)) )) & ( ( 1 ) <= (tk(P388)) ) )) | (! ( ( ( ( 1 ) <= (tk(P270)) ) | ( ( 1 ) <= (tk(P159)) ) ) | ( ( 1 ) <= (tk(P355)) ) )) ) | ( ( 1 ) <= (tk(P165)) ) ) ) ))))
FORMULA ASLink-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA ASLink-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1678719473652
--------------------
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r011-oct2-167813599600014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;