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

About the Execution of Smart+red for DiscoveryGPU-PT-15b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7982.771 3600000.00 3643308.00 8650.10 TTFFTFFFFTFTFFTF 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.r139-smll-167819423000438.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 DiscoveryGPU-PT-15b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819423000438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 13:30 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.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 111K 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 DiscoveryGPU-PT-15b-ReachabilityCardinality-00
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-01
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-02
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-03
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-04
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-05
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-06
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-07
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-08
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-09
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-10
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-11
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-12
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-13
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-14
FORMULA_NAME DiscoveryGPU-PT-15b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678405535450

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=DiscoveryGPU-PT-15b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 23:45:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 23:45:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:45:38] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-09 23:45:38] [INFO ] Transformed 436 places.
[2023-03-09 23:45:38] [INFO ] Transformed 464 transitions.
[2023-03-09 23:45:38] [INFO ] Found NUPN structural information;
[2023-03-09 23:45:38] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 21 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 14) seen :10
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :1
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 464 rows 436 cols
[2023-03-09 23:45:40] [INFO ] Computed 17 place invariants in 23 ms
[2023-03-09 23:45:41] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-09 23:45:41] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:41] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-09 23:45:41] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 31 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 464/464 transitions.
Graph (complete) has 755 edges and 436 vertex of which 383 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.6 ms
Discarding 53 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 383 transition count 344
Reduce places removed 82 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 85 rules applied. Total rules applied 180 place count 301 transition count 341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 183 place count 298 transition count 341
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 183 place count 298 transition count 317
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 231 place count 274 transition count 317
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 248 place count 257 transition count 300
Iterating global reduction 3 with 17 rules applied. Total rules applied 265 place count 257 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 265 place count 257 transition count 298
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 255 transition count 298
Graph (complete) has 432 edges and 255 vertex of which 188 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.0 ms
Discarding 67 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 188 transition count 252
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 313 place count 188 transition count 209
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 313 place count 188 transition count 206
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 319 place count 185 transition count 206
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 421 place count 134 transition count 155
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 438 place count 134 transition count 138
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 441 place count 134 transition count 135
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 444 place count 134 transition count 132
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 447 place count 131 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 448 place count 131 transition count 132
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 449 place count 131 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 450 place count 130 transition count 130
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 8 with 48 rules applied. Total rules applied 498 place count 128 transition count 84
Reduce places removed 46 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 9 with 54 rules applied. Total rules applied 552 place count 82 transition count 76
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 560 place count 74 transition count 76
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 11 Pre rules applied. Total rules applied 560 place count 74 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 582 place count 63 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 586 place count 61 transition count 63
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 588 place count 61 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 590 place count 59 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 591 place count 59 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 592 place count 58 transition count 60
Applied a total of 592 rules in 188 ms. Remains 58 /436 variables (removed 378) and now considering 60/464 (removed 404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 58/436 places, 60/464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3291538 steps, run timeout after 3001 ms. (steps per millisecond=1096 ) properties seen :{}
Probabilistic random walk after 3291538 steps, saw 362035 distinct states, run finished after 3002 ms. (steps per millisecond=1096 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 58 cols
[2023-03-09 23:45:45] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 23:45:45] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:45:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 23:45:45] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:45:45] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 23:45:45] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
FORMULA DiscoveryGPU-PT-15b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 6894 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DiscoveryGPU (PT), instance 15b
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: 436 places, 464 transitions, 1214 arcs.
Final Score: 17032.373
Took : 20 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-00 (reachable & potential(( ( ( 1 ) <= (tk(P205)) ) & ( ( 1 ) <= (tk(P90)) ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-01 (reachable & potential((! ( (! ( ( (! ( (tk(P217)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P8)) ) | ( ( ( 1 ) <= (tk(P12)) ) | ( (! ( (tk(P336)) <= (tk(P171)) )) & ( (tk(P287)) <= ( 1 ) ) ) ) ) ) | ( ( ( ( ( (tk(P160)) <= ( 0 ) ) & (! ( (tk(P99)) <= ( 1 ) )) ) & (! ( ( ( 1 ) <= (tk(P388)) ) & ( ( 1 ) <= (tk(P240)) ) )) ) & ( ( (tk(P20)) <= ( 1 ) ) | ( ( (tk(P425)) <= (tk(P317)) ) & ( ( ( 1 ) <= (tk(P211)) ) | ( ( 1 ) <= (tk(P235)) ) ) ) ) ) & (! ( ( ( (tk(P133)) <= (tk(P370)) ) | ( ( 1 ) <= (tk(P227)) ) ) | (! ( (tk(P374)) <= (tk(P227)) )) )) ) )) & ( (tk(P199)) <= (tk(P328)) ) ))))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P299)) <= (tk(P258)) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-03 (reachable & potential(( ( ( ( (tk(P295)) <= ( 1 ) ) | (! ( ( ( ( ( 1 ) <= (tk(P399)) ) | (! ( (tk(P302)) <= ( 1 ) )) ) & (! ( (tk(P394)) <= (tk(P307)) )) ) | ( ( ( ( (tk(P353)) <= (tk(P102)) ) & ( (tk(P158)) <= (tk(P94)) ) ) | (! ( (tk(P351)) <= ( 1 ) )) ) | ( (! ( ( 1 ) <= (tk(P16)) )) | ( ( ( 1 ) <= (tk(P93)) ) | ( ( 1 ) <= (tk(P228)) ) ) ) ) )) ) & ( ( (tk(P326)) <= (tk(P432)) ) | (! ( (! ( ( (tk(P173)) <= ( 1 ) ) & ( (tk(P350)) <= (tk(P225)) ) )) | (! ( ( (! ( (tk(P39)) <= (tk(P47)) )) | (! ( (tk(P253)) <= ( 1 ) )) ) | ( ( ( (tk(P101)) <= (tk(P133)) ) & ( (tk(P85)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P4)) ) & ( (tk(P119)) <= ( 0 ) ) ) ) )) )) ) ) & (! ( ( ( 1 ) <= (tk(P46)) ) | ( ( (! ( (tk(P348)) <= (tk(P31)) )) | ( ( (tk(P225)) <= ( 1 ) ) | (! ( ( 1 ) <= (tk(P337)) )) ) ) | ( ( (tk(P7)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P52)) ) | ( ( ( ( ( 1 ) <= (tk(P101)) ) & ( (tk(P414)) <= ( 0 ) ) ) | (! ( (tk(P260)) <= ( 1 ) )) ) & ( ( ( (tk(P227)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P279)) ) ) | ( ( 1 ) <= (tk(P1)) ) ) ) ) ) ) )) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-04 (reachable & potential(( (! ( (tk(P330)) <= ( 0 ) )) & (! ( ( ( 1 ) <= (tk(P313)) ) & ( ( 1 ) <= (tk(P279)) ) )) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-05 (reachable &!potential( ( ( ( (tk(P52)) <= (tk(P301)) ) | ( (! ( ( (tk(P86)) <= (tk(P325)) ) | ( ( ( (tk(P326)) <= ( 0 ) ) | (! ( (tk(P414)) <= (tk(P350)) )) ) & ( (tk(P189)) <= ( 0 ) ) ) )) & (! ( (! ( ( ( 1 ) <= (tk(P152)) ) | ( ( ( (tk(P223)) <= (tk(P316)) ) & ( (tk(P24)) <= (tk(P50)) ) ) & ( ( ( 1 ) <= (tk(P296)) ) & ( ( 1 ) <= (tk(P78)) ) ) ) )) & ( ( ( 1 ) <= (tk(P298)) ) & (! ( (tk(P346)) <= (tk(P24)) )) ) )) ) ) | ( ( ( 1 ) <= (tk(P355)) ) | ( ( ( (tk(P286)) <= ( 1 ) ) | ( (tk(P189)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P427)) ) ) ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-06 (reachable &!potential( (! ( (! ( (! ( (tk(P123)) <= ( 1 ) )) | ( (tk(P94)) <= (tk(P378)) ) )) & ( ( (tk(P26)) <= (tk(P227)) ) | ( ( (tk(P78)) <= (tk(P39)) ) | (! ( ( (tk(P292)) <= (tk(P85)) ) | ( (tk(P399)) <= ( 0 ) ) )) ) ) ))))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P320)) <= ( 0 ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-08 (reachable &!potential( ( ( ( ( ( ( (tk(P295)) <= (tk(P294)) ) | ( (tk(P251)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P252)) )) ) & (! ( (! ( ( (tk(P311)) <= ( 0 ) ) & ( ( ( (tk(P72)) <= ( 1 ) ) | ( (tk(P145)) <= (tk(P44)) ) ) & ( (tk(P327)) <= (tk(P358)) ) ) )) | ( (tk(P240)) <= (tk(P276)) ) )) ) | ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P220)) ) | ( ( 1 ) <= (tk(P213)) ) ) & ( ( ( 1 ) <= (tk(P89)) ) | ( ( 1 ) <= (tk(P358)) ) ) ) & ( (! ( ( 1 ) <= (tk(P242)) )) & ( ( (tk(P282)) <= ( 1 ) ) | ( (tk(P291)) <= (tk(P303)) ) ) ) ) | ( (tk(P314)) <= (tk(P323)) ) ) | ( ( ( 1 ) <= (tk(P311)) ) | ( ( (! ( (tk(P20)) <= (tk(P50)) )) & ( (tk(P100)) <= ( 1 ) ) ) | ( ( ( (tk(P219)) <= (tk(P400)) ) | ( ( 1 ) <= (tk(P342)) ) ) | ( ( (tk(P126)) <= (tk(P404)) ) | ( (tk(P307)) <= (tk(P343)) ) ) ) ) ) ) | ( ( (tk(P7)) <= ( 0 ) ) & ( ( ( ( ( (tk(P74)) <= (tk(P405)) ) | ( ( 1 ) <= (tk(P16)) ) ) & ( (tk(P366)) <= ( 0 ) ) ) | ( (! ( (tk(P208)) <= ( 1 ) )) | ( (tk(P307)) <= ( 0 ) ) ) ) | ( (! ( (tk(P105)) <= (tk(P393)) )) | ( ( (tk(P405)) <= ( 1 ) ) & (! ( (tk(P13)) <= ( 0 ) )) ) ) ) ) ) | (! ( (tk(P179)) <= (tk(P363)) )) ) ) & ( (tk(P282)) <= ( 1 ) ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-09 (reachable & potential((! ( (tk(P316)) <= ( 0 ) ))))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-10 (reachable &!potential( (! ( (! ( (! ( ( (! ( (tk(P323)) <= ( 1 ) )) | ( (! ( (tk(P225)) <= ( 0 ) )) | ( ( (tk(P72)) <= (tk(P196)) ) & ( (tk(P388)) <= (tk(P344)) ) ) ) ) & ( ( 1 ) <= (tk(P14)) ) )) | ( (! ( (! ( (tk(P28)) <= (tk(P415)) )) | ( ( (tk(P301)) <= ( 1 ) ) | ( (tk(P10)) <= ( 1 ) ) ) )) & (! ( ( ( 1 ) <= (tk(P56)) ) & ( ( ( (tk(P299)) <= (tk(P44)) ) | ( (tk(P432)) <= (tk(P323)) ) ) & ( ( (tk(P42)) <= (tk(P316)) ) | ( (tk(P417)) <= (tk(P373)) ) ) ) )) ) )) & ( (tk(P297)) <= (tk(P175)) ) ))))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-11 (reachable & potential((! ( ( ( 1 ) <= (tk(P179)) ) | (! ( (! ( (! ( ( ( 1 ) <= (tk(P59)) ) | ( (tk(P172)) <= ( 0 ) ) )) | (! ( ( (tk(P137)) <= (tk(P309)) ) & ( (tk(P84)) <= ( 0 ) ) )) )) & ( (! ( (! ( (tk(P394)) <= ( 1 ) )) | ( ( (tk(P430)) <= ( 1 ) ) & ( (tk(P415)) <= (tk(P198)) ) ) )) & (! ( ( 1 ) <= (tk(P287)) )) ) )) ))))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P234)) <= ( 0 ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-13 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P88)) )) | ( (tk(P325)) <= (tk(P8)) ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-14 (reachable &!potential( ( (tk(P255)) <= ( 1 ) )))
PROPERTY: DiscoveryGPU-PT-15b-ReachabilityCardinality-15 (reachable &!potential( ( ( (! ( (tk(P42)) <= ( 1 ) )) | ( (tk(P398)) <= (tk(P72)) ) ) | (! ( ( 1 ) <= (tk(P229)) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8170424 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105528 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="DiscoveryGPU-PT-15b"
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 DiscoveryGPU-PT-15b, 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 r139-smll-167819423000438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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