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

About the Execution of Smart+red for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15405.436 3600000.00 3638183.00 11517.90 FTTTFTFTTTTTTTTF 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.r267-smll-167863541800438.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 Parking-PT-432, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541800438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678875248726

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=Parking-PT-432
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 10:14:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 10:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:14:12] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-15 10:14:12] [INFO ] Transformed 529 places.
[2023-03-15 10:14:12] [INFO ] Transformed 785 transitions.
[2023-03-15 10:14:12] [INFO ] Found NUPN structural information;
[2023-03-15 10:14:12] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 89 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 13) seen :7
FORMULA Parking-PT-432-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 457 rows 529 cols
[2023-03-15 10:14:13] [INFO ] Computed 124 place invariants in 35 ms
[2023-03-15 10:14:14] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 10:14:14] [INFO ] [Nat]Absence check using 120 positive place invariants in 60 ms returned sat
[2023-03-15 10:14:14] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 10:14:15] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-15 10:14:15] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-15 10:14:15] [INFO ] After 263ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-15 10:14:16] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-15 10:14:16] [INFO ] After 2480ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA Parking-PT-432-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA Parking-PT-432-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 119 ms.
Support contains 39 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 457/457 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 529 transition count 446
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 518 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 516 transition count 444
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 26 place count 516 transition count 432
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 50 place count 504 transition count 432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 500 transition count 428
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 500 transition count 428
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 88 place count 485 transition count 413
Free-agglomeration rule applied 70 times.
Iterating global reduction 3 with 70 rules applied. Total rules applied 158 place count 485 transition count 343
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 228 place count 415 transition count 343
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 415 transition count 342
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 232 place count 415 transition count 342
Applied a total of 232 rules in 432 ms. Remains 415 /529 variables (removed 114) and now considering 342/457 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 415/529 places, 342/457 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
FORMULA Parking-PT-432-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
FORMULA Parking-PT-432-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 342 rows 415 cols
[2023-03-15 10:14:17] [INFO ] Computed 124 place invariants in 9 ms
[2023-03-15 10:14:18] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:14:18] [INFO ] [Nat]Absence check using 120 positive place invariants in 59 ms returned sat
[2023-03-15 10:14:18] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 10:14:18] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:14:18] [INFO ] State equation strengthened by 234 read => feed constraints.
[2023-03-15 10:14:18] [INFO ] After 130ms SMT Verify possible using 234 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:14:18] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-15 10:14:18] [INFO ] After 878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
FORMULA Parking-PT-432-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 6784 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Parking (PT), instance 432
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: 529 places, 785 transitions, 2329 arcs.
Final Score: 30509.273
Took : 33 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Parking-PT-432-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (! ( (! ( ( ( (tk(P12)) <= (tk(P21)) ) | ( ( 1 ) <= (tk(P45)) ) ) | ( ( 1 ) <= (tk(P272)) ) )) & ( (tk(P468)) <= ( 1 ) ) )) | ( (! ( (tk(P154)) <= (tk(P118)) )) & (! ( ( 1 ) <= (tk(P104)) )) ) ) | ( (tk(P353)) <= (tk(P335)) ) ) | ( (tk(P142)) <= ( 0 ) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P437)) )) & ( (! ( ( (tk(P327)) <= (tk(P299)) ) & (! ( (tk(P116)) <= ( 1 ) )) )) | (! ( ( (tk(P478)) <= ( 1 ) ) & ( (tk(P248)) <= ( 1 ) ) )) ) ) & ( (tk(P511)) <= (tk(P211)) ) ) | (! ( ( ( ( ( (tk(P157)) <= ( 0 ) ) | (! ( ( (tk(P317)) <= (tk(P154)) ) | ( (tk(P244)) <= (tk(P456)) ) )) ) | (! ( (tk(P272)) <= (tk(P249)) )) ) | ( ( (tk(P65)) <= ( 1 ) ) | ( ( ( ( (tk(P296)) <= (tk(P338)) ) | ( ( 1 ) <= (tk(P7)) ) ) | (! ( ( 1 ) <= (tk(P410)) )) ) | (! ( ( (tk(P181)) <= (tk(P200)) ) | ( (tk(P273)) <= (tk(P441)) ) )) ) ) ) | ( ( 1 ) <= (tk(P61)) ) )) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-01 (reachable & potential(( (! ( (tk(P78)) <= (tk(P243)) )) & ( (tk(P300)) <= (tk(P483)) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-02 (reachable & potential(( ( 1 ) <= (tk(P93)) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P400)) <= ( 1 ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P212)) <= (tk(P31)) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-05 (reachable & potential((! ( ( ( ( ( (! ( ( 1 ) <= (tk(P131)) )) | (! ( (tk(P434)) <= (tk(P169)) )) ) & ( (tk(P223)) <= (tk(P114)) ) ) | ( ( 1 ) <= (tk(P165)) ) ) | ( ( (tk(P52)) <= (tk(P360)) ) | ( ( (tk(P73)) <= ( 0 ) ) & ( ( (tk(P458)) <= (tk(P334)) ) & ( (! ( ( 1 ) <= (tk(P37)) )) | (! ( (tk(P473)) <= ( 1 ) )) ) ) ) ) ) | ( (tk(P64)) <= (tk(P401)) ) ))))
PROPERTY: Parking-PT-432-ReachabilityCardinality-06 (reachable & potential(( ( ( ( ( (! ( ( ( ( ( 1 ) <= (tk(P162)) ) & ( ( 1 ) <= (tk(P363)) ) ) & ( (tk(P475)) <= (tk(P293)) ) ) | ( (! ( (tk(P362)) <= (tk(P147)) )) & ( ( ( 1 ) <= (tk(P231)) ) & ( (tk(P360)) <= (tk(P174)) ) ) ) )) | ( (! ( ( (tk(P217)) <= ( 1 ) ) | ( (tk(P64)) <= ( 0 ) ) )) | ( ( 1 ) <= (tk(P521)) ) ) ) & ( ( ( ( (tk(P44)) <= ( 0 ) ) | (! ( ( (tk(P410)) <= (tk(P285)) ) & ( ( 1 ) <= (tk(P397)) ) )) ) | ( ( ( ( (tk(P488)) <= (tk(P261)) ) | ( (tk(P43)) <= (tk(P432)) ) ) | ( (tk(P7)) <= (tk(P422)) ) ) & (! ( ( 1 ) <= (tk(P289)) )) ) ) | ( (! ( (tk(P27)) <= ( 1 ) )) & (! ( (! ( (tk(P296)) <= ( 1 ) )) & ( (tk(P72)) <= (tk(P231)) ) )) ) ) ) & ( (! ( (tk(P158)) <= (tk(P439)) )) | ( ( (tk(P127)) <= (tk(P58)) ) & ( ( ( ( ( (tk(P330)) <= (tk(P125)) ) | ( (tk(P400)) <= ( 0 ) ) ) | ( ( (tk(P144)) <= (tk(P67)) ) | ( ( 1 ) <= (tk(P109)) ) ) ) | ( ( 1 ) <= (tk(P141)) ) ) | (! ( ( 1 ) <= (tk(P283)) )) ) ) ) ) & (! ( (tk(P410)) <= ( 1 ) )) ) & ( ( 1 ) <= (tk(P398)) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-07 (reachable & potential(( ( (tk(P335)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P344)) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-08 (reachable & potential(( ( 1 ) <= (tk(P134)) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-09 (reachable & potential((! ( (tk(P337)) <= ( 0 ) ))))
PROPERTY: Parking-PT-432-ReachabilityCardinality-10 (reachable & potential(( ( 1 ) <= (tk(P453)) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-11 (reachable & potential(( (! ( (tk(P208)) <= (tk(P309)) )) & ( ( ( ( ( (! ( (! ( ( 1 ) <= (tk(P499)) )) & (! ( (tk(P279)) <= ( 0 ) )) )) | ( ( ( ( (tk(P488)) <= (tk(P105)) ) | ( ( 1 ) <= (tk(P360)) ) ) | (! ( (tk(P68)) <= ( 0 ) )) ) & (! ( (tk(P344)) <= ( 0 ) )) ) ) | ( (! ( ( (tk(P401)) <= ( 1 ) ) & ( (tk(P29)) <= ( 0 ) ) )) & ( ( (tk(P77)) <= ( 1 ) ) | ( ( (tk(P529)) <= (tk(P517)) ) & ( ( (tk(P147)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P498)) ) ) ) ) ) ) | ( ( (tk(P49)) <= (tk(P371)) ) & (! ( ( ( ( 1 ) <= (tk(P247)) ) & ( (tk(P92)) <= ( 0 ) ) ) | (! ( (tk(P178)) <= (tk(P310)) )) )) ) ) | ( ( ( 1 ) <= (tk(P188)) ) & ( (tk(P146)) <= (tk(P322)) ) ) ) & (! ( ( (tk(P390)) <= ( 0 ) ) | (! ( (! ( (tk(P486)) <= ( 1 ) )) | (! ( (tk(P284)) <= (tk(P502)) )) )) )) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-12 (reachable & potential(( (! ( (tk(P235)) <= (tk(P509)) )) & ( (tk(P302)) <= ( 0 ) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-13 (reachable & potential(( (! ( ( ( (tk(P97)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P115)) ) & ( (! ( ( (tk(P376)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P43)) ) )) | (! ( ( (tk(P14)) <= ( 1 ) ) & ( (tk(P429)) <= (tk(P116)) ) )) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P345)) ) | ( ( 1 ) <= (tk(P468)) ) ) | ( ( (tk(P203)) <= ( 1 ) ) | ( (tk(P3)) <= ( 1 ) ) ) ) & ( ( (tk(P113)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P89)) ) & ( (tk(P472)) <= ( 1 ) ) ) ) ) | ( ( ( ( (tk(P393)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P356)) ) ) | (! ( (tk(P143)) <= ( 0 ) )) ) | (! ( ( ( 1 ) <= (tk(P402)) ) & ( (tk(P498)) <= ( 1 ) ) )) ) ) ) ) | (! ( (tk(P471)) <= (tk(P360)) )) )) | ( ( 1 ) <= (tk(P143)) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P516)) <= ( 0 ) ) | ( (! ( ( ( 1 ) <= (tk(P39)) ) & ( (! ( ( (! ( (tk(P481)) <= (tk(P324)) )) & ( ( ( 1 ) <= (tk(P391)) ) | ( (tk(P93)) <= ( 1 ) ) ) ) | ( ( ( (tk(P11)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P254)) ) ) | (! ( ( 1 ) <= (tk(P181)) )) ) )) & ( (tk(P417)) <= ( 1 ) ) ) )) | ( ( (tk(P89)) <= ( 1 ) ) | ( (! ( ( ( (tk(P181)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P110)) ) ) & ( ( ( (tk(P456)) <= (tk(P4)) ) | ( (tk(P217)) <= (tk(P452)) ) ) | (! ( (tk(P273)) <= ( 0 ) )) ) )) | ( ( ( ( (tk(P473)) <= ( 1 ) ) & ( ( (tk(P427)) <= (tk(P281)) ) & ( ( (tk(P158)) <= (tk(P306)) ) & ( (tk(P49)) <= (tk(P118)) ) ) ) ) | (! ( (! ( (tk(P207)) <= ( 0 ) )) & ( ( (tk(P481)) <= (tk(P108)) ) & ( (tk(P180)) <= (tk(P217)) ) ) )) ) | (! ( ( ( ( (tk(P264)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P147)) ) ) | (! ( ( 1 ) <= (tk(P405)) )) ) & ( ( ( (tk(P449)) <= (tk(P4)) ) & ( (tk(P222)) <= (tk(P24)) ) ) | ( ( ( 1 ) <= (tk(P350)) ) & ( (tk(P511)) <= (tk(P407)) ) ) ) )) ) ) ) ) )))
PROPERTY: Parking-PT-432-ReachabilityCardinality-15 (reachable & potential(( (! ( ( ( (tk(P141)) <= (tk(P189)) ) & ( ( (tk(P445)) <= ( 1 ) ) | (! ( ( (tk(P110)) <= ( 0 ) ) & ( (tk(P430)) <= ( 1 ) ) )) ) ) | (! ( ( 1 ) <= (tk(P205)) )) )) & ( ( (tk(P518)) <= ( 1 ) ) & (! ( (! ( (! ( ( 1 ) <= (tk(P155)) )) & ( (! ( ( (tk(P260)) <= ( 1 ) ) & ( (tk(P285)) <= ( 1 ) ) )) | ( ( (tk(P398)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P250)) ) ) ) )) | ( (! ( (tk(P216)) <= ( 0 ) )) | ( (! ( (tk(P144)) <= ( 0 ) )) & (! ( ( ( (tk(P421)) <= (tk(P80)) ) & ( ( 1 ) <= (tk(P360)) ) ) & ( (tk(P126)) <= (tk(P121)) ) )) ) ) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 745004 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101536 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="Parking-PT-432"
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 Parking-PT-432, 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 r267-smll-167863541800438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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