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-167840349600470.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-30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349600470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K 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.6K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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 357K 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-30-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678631694221

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-30
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 14:34:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:34:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:34:57] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-12 14:34:57] [INFO ] Transformed 670 places.
[2023-03-12 14:34:57] [INFO ] Transformed 605 transitions.
[2023-03-12 14:34:57] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 16) seen :11
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 605 rows 670 cols
[2023-03-12 14:34:59] [INFO ] Computed 65 place invariants in 26 ms
[2023-03-12 14:35:00] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:35:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 82 ms returned sat
[2023-03-12 14:35:00] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-12 14:35:02] [INFO ] After 1404ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-12 14:35:03] [INFO ] Deduced a trap composed of 21 places in 364 ms of which 12 ms to minimize.
[2023-03-12 14:35:03] [INFO ] Deduced a trap composed of 11 places in 426 ms of which 2 ms to minimize.
[2023-03-12 14:35:04] [INFO ] Deduced a trap composed of 95 places in 444 ms of which 2 ms to minimize.
[2023-03-12 14:35:04] [INFO ] Deduced a trap composed of 95 places in 464 ms of which 3 ms to minimize.
[2023-03-12 14:35:05] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 2 ms to minimize.
[2023-03-12 14:35:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2945 ms
[2023-03-12 14:35:06] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 2 ms to minimize.
[2023-03-12 14:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2023-03-12 14:35:06] [INFO ] After 5604ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 1175 ms.
[2023-03-12 14:35:07] [INFO ] After 7381ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 106 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 641 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.6 ms
Discarding 29 places :
Also discarding 0 output transitions
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 641 transition count 454
Reduce places removed 151 places and 0 transitions.
Graph (complete) has 848 edges and 490 vertex of which 439 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 0 output transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 175 rules applied. Total rules applied 327 place count 439 transition count 431
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 401 place count 416 transition count 380
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 403 place count 414 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 405 place count 414 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 406 place count 413 transition count 377
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 413 transition count 377
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 440 place count 413 transition count 344
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 473 place count 380 transition count 344
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 489 place count 364 transition count 328
Applied a total of 489 rules in 284 ms. Remains 364 /670 variables (removed 306) and now considering 328/605 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 364/670 places, 328/605 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 415133 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{1=1}
Probabilistic random walk after 415133 steps, saw 100302 distinct states, run finished after 3003 ms. (steps per millisecond=138 ) properties seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 328 rows 364 cols
[2023-03-12 14:35:11] [INFO ] Computed 36 place invariants in 9 ms
[2023-03-12 14:35:11] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:35:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 14:35:11] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 59 ms returned sat
[2023-03-12 14:35:12] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:35:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 14:35:13] [INFO ] After 731ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:35:13] [INFO ] After 1112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-12 14:35:14] [INFO ] After 2352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 87 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 328/328 transitions.
Graph (complete) has 647 edges and 364 vertex of which 360 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 360 transition count 311
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 613 edges and 347 vertex of which 344 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 344 transition count 309
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 39 place count 342 transition count 306
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 44 place count 342 transition count 301
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 49 place count 337 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 336 transition count 300
Applied a total of 50 rules in 64 ms. Remains 336 /364 variables (removed 28) and now considering 300/328 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 336/364 places, 300/328 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 465794 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465794 steps, saw 101895 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 336 cols
[2023-03-12 14:35:17] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-12 14:35:17] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:35:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:35:17] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 94 ms returned sat
[2023-03-12 14:35:18] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:35:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-12 14:35:18] [INFO ] After 606ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:35:19] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-12 14:35:19] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 87 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 300/300 transitions.
Applied a total of 0 rules in 20 ms. Remains 336 /336 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 336/336 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 300/300 transitions.
Applied a total of 0 rules in 20 ms. Remains 336 /336 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2023-03-12 14:35:19] [INFO ] Invariant cache hit.
[2023-03-12 14:35:19] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-12 14:35:19] [INFO ] Invariant cache hit.
[2023-03-12 14:35:20] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-12 14:35:21] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2023-03-12 14:35:21] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 14:35:21] [INFO ] Invariant cache hit.
[2023-03-12 14:35:21] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2449 ms. Remains : 336/336 places, 300/300 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 336 transition count 230
Reduce places removed 70 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 77 rules applied. Total rules applied 147 place count 266 transition count 223
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 259 transition count 223
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 154 place count 259 transition count 189
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 222 place count 225 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 224 transition count 188
Applied a total of 224 rules in 32 ms. Remains 224 /336 variables (removed 112) and now considering 188/300 (removed 112) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 188 rows 224 cols
[2023-03-12 14:35:21] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-12 14:35:21] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:35:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:35:22] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 71 ms returned sat
[2023-03-12 14:35:22] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:35:22] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-12 14:35:22] [INFO ] After 958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:35:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 14:35:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 336 places, 300 transitions and 1057 arcs took 5 ms.
[2023-03-12 14:35:23] [INFO ] Flatten gal took : 116 ms
Total runtime 25800 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HirschbergSinclair (PT), instance 30
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: 336 places, 300 transitions, 1057 arcs.
Final Score: 5525.533
Took : 12 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: HirschbergSinclair-PT-30-ReachabilityCardinality-00 (reachable & potential(( ( ( (! ( (tk(P50)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P186)) ) ) & ( ( ( (! ( (tk(P80)) <= ( 0 ) )) | ( (tk(P170)) <= ( 0 ) ) ) | ( (! ( (tk(P330)) <= (tk(P81)) )) | ( ( ( (tk(P124)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P191)) ) ) | ( (! ( (tk(P138)) <= (tk(P109)) )) & (! ( (tk(P58)) <= (tk(P2)) )) ) ) ) ) & ( ( (tk(P73)) <= (tk(P211)) ) | ( ( ( (tk(P77)) <= ( 0 ) ) | ( ( ( (tk(P323)) <= ( 1 ) ) & ( (tk(P102)) <= ( 0 ) ) ) | ( ( (! ( (tk(P50)) <= (tk(P140)) )) & ( ( 1 ) <= (tk(P224)) ) ) & ( (! ( ( 1 ) <= (tk(P65)) )) & ( ( ( 1 ) <= (tk(P297)) ) & ( (tk(P162)) <= (tk(P57)) ) ) ) ) ) ) & ( ( (! ( (tk(P163)) <= ( 0 ) )) | ( (tk(P239)) <= (tk(P49)) ) ) | ( ( (tk(P60)) <= (tk(P263)) ) | ( (! ( ( 1 ) <= (tk(P152)) )) & (! ( ( 1 ) <= (tk(P327)) )) ) ) ) ) ) ) ) | ( ( ( ( (tk(P78)) <= ( 1 ) ) & (! ( (tk(P232)) <= (tk(P19)) )) ) & ( (! ( (tk(P255)) <= (tk(P159)) )) & ( ( ( ( ( 1 ) <= (tk(P278)) ) & ( (tk(P257)) <= ( 0 ) ) ) & ( ( (! ( (tk(P273)) <= (tk(P317)) )) | (! ( (tk(P47)) <= (tk(P160)) )) ) & ( ( (! ( (tk(P46)) <= ( 1 ) )) | (! ( (tk(P271)) <= (tk(P36)) )) ) | ( (! ( ( 1 ) <= (tk(P135)) )) | (! ( ( 1 ) <= (tk(P25)) )) ) ) ) ) | ( ( ( ( (! ( (tk(P102)) <= ( 0 ) )) & (! ( (tk(P332)) <= (tk(P226)) )) ) | ( (! ( (tk(P53)) <= (tk(P249)) )) & (! ( ( 1 ) <= (tk(P126)) )) ) ) & ( (! ( (tk(P95)) <= (tk(P177)) )) | ( (! ( (tk(P130)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P214)) )) ) ) ) & ( ( ( (tk(P160)) <= (tk(P153)) ) | ( (tk(P119)) <= (tk(P75)) ) ) & ( ( ( 1 ) <= (tk(P39)) ) | ( (tk(P31)) <= ( 0 ) ) ) ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P132)) ) & ( ( ( 1 ) <= (tk(P142)) ) & ( (tk(P31)) <= ( 0 ) ) ) ) & ( ( ( (tk(P64)) <= (tk(P156)) ) | ( ( (tk(P236)) <= ( 0 ) ) & ( ( (! ( (tk(P146)) <= ( 1 ) )) | ( ( (tk(P302)) <= (tk(P232)) ) & ( ( (tk(P238)) <= (tk(P70)) ) & ( ( ( 1 ) <= (tk(P193)) ) | (! ( ( 1 ) <= (tk(P281)) )) ) ) ) ) & ( ( (tk(P334)) <= ( 0 ) ) | ( ( (tk(P82)) <= ( 0 ) ) & ( ( (tk(P54)) <= (tk(P284)) ) & ( ( (tk(P71)) <= ( 1 ) ) | ( (tk(P299)) <= ( 1 ) ) ) ) ) ) ) ) ) & ( ( (! ( (tk(P296)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P55)) )) ) & ( (! ( (tk(P334)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P93)) )) ) ) ) ) ) )))
PROPERTY: HirschbergSinclair-PT-30-ReachabilityCardinality-14 (reachable & potential(( ( ( (tk(P129)) <= ( 1 ) ) & ( ( (tk(P336)) <= (tk(P207)) ) & (! ( (tk(P325)) <= (tk(P132)) )) ) ) & ( ( (tk(P261)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P294)) ) & (! ( (tk(P75)) <= (tk(P62)) )) ) ) )))
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678631911664

--------------------
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-30"
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-30, 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-167840349600470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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