Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r267-smll-167863542100622.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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863542100622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678943412826

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=Peterson-PT-4
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 05:10:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 05:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 05:10:16] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2023-03-16 05:10:16] [INFO ] Transformed 480 places.
[2023-03-16 05:10:16] [INFO ] Transformed 690 transitions.
[2023-03-16 05:10:16] [INFO ] Found NUPN structural information;
[2023-03-16 05:10:16] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-16 05:10:16] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 200 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=9 ) properties (out of 15) seen :2
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-16 05:10:19] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 05:10:19] [INFO ] Computed 19 place invariants in 24 ms
[2023-03-16 05:10:22] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-16 05:10:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-16 05:10:22] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-16 05:10:23] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :5
[2023-03-16 05:10:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 05:10:23] [INFO ] After 274ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :8 sat :5
[2023-03-16 05:10:23] [INFO ] Deduced a trap composed of 32 places in 426 ms of which 12 ms to minimize.
[2023-03-16 05:10:24] [INFO ] Deduced a trap composed of 35 places in 441 ms of which 3 ms to minimize.
[2023-03-16 05:10:24] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 4 ms to minimize.
[2023-03-16 05:10:25] [INFO ] Deduced a trap composed of 10 places in 384 ms of which 3 ms to minimize.
[2023-03-16 05:10:25] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 1 ms to minimize.
[2023-03-16 05:10:26] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 4 ms to minimize.
[2023-03-16 05:10:26] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-16 05:10:26] [INFO ] Deduced a trap composed of 17 places in 370 ms of which 1 ms to minimize.
[2023-03-16 05:10:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3468 ms
[2023-03-16 05:10:27] [INFO ] Deduced a trap composed of 58 places in 271 ms of which 1 ms to minimize.
[2023-03-16 05:10:27] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 1 ms to minimize.
[2023-03-16 05:10:27] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 1 ms to minimize.
[2023-03-16 05:10:27] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 0 ms to minimize.
[2023-03-16 05:10:28] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 1 ms to minimize.
[2023-03-16 05:10:28] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 1 ms to minimize.
[2023-03-16 05:10:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1410 ms
[2023-03-16 05:10:28] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 1 ms to minimize.
[2023-03-16 05:10:29] [INFO ] Deduced a trap composed of 32 places in 325 ms of which 1 ms to minimize.
[2023-03-16 05:10:29] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 1 ms to minimize.
[2023-03-16 05:10:29] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 0 ms to minimize.
[2023-03-16 05:10:29] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 0 ms to minimize.
[2023-03-16 05:10:29] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2023-03-16 05:10:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1428 ms
[2023-03-16 05:10:30] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 1 ms to minimize.
[2023-03-16 05:10:30] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 1 ms to minimize.
[2023-03-16 05:10:30] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 1 ms to minimize.
[2023-03-16 05:10:30] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 1 ms to minimize.
[2023-03-16 05:10:30] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 1 ms to minimize.
[2023-03-16 05:10:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 975 ms
[2023-03-16 05:10:31] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 1 ms to minimize.
[2023-03-16 05:10:31] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 1 ms to minimize.
[2023-03-16 05:10:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
[2023-03-16 05:10:31] [INFO ] After 8685ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :5
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-16 05:10:32] [INFO ] After 10079ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :5
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 54 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 480 transition count 555
Reduce places removed 135 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 157 rules applied. Total rules applied 292 place count 345 transition count 533
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 314 place count 323 transition count 533
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 314 place count 323 transition count 455
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 470 place count 245 transition count 455
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 502 place count 229 transition count 439
Applied a total of 502 rules in 186 ms. Remains 229 /480 variables (removed 251) and now considering 439/690 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 229/480 places, 439/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 5) seen :1
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 05:10:32] [INFO ] Flow matrix only has 379 transitions (discarded 60 similar events)
// Phase 1: matrix 379 rows 229 cols
[2023-03-16 05:10:32] [INFO ] Computed 19 place invariants in 15 ms
[2023-03-16 05:10:33] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 05:10:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-16 05:10:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-16 05:10:33] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 05:10:33] [INFO ] After 197ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:33] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2023-03-16 05:10:33] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-16 05:10:34] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-16 05:10:34] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-16 05:10:34] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2023-03-16 05:10:34] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2023-03-16 05:10:34] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 4 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2023-03-16 05:10:35] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-16 05:10:36] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2367 ms
[2023-03-16 05:10:36] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-16 05:10:36] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 0 ms to minimize.
[2023-03-16 05:10:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-03-16 05:10:36] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2023-03-16 05:10:36] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2023-03-16 05:10:36] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2023-03-16 05:10:36] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2023-03-16 05:10:37] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2023-03-16 05:10:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 650 ms
[2023-03-16 05:10:37] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2023-03-16 05:10:37] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-16 05:10:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-03-16 05:10:37] [INFO ] After 4164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-16 05:10:37] [INFO ] After 4781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 34 ms.
Support contains 52 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 439/439 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 228 transition count 438
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 228 transition count 436
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 226 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 225 transition count 435
Applied a total of 8 rules in 82 ms. Remains 225 /229 variables (removed 4) and now considering 435/439 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 225/229 places, 435/439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 520752 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520752 steps, saw 87767 distinct states, run finished after 3004 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 05:10:41] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 225 cols
[2023-03-16 05:10:41] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-16 05:10:41] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 05:10:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-16 05:10:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-16 05:10:41] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 05:10:42] [INFO ] After 185ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:42] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 1 ms to minimize.
[2023-03-16 05:10:42] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 1 ms to minimize.
[2023-03-16 05:10:42] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-16 05:10:42] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-16 05:10:43] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2023-03-16 05:10:43] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2023-03-16 05:10:43] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 0 ms to minimize.
[2023-03-16 05:10:43] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-16 05:10:43] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 0 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2023-03-16 05:10:44] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2023-03-16 05:10:45] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2023-03-16 05:10:45] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2023-03-16 05:10:45] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 2 ms to minimize.
[2023-03-16 05:10:45] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-16 05:10:45] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2023-03-16 05:10:45] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4190 ms
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-16 05:10:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 693 ms
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2023-03-16 05:10:47] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2023-03-16 05:10:48] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-16 05:10:48] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2023-03-16 05:10:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1165 ms
[2023-03-16 05:10:48] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2023-03-16 05:10:48] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2023-03-16 05:10:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2023-03-16 05:10:48] [INFO ] After 6889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-16 05:10:48] [INFO ] After 7435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 52 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 225/225 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-16 05:10:48] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-16 05:10:48] [INFO ] Invariant cache hit.
[2023-03-16 05:10:49] [INFO ] Implicit Places using invariants in 325 ms returned [215, 216, 217, 218, 219]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 329 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/225 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 358 ms. Remains : 220/225 places, 435/435 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 530790 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 530790 steps, saw 88941 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 05:10:52] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 220 cols
[2023-03-16 05:10:52] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-16 05:10:52] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 05:10:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-16 05:10:53] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 05:10:53] [INFO ] After 169ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:53] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2023-03-16 05:10:53] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2023-03-16 05:10:54] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2023-03-16 05:10:54] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-16 05:10:54] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-16 05:10:54] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 0 ms to minimize.
[2023-03-16 05:10:54] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-16 05:10:54] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-16 05:10:55] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2023-03-16 05:10:55] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2023-03-16 05:10:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1734 ms
[2023-03-16 05:10:55] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2023-03-16 05:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-16 05:10:55] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-16 05:10:55] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-16 05:10:55] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2023-03-16 05:10:56] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-16 05:10:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 509 ms
[2023-03-16 05:10:56] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-16 05:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-16 05:10:56] [INFO ] After 2915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-16 05:10:56] [INFO ] After 3515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 36 ms.
Support contains 52 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 20 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 220/220 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 17 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-16 05:10:56] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-16 05:10:56] [INFO ] Invariant cache hit.
[2023-03-16 05:10:56] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-16 05:10:56] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-16 05:10:56] [INFO ] Invariant cache hit.
[2023-03-16 05:10:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 05:10:57] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2023-03-16 05:10:57] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-16 05:10:57] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-16 05:10:57] [INFO ] Invariant cache hit.
[2023-03-16 05:10:58] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1729 ms. Remains : 220/220 places, 435/435 transitions.
Graph (trivial) has 230 edges and 220 vertex of which 31 / 220 are part of one of the 13 SCC in 7 ms
Free SCC test removed 18 places
Drop transitions removed 36 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 97 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 202 transition count 337
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 201 transition count 337
Performed 41 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 85 place count 160 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 94 place count 160 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 127 place count 142 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 50 edges and 142 vertex of which 6 / 142 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 138 place count 137 transition count 317
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 145 place count 137 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 135 transition count 308
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 179 place count 135 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 135 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 134 transition count 277
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 190 place count 134 transition count 268
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 199 place count 125 transition count 268
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 211 place count 125 transition count 268
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 218 place count 125 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 125 transition count 261
Applied a total of 219 rules in 114 ms. Remains 125 /220 variables (removed 95) and now considering 261/435 (removed 174) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 261 rows 125 cols
[2023-03-16 05:10:58] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-16 05:10:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 05:10:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-16 05:10:58] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:58] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-16 05:10:59] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-16 05:10:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-16 05:10:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 435 transitions and 1600 arcs took 5 ms.
[2023-03-16 05:10:59] [INFO ] Flatten gal took : 134 ms
Total runtime 43550 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Peterson (PT), instance 4
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: 220 places, 435 transitions, 1600 arcs.
Final Score: 8217.388
Took : 18 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Peterson-PT-4-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) )))
PROPERTY: Peterson-PT-4-ReachabilityCardinality-11 (reachable &!potential( ( ( ( ( (tk(P191)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P191)) ) ) | ( ( (tk(P204)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P204)) ) ) ) & ( ( ( (tk(P116)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P116)) ) ) | ( ( ( (tk(P189)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P189)) ) ) | ( ( ( (tk(P38)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P38)) ) ) & ( ( ( ( (tk(P190)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P190)) ) ) | ( ( (tk(P179)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P179)) ) ) ) & ( ( ( (tk(P114)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P114)) ) ) | ( ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) & ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) ) | ( ( ( (tk(P210)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P210)) ) ) & ( ( ( (tk(P192)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P192)) ) ) & ( ( (tk(P186)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P186)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: Peterson-PT-4-ReachabilityCardinality-13 (reachable &!potential( ( ( ( ( (tk(P140)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P140)) ) ) | ( ( (tk(P213)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P213)) ) ) ) | ( ( ( ( (tk(P12)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P12)) ) ) & ( ( (tk(P110)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P110)) ) ) ) | ( ( ( ( (tk(P99)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P99)) ) ) & ( ( (tk(P151)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P151)) ) ) ) & ( ( ( (tk(P169)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P169)) ) ) & ( ( (tk(P118)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P118)) ) ) ) ) ) )))
PROPERTY: Peterson-PT-4-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( (tk(P188)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P188)) ) ) | ( ( ( ( (tk(P209)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P209)) ) ) | ( ( (tk(P92)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P92)) ) ) ) & ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( ( ( (tk(P171)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P171)) ) ) & ( ( (tk(P13)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P13)) ) ) ) & ( ( ( ( (tk(P113)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P113)) ) ) | ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) ) & ( ( ( ( (tk(P109)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P109)) ) ) | ( ( (tk(P66)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P66)) ) ) ) & ( ( ( (tk(P122)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P122)) ) ) | ( ( ( ( (tk(P133)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P133)) ) ) | ( ( (tk(P107)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P107)) ) ) ) & ( ( ( (tk(P100)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P100)) ) ) | ( ( (tk(P147)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P147)) ) ) ) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P12)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P12)) ) ) & ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) ) | ( ( ( ( ( (tk(P112)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P112)) ) ) | ( ( (tk(P1)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1)) ) ) ) | ( ( ( (tk(P137)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P137)) ) ) | ( ( ( (tk(P148)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P148)) ) ) | ( ( ( ( (tk(P108)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P108)) ) ) | ( ( (tk(P10)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P10)) ) ) ) & ( ( ( (tk(P120)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P120)) ) ) | ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P183)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P183)) ) ) & ( ( (tk(P21)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P21)) ) ) ) | ( ( ( ( (tk(P141)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P141)) ) ) & ( ( (tk(P10)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P10)) ) ) ) | ( ( ( ( (tk(P137)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P137)) ) ) & ( ( (tk(P142)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P142)) ) ) ) & ( ( ( (tk(P156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P156)) ) ) & ( ( ( (tk(P193)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P193)) ) ) & ( ( (tk(P115)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P115)) ) ) ) ) ) ) ) ) ) )))
FORMULA Peterson-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Peterson-PT-4-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678945843415

--------------------
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="Peterson-PT-4"
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 Peterson-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863542100622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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