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

About the Execution of Smart+red for HirschbergSinclair-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
422.020 31697.00 52704.00 488.00 TTTTTFTFTFFFFTTT 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.r203-smll-167840349600454.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 HirschbergSinclair-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349600454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 14K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 284K 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 HirschbergSinclair-PT-20-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678625915828

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=HirschbergSinclair-PT-20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 12:58:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 12:58:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:58:39] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-12 12:58:39] [INFO ] Transformed 530 places.
[2023-03-12 12:58:39] [INFO ] Transformed 485 transitions.
[2023-03-12 12:58:39] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 20 resets, run finished after 1119 ms. (steps per millisecond=8 ) properties (out of 16) seen :9
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 485 rows 530 cols
[2023-03-12 12:58:41] [INFO ] Computed 45 place invariants in 30 ms
[2023-03-12 12:58:41] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 12:58:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2023-03-12 12:58:42] [INFO ] [Nat]Absence check using 40 positive and 5 generalized place invariants in 14 ms returned sat
[2023-03-12 12:58:42] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-12 12:58:43] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 15 ms to minimize.
[2023-03-12 12:58:44] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 2 ms to minimize.
[2023-03-12 12:58:44] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 2 ms to minimize.
[2023-03-12 12:58:44] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 2 ms to minimize.
[2023-03-12 12:58:45] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 3 ms to minimize.
[2023-03-12 12:58:45] [INFO ] Deduced a trap composed of 50 places in 401 ms of which 2 ms to minimize.
[2023-03-12 12:58:45] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2023-03-12 12:58:46] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 1 ms to minimize.
[2023-03-12 12:58:46] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 0 ms to minimize.
[2023-03-12 12:58:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3055 ms
[2023-03-12 12:58:46] [INFO ] After 4086ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 301 ms.
[2023-03-12 12:58:46] [INFO ] After 4806ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 58 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 485/485 transitions.
Graph (complete) has 1018 edges and 530 vertex of which 509 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 509 transition count 344
Reduce places removed 139 places and 0 transitions.
Graph (complete) has 653 edges and 370 vertex of which 338 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 157 rules applied. Total rules applied 299 place count 338 transition count 327
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 348 place count 321 transition count 295
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 353 place count 316 transition count 290
Iterating global reduction 3 with 5 rules applied. Total rules applied 358 place count 316 transition count 290
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 362 place count 312 transition count 286
Iterating global reduction 3 with 4 rules applied. Total rules applied 366 place count 312 transition count 286
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 386 place count 312 transition count 266
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 406 place count 292 transition count 266
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 417 place count 281 transition count 255
Applied a total of 417 rules in 179 ms. Remains 281 /530 variables (removed 249) and now considering 255/485 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 281/530 places, 255/485 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 758092 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 758092 steps, saw 166316 distinct states, run finished after 3003 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 255 rows 281 cols
[2023-03-12 12:58:50] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-12 12:58:50] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:58:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 12:58:50] [INFO ] [Nat]Absence check using 3 positive and 23 generalized place invariants in 29 ms returned sat
[2023-03-12 12:58:50] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:58:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 12:58:50] [INFO ] After 115ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:58:50] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 12:58:50] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 58 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 255/255 transitions.
Applied a total of 0 rules in 27 ms. Remains 281 /281 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 281/281 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 255/255 transitions.
Applied a total of 0 rules in 27 ms. Remains 281 /281 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-12 12:58:50] [INFO ] Invariant cache hit.
[2023-03-12 12:58:51] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-12 12:58:51] [INFO ] Invariant cache hit.
[2023-03-12 12:58:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 12:58:52] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2023-03-12 12:58:52] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 12:58:52] [INFO ] Invariant cache hit.
[2023-03-12 12:58:53] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 281/281 places, 255/255 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 280 transition count 188
Reduce places removed 67 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 74 rules applied. Total rules applied 142 place count 213 transition count 181
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 149 place count 206 transition count 181
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 149 place count 206 transition count 150
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 211 place count 175 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 173 transition count 148
Applied a total of 215 rules in 49 ms. Remains 173 /281 variables (removed 108) and now considering 148/255 (removed 107) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 173 cols
[2023-03-12 12:58:53] [INFO ] Computed 25 place invariants in 13 ms
[2023-03-12 12:58:53] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:58:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 12:58:53] [INFO ] [Nat]Absence check using 3 positive and 22 generalized place invariants in 30 ms returned sat
[2023-03-12 12:58:53] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:58:53] [INFO ] After 271ms 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-12 12:58:53] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:58:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-12 12:58:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 281 places, 255 transitions and 900 arcs took 7 ms.
[2023-03-12 12:58:54] [INFO ] Flatten gal took : 110 ms
Total runtime 15355 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HirschbergSinclair (PT), instance 20
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: 281 places, 255 transitions, 900 arcs.
Final Score: 4670.067
Took : 11 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: HirschbergSinclair-PT-20-ReachabilityCardinality-01 (reachable & potential(( ( ( ( (! ( ( 1 ) <= (tk(P22)) )) & ( (! ( ( 1 ) <= (tk(P164)) )) & (! ( (tk(P47)) <= (tk(P281)) )) ) ) & ( ( (tk(P233)) <= ( 0 ) ) & ( (! ( (tk(P110)) <= ( 0 ) )) & (! ( (tk(P41)) <= ( 0 ) )) ) ) ) & ( ( ( ( 1 ) <= (tk(P42)) ) & ( (! ( ( 1 ) <= (tk(P69)) )) & (! ( (tk(P33)) <= ( 0 ) )) ) ) & ( ( (tk(P206)) <= (tk(P191)) ) & ( ( (! ( (tk(P31)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P157)) )) ) & ( ( ( (! ( (tk(P154)) <= (tk(P18)) )) & (! ( ( 1 ) <= (tk(P26)) )) ) & ( (! ( (tk(P171)) <= (tk(P275)) )) & (! ( ( 1 ) <= (tk(P3)) )) ) ) | ( (! ( (tk(P90)) <= (tk(P137)) )) & ( (! ( ( 1 ) <= (tk(P74)) )) | (! ( (tk(P45)) <= ( 0 ) )) ) ) ) ) ) ) ) | ( ( ( (tk(P271)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P148)) ) | ( ( ( 1 ) <= (tk(P43)) ) | ( ( (tk(P197)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P35)) ) ) ) ) ) & ( ( (! ( (tk(P229)) <= (tk(P63)) )) | (! ( (tk(P130)) <= ( 1 ) )) ) & ( ( ( (! ( ( 1 ) <= (tk(P80)) )) | ( ( (tk(P257)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P173)) ) | ( (! ( (tk(P199)) <= (tk(P109)) )) & ( (! ( (tk(P51)) <= ( 0 ) )) & ( (! ( (tk(P166)) <= ( 1 ) )) | (! ( (tk(P44)) <= ( 0 ) )) ) ) ) ) ) ) | ( ( ( (tk(P40)) <= (tk(P68)) ) & ( (tk(P59)) <= ( 0 ) ) ) | ( ( (tk(P183)) <= (tk(P279)) ) & ( (tk(P53)) <= ( 1 ) ) ) ) ) & ( ( (! ( (tk(P24)) <= (tk(P107)) )) | ( (! ( (tk(P103)) <= (tk(P55)) )) | ( (tk(P277)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P159)) ) | ( (tk(P97)) <= (tk(P4)) ) ) | ( ( ( ( 1 ) <= (tk(P269)) ) & ( (tk(P61)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P255)) ) & ( (tk(P235)) <= ( 0 ) ) ) ) ) ) ) ) ) )))
FORMULA HirschbergSinclair-PT-20-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678625947525

--------------------
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="HirschbergSinclair-PT-20"
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 HirschbergSinclair-PT-20, 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 r203-smll-167840349600454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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