Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372800425.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-8B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372800425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 07:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:43 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 NoC3x3-PT-8B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716695865946

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-26 03:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 03:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:57:47] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2024-05-26 03:57:47] [INFO ] Transformed 9140 places.
[2024-05-26 03:57:47] [INFO ] Transformed 14577 transitions.
[2024-05-26 03:57:47] [INFO ] Found NUPN structural information;
[2024-05-26 03:57:48] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 16) seen :2
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 14577 rows 9140 cols
[2024-05-26 03:57:49] [INFO ] Computed 99 invariants in 156 ms
[2024-05-26 03:57:53] [INFO ] After 3451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-26 03:57:56] [INFO ] [Nat]Absence check using 99 positive place invariants in 134 ms returned sat
[2024-05-26 03:58:18] [INFO ] After 20465ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2024-05-26 03:58:18] [INFO ] After 20492ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-26 03:58:18] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 13 different solutions.
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 1277 ms.
Support contains 156 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 12506 edges and 9140 vertex of which 1833 / 9140 are part of one of the 29 SCC in 29 ms
Free SCC test removed 1804 places
Drop transitions removed 2853 transitions
Reduce isomorphic transitions removed 2853 transitions.
Graph (complete) has 13201 edges and 7336 vertex of which 7224 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.19 ms
Discarding 112 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 4254 transitions
Trivial Post-agglo rules discarded 4254 transitions
Performed 4254 trivial Post agglomeration. Transition count delta: 4254
Iterating post reduction 0 with 4356 rules applied. Total rules applied 4358 place count 7224 transition count 7289
Reduce places removed 4254 places and 0 transitions.
Ensure Unique test removed 2349 transitions
Reduce isomorphic transitions removed 2349 transitions.
Drop transitions removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 1 with 7129 rules applied. Total rules applied 11487 place count 2970 transition count 4414
Reduce places removed 526 places and 0 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Performed 980 Post agglomeration using F-continuation condition.Transition count delta: 980
Iterating post reduction 2 with 2032 rules applied. Total rules applied 13519 place count 2444 transition count 2908
Reduce places removed 980 places and 0 transitions.
Ensure Unique test removed 891 transitions
Reduce isomorphic transitions removed 891 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1872 rules applied. Total rules applied 15391 place count 1464 transition count 2016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 15392 place count 1463 transition count 2016
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 58 Pre rules applied. Total rules applied 15392 place count 1463 transition count 1958
Deduced a syphon composed of 58 places in 21 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 15508 place count 1405 transition count 1958
Discarding 344 places :
Symmetric choice reduction at 5 with 344 rule applications. Total rules 15852 place count 1061 transition count 1614
Iterating global reduction 5 with 344 rules applied. Total rules applied 16196 place count 1061 transition count 1614
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 16241 place count 1061 transition count 1569
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 55 Pre rules applied. Total rules applied 16241 place count 1061 transition count 1514
Deduced a syphon composed of 55 places in 5 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 16351 place count 1006 transition count 1514
Discarding 64 places :
Symmetric choice reduction at 6 with 64 rule applications. Total rules 16415 place count 942 transition count 1381
Iterating global reduction 6 with 64 rules applied. Total rules applied 16479 place count 942 transition count 1381
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 16492 place count 942 transition count 1368
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 7 with 480 rules applied. Total rules applied 16972 place count 702 transition count 1128
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 16989 place count 702 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 16992 place count 699 transition count 1106
Iterating global reduction 8 with 3 rules applied. Total rules applied 16995 place count 699 transition count 1106
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 17009 place count 692 transition count 1143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 17013 place count 692 transition count 1139
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 9 with 99 rules applied. Total rules applied 17112 place count 692 transition count 1040
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 17114 place count 691 transition count 1057
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 17115 place count 691 transition count 1056
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 17118 place count 691 transition count 1053
Free-agglomeration rule applied 219 times.
Iterating global reduction 10 with 219 rules applied. Total rules applied 17337 place count 691 transition count 834
Reduce places removed 219 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1245 edges and 472 vertex of which 468 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 232 rules applied. Total rules applied 17569 place count 468 transition count 822
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 17573 place count 468 transition count 818
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 12 with 145 rules applied. Total rules applied 17718 place count 468 transition count 673
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 1094 edges and 460 vertex of which 444 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 9 rules applied. Total rules applied 17727 place count 444 transition count 673
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 17743 place count 444 transition count 657
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 17744 place count 444 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 17745 place count 443 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 17746 place count 443 transition count 655
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 15 with 28 rules applied. Total rules applied 17774 place count 443 transition count 655
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 17775 place count 442 transition count 654
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 15 with 2 rules applied. Total rules applied 17777 place count 441 transition count 653
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 17779 place count 440 transition count 652
Applied a total of 17779 rules in 1280 ms. Remains 440 /9140 variables (removed 8700) and now considering 652/14577 (removed 13925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1281 ms. Remains : 440/9140 places, 652/14577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :7
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2024-05-26 03:58:21] [INFO ] Flow matrix only has 650 transitions (discarded 2 similar events)
// Phase 1: matrix 650 rows 440 cols
[2024-05-26 03:58:21] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 03:58:21] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:58:21] [INFO ] [Nat]Absence check using 57 positive place invariants in 100 ms returned sat
[2024-05-26 03:58:22] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:22] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-26 03:58:22] [INFO ] After 89ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:22] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 6 ms to minimize.
[2024-05-26 03:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-26 03:58:22] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-26 03:58:22] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-26 03:58:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2024-05-26 03:58:22] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-26 03:58:22] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 61 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 652/652 transitions.
Graph (trivial) has 189 edges and 440 vertex of which 29 / 440 are part of one of the 8 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (complete) has 1030 edges and 419 vertex of which 418 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 418 transition count 569
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 971 edges and 376 vertex of which 375 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 71 rules applied. Total rules applied 115 place count 375 transition count 541
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 138 place count 360 transition count 533
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 138 place count 360 transition count 519
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 166 place count 346 transition count 519
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 168 place count 346 transition count 517
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 344 transition count 511
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 344 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 174 place count 344 transition count 509
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 200 place count 331 transition count 496
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 330 transition count 492
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 330 transition count 492
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 208 place count 327 transition count 495
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 226 place count 327 transition count 477
Graph (complete) has 884 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 326 transition count 477
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 228 place count 326 transition count 476
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 250 place count 326 transition count 454
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 824 edges and 304 vertex of which 303 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 28 rules applied. Total rules applied 278 place count 303 transition count 449
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 279 place count 303 transition count 448
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 296 place count 303 transition count 431
Graph (complete) has 807 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 297 place count 302 transition count 431
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 298 place count 302 transition count 430
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 304 place count 302 transition count 430
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 307 place count 302 transition count 427
Graph (complete) has 803 edges and 302 vertex of which 300 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 308 place count 300 transition count 427
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 310 place count 300 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 311 place count 299 transition count 424
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 13 with 3 rules applied. Total rules applied 314 place count 298 transition count 422
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 316 place count 296 transition count 422
Applied a total of 316 rules in 96 ms. Remains 296 /440 variables (removed 144) and now considering 422/652 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 296/440 places, 422/652 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 386540 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386540 steps, saw 346533 distinct states, run finished after 3004 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:58:25] [INFO ] Flow matrix only has 419 transitions (discarded 3 similar events)
// Phase 1: matrix 419 rows 296 cols
[2024-05-26 03:58:25] [INFO ] Computed 56 invariants in 5 ms
[2024-05-26 03:58:26] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:58:26] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2024-05-26 03:58:26] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:26] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-26 03:58:26] [INFO ] After 75ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:26] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-26 03:58:26] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 61 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 296/296 places, 422/422 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 422/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2024-05-26 03:58:26] [INFO ] Flow matrix only has 419 transitions (discarded 3 similar events)
[2024-05-26 03:58:26] [INFO ] Invariant cache hit.
[2024-05-26 03:58:26] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-26 03:58:26] [INFO ] Flow matrix only has 419 transitions (discarded 3 similar events)
[2024-05-26 03:58:26] [INFO ] Invariant cache hit.
[2024-05-26 03:58:26] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-26 03:58:27] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-26 03:58:27] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-26 03:58:27] [INFO ] Flow matrix only has 419 transitions (discarded 3 similar events)
[2024-05-26 03:58:27] [INFO ] Invariant cache hit.
[2024-05-26 03:58:27] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 296/296 places, 422/422 transitions.
Graph (trivial) has 158 edges and 296 vertex of which 35 / 296 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions removed 53 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 537 edges and 268 vertex of which 259 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 115 edges and 256 vertex of which 2 / 256 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 255 transition count 317
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 126 place count 212 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 211 transition count 285
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 127 place count 211 transition count 279
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 143 place count 201 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 201 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 200 transition count 278
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 158 place count 187 transition count 265
Iterating global reduction 5 with 13 rules applied. Total rules applied 171 place count 187 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 172 place count 187 transition count 264
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 172 place count 187 transition count 262
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 176 place count 185 transition count 262
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 6 with 4 rules applied. Total rules applied 180 place count 183 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 181 place count 183 transition count 259
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 7 with 2 rules applied. Total rules applied 183 place count 182 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 184 place count 182 transition count 257
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 198 place count 182 transition count 243
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 200 place count 182 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 202 place count 180 transition count 241
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 214 place count 180 transition count 241
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 216 place count 178 transition count 239
Iterating global reduction 9 with 2 rules applied. Total rules applied 218 place count 178 transition count 239
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 219 place count 178 transition count 238
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 220 place count 178 transition count 238
Applied a total of 220 rules in 77 ms. Remains 178 /296 variables (removed 118) and now considering 238/422 (removed 184) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 238 rows 178 cols
[2024-05-26 03:58:27] [INFO ] Computed 44 invariants in 3 ms
[2024-05-26 03:58:27] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:58:27] [INFO ] [Nat]Absence check using 44 positive place invariants in 5 ms returned sat
[2024-05-26 03:58:27] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:58:27] [INFO ] After 46ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:27] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-26 03:58:28] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-26 03:58:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-26 03:58:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 296 places, 422 transitions and 1409 arcs took 15 ms.
[2024-05-26 03:58:28] [INFO ] Flatten gal took : 75 ms
Total runtime 40876 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-8B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityFireability

FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716695909637

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 3 NoC3x3-PT-8B-ReachabilityFireability-2024-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 NoC3x3-PT-8B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 NoC3x3-PT-8B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 3 NoC3x3-PT-8B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 10 (type SRCH) for NoC3x3-PT-8B-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 165
lola: fired transitions : 197
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for NoC3x3-PT-8B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 8 (type EQUN) for NoC3x3-PT-8B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 11 (type EXCL) for NoC3x3-PT-8B-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 18 (type EXCL) for 0 NoC3x3-PT-8B-ReachabilityFireability-2024-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 0 NoC3x3-PT-8B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 NoC3x3-PT-8B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 0 NoC3x3-PT-8B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 7 (type FNDP) for NoC3x3-PT-8B-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 128
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 14 (type FNDP) for NoC3x3-PT-8B-ReachabilityFireability-2024-01
lola: result : true
lola: fired transitions : 31
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 15 (type EQUN) for NoC3x3-PT-8B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 17 (type SRCH) for NoC3x3-PT-8B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 18 (type EXCL) for NoC3x3-PT-8B-ReachabilityFireability-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-8B-ReachabilityFireability-2024-01: AG false findpath
NoC3x3-PT-8B-ReachabilityFireability-2024-12: AG false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-8B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372800425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;