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

About the Execution of Smart+red for DoubleExponent-PT-002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
410.943 24407.00 39840.00 565.90 FTTTFFFTFTFTTFTT 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-167819423100454.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 DoubleExponent-PT-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819423100454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 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.2K 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 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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 DoubleExponent-PT-002-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678410142306

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=DoubleExponent-PT-002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 01:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 01:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 01:02:26] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-10 01:02:26] [INFO ] Transformed 110 places.
[2023-03-10 01:02:26] [INFO ] Transformed 98 transitions.
[2023-03-10 01:02:26] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 336 resets, run finished after 1021 ms. (steps per millisecond=9 ) properties (out of 14) seen :2
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 302 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 98 rows 110 cols
[2023-03-10 01:02:29] [INFO ] Computed 14 place invariants in 21 ms
[2023-03-10 01:02:30] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 01:02:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-10 01:02:30] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 01:02:30] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :2
[2023-03-10 01:02:31] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 8 ms to minimize.
[2023-03-10 01:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 117 ms
[2023-03-10 01:02:31] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2023-03-10 01:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-10 01:02:31] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-10 01:02:31] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 24 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 103 transition count 88
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 95 transition count 82
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 89 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 32 place count 89 transition count 79
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 52 place count 79 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 79 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 78 transition count 71
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 61 place count 78 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 68 place count 71 transition count 64
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 74 place count 71 transition count 64
Applied a total of 74 rules in 106 ms. Remains 71 /110 variables (removed 39) and now considering 64/98 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 71/110 places, 64/98 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 333 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 362 steps, run visited all 1 properties in 18 ms. (steps per millisecond=20 )
Probabilistic random walk after 362 steps, saw 189 distinct states, run finished after 18 ms. (steps per millisecond=20 ) properties seen :1
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 5784 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleExponent (PT), instance 002
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: 110 places, 98 transitions, 276 arcs.
Final Score: 1033.158
Took : 3 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-00 (reachable & potential((! ( ( ( ( (tk(P27)) <= (tk(P92)) ) | (! ( ( (tk(P4)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P7)) ) )) ) | ( ( (tk(P12)) <= ( 1 ) ) | (! ( ( ( ( ( (tk(P8)) <= ( 1 ) ) | ( (tk(P66)) <= ( 0 ) ) ) & ( ( (tk(P48)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P56)) ) ) ) | ( (! ( ( 1 ) <= (tk(P55)) )) | ( ( (tk(P21)) <= ( 1 ) ) & ( (tk(P78)) <= ( 0 ) ) ) ) ) & ( ( ( 1 ) <= (tk(P56)) ) & ( ( 1 ) <= (tk(P57)) ) ) )) ) ) & ( (tk(P108)) <= ( 1 ) ) ))))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-01 (reachable &!potential( ( ( (! ( ( ( (tk(P97)) <= ( 1 ) ) | ( ( (! ( ( ( 1 ) <= (tk(P58)) ) & ( (tk(P74)) <= ( 0 ) ) )) & ( ( ( (tk(P40)) <= (tk(P108)) ) | ( (tk(P109)) <= ( 0 ) ) ) | (! ( (tk(P85)) <= ( 1 ) )) ) ) | ( ( (tk(P9)) <= (tk(P14)) ) & ( ( ( ( 1 ) <= (tk(P81)) ) | ( (tk(P46)) <= (tk(P89)) ) ) & (! ( ( 1 ) <= (tk(P67)) )) ) ) ) ) | ( ( (! ( (tk(P14)) <= (tk(P47)) )) | ( ( 1 ) <= (tk(P94)) ) ) | ( ( (tk(P23)) <= (tk(P102)) ) | ( ( ( ( ( 1 ) <= (tk(P63)) ) | ( (tk(P69)) <= ( 0 ) ) ) & ( ( (tk(P101)) <= ( 1 ) ) | ( (tk(P36)) <= (tk(P34)) ) ) ) | (! ( (tk(P86)) <= (tk(P32)) )) ) ) ) )) & ( ( (tk(P44)) <= ( 1 ) ) | (! ( ( 1 ) <= (tk(P75)) )) ) ) | ( ( (! ( (! ( ( (! ( ( 1 ) <= (tk(P26)) )) & ( ( ( 1 ) <= (tk(P91)) ) | ( ( 1 ) <= (tk(P91)) ) ) ) | ( ( (tk(P80)) <= (tk(P95)) ) & ( ( (tk(P54)) <= (tk(P87)) ) | ( (tk(P109)) <= ( 1 ) ) ) ) )) & ( (tk(P13)) <= (tk(P32)) ) )) | ( ( (tk(P75)) <= ( 1 ) ) & ( ( ( ( ( 1 ) <= (tk(P59)) ) | ( ( ( (tk(P50)) <= (tk(P99)) ) & ( (tk(P71)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P71)) ) & ( ( 1 ) <= (tk(P5)) ) ) ) ) | ( ( (! ( (tk(P5)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P33)) ) ) | ( ( 1 ) <= (tk(P85)) ) ) ) | ( ( ( ( (tk(P97)) <= ( 0 ) ) & (! ( ( 1 ) <= (tk(P36)) )) ) | ( ( 1 ) <= (tk(P77)) ) ) | ( (tk(P46)) <= ( 1 ) ) ) ) ) ) | ( ( ( (tk(P68)) <= ( 1 ) ) | (! ( ( (! ( (tk(P75)) <= ( 0 ) )) | ( ( ( (tk(P107)) <= (tk(P7)) ) | ( (tk(P110)) <= ( 1 ) ) ) | ( (tk(P105)) <= ( 1 ) ) ) ) & ( ( ( 1 ) <= (tk(P14)) ) & ( ( ( (tk(P68)) <= ( 1 ) ) | ( (tk(P13)) <= (tk(P95)) ) ) | ( ( ( 1 ) <= (tk(P37)) ) & ( (tk(P3)) <= ( 0 ) ) ) ) ) )) ) | ( ( ( (! ( (tk(P76)) <= ( 1 ) )) & ( (tk(P15)) <= (tk(P64)) ) ) | (! ( ( (tk(P29)) <= (tk(P48)) ) & (! ( ( 1 ) <= (tk(P103)) )) )) ) & (! ( (! ( ( 1 ) <= (tk(P24)) )) | ( ( ( (tk(P104)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P62)) ) ) & ( ( (tk(P76)) <= (tk(P82)) ) | ( (tk(P102)) <= (tk(P17)) ) ) ) )) ) ) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-02 (reachable &!potential( ( ( (tk(P9)) <= ( 1 ) ) | (! ( ( ( (tk(P83)) <= ( 0 ) ) | ( (tk(P5)) <= (tk(P22)) ) ) & ( ( ( ( ( ( ( ( 1 ) <= (tk(P73)) ) & ( ( 1 ) <= (tk(P69)) ) ) & ( ( (tk(P74)) <= ( 1 ) ) | ( (tk(P24)) <= (tk(P56)) ) ) ) & ( (tk(P72)) <= ( 0 ) ) ) | ( (! ( ( 1 ) <= (tk(P42)) )) | ( (! ( ( 1 ) <= (tk(P84)) )) & ( ( (tk(P6)) <= (tk(P16)) ) | ( (tk(P110)) <= (tk(P102)) ) ) ) ) ) & ( (tk(P77)) <= ( 0 ) ) ) | ( (! ( (tk(P100)) <= ( 1 ) )) | (! ( ( ( 1 ) <= (tk(P42)) ) & ( ( 1 ) <= (tk(P21)) ) )) ) ) )) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P82)) <= ( 1 ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-04 (reachable & potential(( ( ( ( 1 ) <= (tk(P86)) ) & ( (! ( (! ( ( 1 ) <= (tk(P51)) )) | ( (! ( ( (tk(P110)) <= (tk(P66)) ) & ( ( (tk(P107)) <= ( 1 ) ) & ( (tk(P21)) <= ( 1 ) ) ) )) | ( ( (tk(P77)) <= (tk(P5)) ) & ( ( ( ( 1 ) <= (tk(P110)) ) & ( ( 1 ) <= (tk(P25)) ) ) & ( ( (tk(P67)) <= (tk(P33)) ) & ( (tk(P53)) <= ( 0 ) ) ) ) ) ) )) | ( ( (tk(P72)) <= (tk(P87)) ) | (! ( (tk(P34)) <= (tk(P20)) )) ) ) ) & ( ( ( 1 ) <= (tk(P20)) ) & ( ( (tk(P61)) <= (tk(P107)) ) | (! ( ( 1 ) <= (tk(P47)) )) ) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( ( ( ( ( (tk(P70)) <= (tk(P47)) ) & ( ( ( 1 ) <= (tk(P45)) ) & ( (tk(P103)) <= (tk(P88)) ) ) ) | (! ( ( (tk(P48)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P3)) ) )) ) & (! ( (tk(P92)) <= (tk(P24)) )) ) & ( (tk(P84)) <= ( 1 ) ) ) | ( (! ( ( 1 ) <= (tk(P103)) )) & ( (tk(P56)) <= (tk(P67)) ) ) ) | ( (tk(P58)) <= (tk(P26)) ) ) & ( ( ( 1 ) <= (tk(P16)) ) & (! ( ( (tk(P50)) <= ( 1 ) ) | ( ( (! ( ( (tk(P93)) <= (tk(P101)) ) | ( ( 1 ) <= (tk(P104)) ) )) & (! ( ( (tk(P66)) <= ( 1 ) ) | ( (tk(P10)) <= ( 1 ) ) )) ) & ( ( ( ( 1 ) <= (tk(P35)) ) | ( (tk(P46)) <= (tk(P86)) ) ) | ( ( (tk(P8)) <= (tk(P62)) ) & ( ( (tk(P25)) <= (tk(P12)) ) & ( ( 1 ) <= (tk(P13)) ) ) ) ) ) )) ) ) & ( (tk(P51)) <= (tk(P102)) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-06 (reachable & potential(( ( ( (! ( ( (! ( ( 1 ) <= (tk(P60)) )) | ( (tk(P53)) <= ( 1 ) ) ) | (! ( (tk(P76)) <= (tk(P6)) )) )) | (! ( (tk(P51)) <= (tk(P2)) )) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P107)) ) | ( ( (tk(P105)) <= (tk(P92)) ) | ( ( (tk(P29)) <= (tk(P75)) ) & ( (tk(P106)) <= (tk(P52)) ) ) ) ) & ( (tk(P74)) <= (tk(P79)) ) ) & ( (tk(P82)) <= (tk(P50)) ) ) & ( (tk(P57)) <= (tk(P92)) ) ) | ( ( ( ( (tk(P79)) <= (tk(P62)) ) & ( ( ( (tk(P104)) <= (tk(P31)) ) | (! ( (tk(P87)) <= (tk(P14)) )) ) & (! ( ( (tk(P78)) <= (tk(P80)) ) & ( (tk(P96)) <= (tk(P95)) ) )) ) ) | ( ( 1 ) <= (tk(P90)) ) ) & ( ( 1 ) <= (tk(P6)) ) ) ) ) & ( ( (tk(P8)) <= ( 1 ) ) | ( ( ( ( (! ( ( 1 ) <= (tk(P105)) )) & ( (tk(P81)) <= ( 1 ) ) ) & ( ( (! ( ( 1 ) <= (tk(P29)) )) | ( ( ( ( 1 ) <= (tk(P80)) ) & ( (tk(P37)) <= (tk(P95)) ) ) | ( ( (tk(P94)) <= (tk(P28)) ) | ( (tk(P35)) <= ( 0 ) ) ) ) ) & ( ( ( (tk(P4)) <= ( 1 ) ) | ( (tk(P33)) <= (tk(P89)) ) ) & (! ( ( ( 1 ) <= (tk(P8)) ) & ( ( 1 ) <= (tk(P32)) ) )) ) ) ) & ( ( 1 ) <= (tk(P50)) ) ) | ( (tk(P91)) <= ( 1 ) ) ) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P32)) <= ( 1 ) ) & ( ( (! ( ( (tk(P77)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P14)) ) )) | ( (tk(P56)) <= ( 0 ) ) ) | ( ( ( (! ( ( ( ( ( 1 ) <= (tk(P68)) ) | ( (tk(P75)) <= ( 0 ) ) ) & ( (tk(P79)) <= (tk(P75)) ) ) | ( (tk(P59)) <= (tk(P71)) ) )) | (! ( (tk(P102)) <= (tk(P28)) )) ) | ( (tk(P86)) <= ( 1 ) ) ) | ( (tk(P56)) <= (tk(P9)) ) ) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-08 (reachable & potential((! ( (! ( ( ( (! ( (tk(P70)) <= ( 1 ) )) & ( ( ( ( ( 1 ) <= (tk(P86)) ) & ( (tk(P108)) <= (tk(P26)) ) ) | ( (tk(P24)) <= ( 1 ) ) ) & ( (! ( (tk(P27)) <= ( 0 ) )) & ( ( (tk(P67)) <= (tk(P108)) ) | ( (tk(P87)) <= ( 1 ) ) ) ) ) ) | ( ( (tk(P50)) <= (tk(P48)) ) | ( ( (tk(P73)) <= (tk(P55)) ) | ( ( ( (tk(P49)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P92)) ) ) & ( (tk(P80)) <= ( 0 ) ) ) ) ) ) | ( ( ( (tk(P57)) <= ( 0 ) ) | ( (tk(P83)) <= ( 0 ) ) ) | ( (tk(P50)) <= (tk(P29)) ) ) )) | (! ( ( (! ( ( (! ( ( 1 ) <= (tk(P21)) )) | ( ( (tk(P102)) <= (tk(P40)) ) & ( ( 1 ) <= (tk(P89)) ) ) ) | ( ( ( (tk(P47)) <= ( 1 ) ) | ( (tk(P60)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P36)) ) & ( (tk(P19)) <= (tk(P67)) ) ) ) )) & ( ( (tk(P71)) <= ( 0 ) ) | (! ( ( (tk(P16)) <= ( 1 ) ) | ( (tk(P77)) <= (tk(P63)) ) )) ) ) & ( ( (tk(P96)) <= (tk(P25)) ) | ( (! ( ( ( (tk(P15)) <= (tk(P33)) ) & ( ( 1 ) <= (tk(P32)) ) ) | (! ( (tk(P6)) <= ( 1 ) )) )) | ( (tk(P12)) <= (tk(P83)) ) ) ) )) ))))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-09 (reachable &!potential( ( (tk(P95)) <= ( 1 ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-10 (reachable & potential(( ( ( 1 ) <= (tk(P82)) ) & ( ( ( 1 ) <= (tk(P50)) ) | ( ( 1 ) <= (tk(P17)) ) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-11 (reachable & potential((! ( ( ( 1 ) <= (tk(P32)) ) | ( ( (! ( (tk(P74)) <= (tk(P15)) )) | ( ( (tk(P18)) <= (tk(P35)) ) | ( (tk(P84)) <= (tk(P96)) ) ) ) & ( ( ( 1 ) <= (tk(P19)) ) | ( ( ( (! ( ( (tk(P65)) <= (tk(P89)) ) & ( ( 1 ) <= (tk(P42)) ) )) & ( ( ( 1 ) <= (tk(P92)) ) | ( ( ( 1 ) <= (tk(P29)) ) | ( (tk(P87)) <= (tk(P66)) ) ) ) ) | (! ( ( ( (tk(P65)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P64)) ) ) | ( (tk(P27)) <= (tk(P86)) ) )) ) & ( ( 1 ) <= (tk(P39)) ) ) ) ) ))))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-12 (reachable & potential(( ( 1 ) <= (tk(P27)) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-13 (reachable &!potential( ( (! ( (tk(P87)) <= (tk(P77)) )) | ( (! ( ( 1 ) <= (tk(P46)) )) & ( (tk(P36)) <= (tk(P105)) ) ) )))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-14 (reachable & potential((! ( ( ( (tk(P109)) <= (tk(P99)) ) | (! ( ( 1 ) <= (tk(P87)) )) ) & ( ( ( ( ( ( (tk(P66)) <= ( 1 ) ) | ( ( ( (tk(P31)) <= ( 1 ) ) | ( (tk(P69)) <= ( 1 ) ) ) | ( ( (tk(P74)) <= ( 1 ) ) & ( (tk(P24)) <= ( 0 ) ) ) ) ) | ( ( ( ( (tk(P23)) <= (tk(P70)) ) & ( (tk(P52)) <= (tk(P39)) ) ) & ( (tk(P24)) <= ( 0 ) ) ) & ( ( ( ( 1 ) <= (tk(P74)) ) & ( (tk(P21)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P46)) ) & ( (tk(P17)) <= ( 1 ) ) ) ) ) ) & ( (tk(P7)) <= (tk(P7)) ) ) | ( (! ( (tk(P1)) <= ( 1 ) )) | ( ( ( ( ( 1 ) <= (tk(P100)) ) | ( ( 1 ) <= (tk(P57)) ) ) & ( ( ( (tk(P67)) <= ( 0 ) ) & ( (tk(P18)) <= (tk(P71)) ) ) & ( ( ( 1 ) <= (tk(P69)) ) | ( (tk(P42)) <= ( 0 ) ) ) ) ) & ( (tk(P100)) <= ( 1 ) ) ) ) ) & ( (tk(P77)) <= (tk(P89)) ) ) ))))
PROPERTY: DoubleExponent-PT-002-ReachabilityCardinality-15 (reachable & potential(( ( (! ( (! ( (tk(P20)) <= (tk(P66)) )) & ( (tk(P67)) <= (tk(P56)) ) )) | ( ( (! ( (tk(P61)) <= (tk(P6)) )) & ( (tk(P84)) <= (tk(P17)) ) ) & ( ( (! ( ( ( ( (tk(P108)) <= (tk(P2)) ) | ( ( 1 ) <= (tk(P71)) ) ) | ( ( 1 ) <= (tk(P106)) ) ) & ( ( 1 ) <= (tk(P40)) ) )) | ( (tk(P109)) <= (tk(P70)) ) ) | ( (tk(P63)) <= ( 1 ) ) ) ) ) | ( ( ( (! ( (! ( ( (tk(P105)) <= ( 1 ) ) & ( (tk(P47)) <= ( 0 ) ) )) & ( ( ( (tk(P81)) <= ( 0 ) ) & ( (tk(P42)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P54)) ) & ( (tk(P39)) <= ( 1 ) ) ) ) )) & ( ( (tk(P107)) <= ( 0 ) ) | ( ( (tk(P51)) <= ( 1 ) ) | ( (tk(P109)) <= ( 1 ) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P13)) )) | ( ( ( (! ( ( 1 ) <= (tk(P19)) )) | ( ( (tk(P57)) <= ( 1 ) ) & ( (tk(P9)) <= (tk(P68)) ) ) ) | ( (! ( (tk(P81)) <= ( 0 ) )) & ( ( (tk(P28)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P109)) ) ) ) ) & (! ( (! ( (tk(P36)) <= ( 0 ) )) | ( (tk(P75)) <= ( 0 ) ) )) ) ) | ( ( 1 ) <= (tk(P23)) ) ) ) & ( (tk(P53)) <= ( 1 ) ) ) )))
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DoubleExponent-PT-002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678410166713

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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-167819423100454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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