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.r263-smll-167863537900255.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 lolaxred
Input is NoC3x3-PT-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537900255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 10:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 548K 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 NoC3x3-PT-2B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678754305116

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 00:38:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 00:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:38:29] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2023-03-14 00:38:29] [INFO ] Transformed 2003 places.
[2023-03-14 00:38:29] [INFO ] Transformed 2292 transitions.
[2023-03-14 00:38:29] [INFO ] Found NUPN structural information;
[2023-03-14 00:38:29] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 588 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 16) seen :8
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2023-03-14 00:38:30] [INFO ] Computed 66 place invariants in 39 ms
[2023-03-14 00:38:31] [INFO ] After 1255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 00:38:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 123 ms returned sat
[2023-03-14 00:38:36] [INFO ] After 3044ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-14 00:38:36] [INFO ] Deduced a trap composed of 111 places in 488 ms of which 12 ms to minimize.
[2023-03-14 00:38:37] [INFO ] Deduced a trap composed of 118 places in 670 ms of which 2 ms to minimize.
[2023-03-14 00:38:38] [INFO ] Deduced a trap composed of 142 places in 452 ms of which 2 ms to minimize.
[2023-03-14 00:38:38] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 3 ms to minimize.
[2023-03-14 00:38:39] [INFO ] Deduced a trap composed of 60 places in 316 ms of which 1 ms to minimize.
[2023-03-14 00:38:39] [INFO ] Deduced a trap composed of 111 places in 211 ms of which 0 ms to minimize.
[2023-03-14 00:38:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3303 ms
[2023-03-14 00:38:40] [INFO ] Deduced a trap composed of 107 places in 488 ms of which 1 ms to minimize.
[2023-03-14 00:38:40] [INFO ] Deduced a trap composed of 77 places in 408 ms of which 2 ms to minimize.
[2023-03-14 00:38:41] [INFO ] Deduced a trap composed of 82 places in 247 ms of which 2 ms to minimize.
[2023-03-14 00:38:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1754 ms
[2023-03-14 00:38:42] [INFO ] Deduced a trap composed of 87 places in 318 ms of which 1 ms to minimize.
[2023-03-14 00:38:43] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 1 ms to minimize.
[2023-03-14 00:38:43] [INFO ] Deduced a trap composed of 94 places in 320 ms of which 1 ms to minimize.
[2023-03-14 00:38:43] [INFO ] Deduced a trap composed of 99 places in 335 ms of which 1 ms to minimize.
[2023-03-14 00:38:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2054 ms
[2023-03-14 00:38:45] [INFO ] Deduced a trap composed of 87 places in 429 ms of which 1 ms to minimize.
[2023-03-14 00:38:45] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 1 ms to minimize.
[2023-03-14 00:38:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1196 ms
[2023-03-14 00:38:46] [INFO ] Deduced a trap composed of 28 places in 664 ms of which 2 ms to minimize.
[2023-03-14 00:38:47] [INFO ] Deduced a trap composed of 80 places in 645 ms of which 2 ms to minimize.
[2023-03-14 00:38:48] [INFO ] Deduced a trap composed of 101 places in 320 ms of which 1 ms to minimize.
[2023-03-14 00:38:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2245 ms
[2023-03-14 00:38:48] [INFO ] After 15101ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 1792 ms.
[2023-03-14 00:38:50] [INFO ] After 18187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 166 ms.
Support contains 80 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1474 edges and 2003 vertex of which 56 / 2003 are part of one of the 7 SCC in 22 ms
Free SCC test removed 49 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 366 rules applied. Total rules applied 367 place count 1945 transition count 1879
Reduce places removed 357 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 383 rules applied. Total rules applied 750 place count 1588 transition count 1853
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 776 place count 1562 transition count 1853
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 776 place count 1562 transition count 1827
Deduced a syphon composed of 26 places in 8 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 828 place count 1536 transition count 1827
Discarding 349 places :
Symmetric choice reduction at 3 with 349 rule applications. Total rules 1177 place count 1187 transition count 1478
Iterating global reduction 3 with 349 rules applied. Total rules applied 1526 place count 1187 transition count 1478
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 1526 place count 1187 transition count 1444
Deduced a syphon composed of 34 places in 12 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1594 place count 1153 transition count 1444
Discarding 119 places :
Symmetric choice reduction at 3 with 119 rule applications. Total rules 1713 place count 1034 transition count 1299
Iterating global reduction 3 with 119 rules applied. Total rules applied 1832 place count 1034 transition count 1299
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 1938 place count 928 transition count 1184
Iterating global reduction 3 with 106 rules applied. Total rules applied 2044 place count 928 transition count 1184
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 2079 place count 893 transition count 1121
Iterating global reduction 3 with 35 rules applied. Total rules applied 2114 place count 893 transition count 1121
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 12 rules applied. Total rules applied 2126 place count 891 transition count 1111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2128 place count 889 transition count 1111
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 2154 place count 863 transition count 1085
Iterating global reduction 5 with 26 rules applied. Total rules applied 2180 place count 863 transition count 1085
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2182 place count 862 transition count 1084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2183 place count 861 transition count 1084
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2197 place count 847 transition count 1056
Iterating global reduction 7 with 14 rules applied. Total rules applied 2211 place count 847 transition count 1056
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2224 place count 834 transition count 1043
Iterating global reduction 7 with 13 rules applied. Total rules applied 2237 place count 834 transition count 1043
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 17 rules applied. Total rules applied 2254 place count 832 transition count 1028
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2256 place count 830 transition count 1028
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 0 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 9 with 548 rules applied. Total rules applied 2804 place count 556 transition count 754
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 2814 place count 546 transition count 744
Iterating global reduction 9 with 10 rules applied. Total rules applied 2824 place count 546 transition count 744
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2831 place count 539 transition count 730
Iterating global reduction 9 with 7 rules applied. Total rules applied 2838 place count 539 transition count 730
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2839 place count 538 transition count 727
Iterating global reduction 9 with 1 rules applied. Total rules applied 2840 place count 538 transition count 727
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 2884 place count 516 transition count 800
Free-agglomeration rule applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 2901 place count 516 transition count 783
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2921 place count 499 transition count 780
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2923 place count 499 transition count 778
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2926 place count 499 transition count 775
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2929 place count 496 transition count 775
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 2937 place count 496 transition count 775
Partial Post-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 2947 place count 496 transition count 775
Applied a total of 2947 rules in 1253 ms. Remains 496 /2003 variables (removed 1507) and now considering 775/2292 (removed 1517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1254 ms. Remains : 496/2003 places, 775/2292 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 775 rows 496 cols
[2023-03-14 00:38:51] [INFO ] Computed 54 place invariants in 9 ms
[2023-03-14 00:38:51] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 00:38:52] [INFO ] [Nat]Absence check using 54 positive place invariants in 18 ms returned sat
[2023-03-14 00:38:52] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 00:38:52] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-14 00:38:52] [INFO ] After 103ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 00:38:52] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2023-03-14 00:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-14 00:38:52] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-14 00:38:52] [INFO ] After 946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 24 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 775/775 transitions.
Graph (trivial) has 89 edges and 496 vertex of which 4 / 496 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 494 transition count 760
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 483 transition count 760
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 23 place count 483 transition count 745
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 53 place count 468 transition count 745
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 66 place count 455 transition count 693
Iterating global reduction 2 with 13 rules applied. Total rules applied 79 place count 455 transition count 693
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 455 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 452 transition count 686
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 452 transition count 686
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 452 transition count 684
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 140 place count 426 transition count 658
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 153 place count 413 transition count 633
Iterating global reduction 4 with 13 rules applied. Total rules applied 166 place count 413 transition count 633
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 171 place count 413 transition count 628
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 175 place count 409 transition count 620
Iterating global reduction 5 with 4 rules applied. Total rules applied 179 place count 409 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 181 place count 409 transition count 618
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 183 place count 407 transition count 614
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 407 transition count 614
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 187 place count 407 transition count 612
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 195 place count 403 transition count 631
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 196 place count 403 transition count 630
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 201 place count 403 transition count 625
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 212 place count 398 transition count 619
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 213 place count 397 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 397 transition count 609
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 397 transition count 609
Applied a total of 215 rules in 675 ms. Remains 397 /496 variables (removed 99) and now considering 609/775 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 397/496 places, 609/775 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403199 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403199 steps, saw 83224 distinct states, run finished after 3004 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 609 rows 397 cols
[2023-03-14 00:38:56] [INFO ] Computed 54 place invariants in 10 ms
[2023-03-14 00:38:56] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 00:38:56] [INFO ] [Nat]Absence check using 54 positive place invariants in 20 ms returned sat
[2023-03-14 00:38:57] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 00:38:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 00:38:57] [INFO ] After 112ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 00:38:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-14 00:38:57] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2023-03-14 00:38:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-03-14 00:38:57] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-14 00:38:57] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 609/609 transitions.
Applied a total of 0 rules in 12 ms. Remains 397 /397 variables (removed 0) and now considering 609/609 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 397/397 places, 609/609 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 609/609 transitions.
Applied a total of 0 rules in 12 ms. Remains 397 /397 variables (removed 0) and now considering 609/609 (removed 0) transitions.
[2023-03-14 00:38:57] [INFO ] Invariant cache hit.
[2023-03-14 00:38:58] [INFO ] Implicit Places using invariants in 541 ms returned [14, 85, 115, 171, 255, 298, 327]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 544 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 390/397 places, 609/609 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 371 transition count 590
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 53 place count 371 transition count 575
Applied a total of 53 rules in 25 ms. Remains 371 /390 variables (removed 19) and now considering 575/609 (removed 34) transitions.
// Phase 1: matrix 575 rows 371 cols
[2023-03-14 00:38:58] [INFO ] Computed 47 place invariants in 5 ms
[2023-03-14 00:38:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-14 00:38:58] [INFO ] Invariant cache hit.
[2023-03-14 00:38:58] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 00:38:59] [INFO ] Implicit Places using invariants and state equation in 963 ms returned [9, 13, 31, 35, 36, 40, 41, 77, 80, 81, 98, 99, 104, 105, 108, 139, 140, 141, 142, 145, 146, 152, 153, 154, 158, 159, 160, 227, 228, 231, 232, 233, 234, 237, 238, 239, 274, 278, 293, 294, 295, 298, 299, 303, 304, 340, 344, 345]
Discarding 48 places :
Implicit Place search using SMT with State Equation took 1238 ms to find 48 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 323/397 places, 575/609 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 323 transition count 571
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 319 transition count 571
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 284 transition count 536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 282 transition count 532
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 282 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 282 transition count 531
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 281 transition count 529
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 281 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 281 transition count 528
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 110 place count 269 transition count 546
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 4 with 39 rules applied. Total rules applied 149 place count 269 transition count 524
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 189 place count 230 transition count 523
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 230 transition count 521
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 195 place count 230 transition count 521
Applied a total of 195 rules in 147 ms. Remains 230 /323 variables (removed 93) and now considering 521/575 (removed 54) transitions.
[2023-03-14 00:38:59] [INFO ] Flow matrix only has 514 transitions (discarded 7 similar events)
// Phase 1: matrix 514 rows 230 cols
[2023-03-14 00:38:59] [INFO ] Computed 35 place invariants in 15 ms
[2023-03-14 00:38:59] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-14 00:38:59] [INFO ] Flow matrix only has 514 transitions (discarded 7 similar events)
[2023-03-14 00:38:59] [INFO ] Invariant cache hit.
[2023-03-14 00:39:00] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-14 00:39:00] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 230/397 places, 521/609 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3059 ms. Remains : 230/397 places, 521/609 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440635 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440635 steps, saw 91388 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 00:39:03] [INFO ] Flow matrix only has 514 transitions (discarded 7 similar events)
[2023-03-14 00:39:03] [INFO ] Invariant cache hit.
[2023-03-14 00:39:03] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 00:39:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2023-03-14 00:39:04] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 00:39:04] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-14 00:39:04] [INFO ] After 169ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 00:39:04] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2023-03-14 00:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-14 00:39:04] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-14 00:39:04] [INFO ] After 730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 24 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 521/521 transitions.
Applied a total of 0 rules in 18 ms. Remains 230 /230 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 230/230 places, 521/521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 521/521 transitions.
Applied a total of 0 rules in 13 ms. Remains 230 /230 variables (removed 0) and now considering 521/521 (removed 0) transitions.
[2023-03-14 00:39:04] [INFO ] Flow matrix only has 514 transitions (discarded 7 similar events)
[2023-03-14 00:39:04] [INFO ] Invariant cache hit.
[2023-03-14 00:39:04] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 00:39:04] [INFO ] Flow matrix only has 514 transitions (discarded 7 similar events)
[2023-03-14 00:39:04] [INFO ] Invariant cache hit.
[2023-03-14 00:39:05] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-14 00:39:05] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2023-03-14 00:39:05] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-14 00:39:05] [INFO ] Flow matrix only has 514 transitions (discarded 7 similar events)
[2023-03-14 00:39:05] [INFO ] Invariant cache hit.
[2023-03-14 00:39:06] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1796 ms. Remains : 230/230 places, 521/521 transitions.
Graph (trivial) has 68 edges and 230 vertex of which 38 / 230 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 701 edges and 211 vertex of which 172 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.2 ms
Discarding 39 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 172 transition count 346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 169 transition count 343
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 169 transition count 340
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 169 transition count 325
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 169 transition count 325
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 169 transition count 323
Applied a total of 150 rules in 52 ms. Remains 169 /230 variables (removed 61) and now considering 323/521 (removed 198) transitions.
Running SMT prover for 1 properties.
[2023-03-14 00:39:06] [INFO ] Flow matrix only has 322 transitions (discarded 1 similar events)
// Phase 1: matrix 322 rows 169 cols
[2023-03-14 00:39:06] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-14 00:39:06] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 00:39:06] [INFO ] [Nat]Absence check using 24 positive place invariants in 8 ms returned sat
[2023-03-14 00:39:06] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 00:39:06] [INFO ] State equation strengthened by 95 read => feed constraints.
[2023-03-14 00:39:06] [INFO ] After 83ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 00:39:06] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-14 00:39:06] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 00:39:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-14 00:39:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 230 places, 521 transitions and 2302 arcs took 6 ms.
[2023-03-14 00:39:07] [INFO ] Flatten gal took : 160 ms
Total runtime 38913 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-2B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678754348690

--------------------
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 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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
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 # 8 (type EXCL) for 0 NoC3x3-PT-2B-ReachabilityFireability-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 NoC3x3-PT-2B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 NoC3x3-PT-2B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type SRCH) for 0 NoC3x3-PT-2B-ReachabilityFireability-09
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 4 (type FNDP) for NoC3x3-PT-2B-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 79
lola: tried executions : 5
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for NoC3x3-PT-2B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 7 (type SRCH) for NoC3x3-PT-2B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 8 (type EXCL) for NoC3x3-PT-2B-ReachabilityFireability-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-2B-ReachabilityFireability-09: AG false findpath


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-2B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is NoC3x3-PT-2B, 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-smll-167863537900255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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