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.r245-tall-171654350400679.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 greatspnxred
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 r245-tall-171654350400679
=====================================================================

--------------------
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 1716701513097

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 05:31:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 05:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:31:54] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2024-05-26 05:31:54] [INFO ] Transformed 9140 places.
[2024-05-26 05:31:54] [INFO ] Transformed 14577 transitions.
[2024-05-26 05:31:54] [INFO ] Found NUPN structural information;
[2024-05-26 05:31:54] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 638 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (17 resets) in 2300 ms. (17 steps per ms) remains 10/16 properties
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-07 FALSE 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
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 967 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/10 properties
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
// Phase 1: matrix 14577 rows 9140 cols
[2024-05-26 05:31:57] [INFO ] Computed 99 invariants in 190 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem NoC3x3-PT-8B-ReachabilityFireability-2024-00 is UNSAT
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 8975/9118 variables, 95/238 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9118 variables, 8975/9213 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9118 variables, 0/9213 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 22/9140 variables, 4/9217 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9140 variables, 22/9239 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9140 variables, 0/9239 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 5546ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 12238 edges and 9140 vertex of which 1183 / 9140 are part of one of the 30 SCC in 26 ms
Free SCC test removed 1153 places
Drop transitions (Empty/Sink Transition effects.) removed 1759 transitions
Reduce isomorphic transitions removed 1759 transitions.
Graph (complete) has 14295 edges and 7987 vertex of which 7874 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.19 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4610 transitions
Trivial Post-agglo rules discarded 4610 transitions
Performed 4610 trivial Post agglomeration. Transition count delta: 4610
Iterating post reduction 0 with 4714 rules applied. Total rules applied 4716 place count 7874 transition count 8024
Reduce places removed 4610 places and 0 transitions.
Ensure Unique test removed 2538 transitions
Reduce isomorphic transitions removed 2538 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 1 with 7624 rules applied. Total rules applied 12340 place count 3264 transition count 5010
Reduce places removed 476 places and 0 transitions.
Ensure Unique test removed 476 transitions
Reduce isomorphic transitions removed 476 transitions.
Performed 1138 Post agglomeration using F-continuation condition.Transition count delta: 1138
Iterating post reduction 2 with 2090 rules applied. Total rules applied 14430 place count 2788 transition count 3396
Reduce places removed 1138 places and 0 transitions.
Ensure Unique test removed 1066 transitions
Reduce isomorphic transitions removed 1066 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 2206 rules applied. Total rules applied 16636 place count 1650 transition count 2328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 16638 place count 1648 transition count 2328
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 65 Pre rules applied. Total rules applied 16638 place count 1648 transition count 2263
Deduced a syphon composed of 65 places in 17 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 16768 place count 1583 transition count 2263
Discarding 494 places :
Symmetric choice reduction at 5 with 494 rule applications. Total rules 17262 place count 1089 transition count 1769
Iterating global reduction 5 with 494 rules applied. Total rules applied 17756 place count 1089 transition count 1769
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 194 rules applied. Total rules applied 17950 place count 1089 transition count 1575
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 96 rules applied. Total rules applied 18046 place count 1041 transition count 1527
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 57 Pre rules applied. Total rules applied 18046 place count 1041 transition count 1470
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 18160 place count 984 transition count 1470
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 18220 place count 924 transition count 1340
Iterating global reduction 7 with 60 rules applied. Total rules applied 18280 place count 924 transition count 1340
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 18288 place count 924 transition count 1332
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 245
Deduced a syphon composed of 245 places in 1 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 8 with 490 rules applied. Total rules applied 18778 place count 679 transition count 1087
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 18799 place count 679 transition count 1066
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 18813 place count 672 transition count 1133
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 18822 place count 672 transition count 1124
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 10 with 78 rules applied. Total rules applied 18900 place count 672 transition count 1046
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 18902 place count 671 transition count 1063
Free-agglomeration rule applied 218 times.
Iterating global reduction 10 with 218 rules applied. Total rules applied 19120 place count 671 transition count 845
Reduce places removed 218 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1268 edges and 453 vertex of which 451 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 230 rules applied. Total rules applied 19350 place count 451 transition count 834
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 19352 place count 451 transition count 832
Drop transitions (Redundant composition of simpler transitions.) removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 12 with 160 rules applied. Total rules applied 19512 place count 451 transition count 672
Reduce places removed 7 places and 0 transitions.
Graph (complete) has 1101 edges and 444 vertex of which 423 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 8 rules applied. Total rules applied 19520 place count 423 transition count 672
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 13 with 21 rules applied. Total rules applied 19541 place count 423 transition count 651
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 19542 place count 423 transition count 650
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 19543 place count 422 transition count 650
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 19544 place count 422 transition count 649
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 15 with 35 rules applied. Total rules applied 19579 place count 422 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 19584 place count 422 transition count 644
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 19585 place count 422 transition count 644
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 19586 place count 421 transition count 643
Applied a total of 19586 rules in 1062 ms. Remains 421 /9140 variables (removed 8719) and now considering 643/14577 (removed 13934) transitions.
Running 641 sub problems to find dead transitions.
[2024-05-26 05:32:03] [INFO ] Flow matrix only has 642 transitions (discarded 1 similar events)
// Phase 1: matrix 642 rows 421 cols
[2024-05-26 05:32:03] [INFO ] Computed 59 invariants in 10 ms
[2024-05-26 05:32:03] [INFO ] State equation strengthened by 149 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (OVERLAPS) 2/421 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 9 ms to minimize.
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-26 05:32:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-26 05:32:14] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1063 variables, and 67 constraints, problems are : Problem set: 0 solved, 641 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 0/421 constraints, ReadFeed: 0/149 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 3 (OVERLAPS) 2/421 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Problem TDEAD642 is UNSAT
At refinement iteration 6 (OVERLAPS) 642/1063 variables, 421/488 constraints. Problems are: Problem set: 1 solved, 640 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 149/637 constraints. Problems are: Problem set: 1 solved, 640 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 640/1277 constraints. Problems are: Problem set: 1 solved, 640 unsolved
[2024-05-26 05:32:39] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-26 05:32:40] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-26 05:32:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
[2024-05-26 05:32:43] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 9 ms to minimize.
SMT process timed out in 40296ms, After SMT, problems are : Problem set: 1 solved, 640 unsolved
Search for dead transitions found 1 dead transitions in 40305ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 421/9140 places, 642/14577 transitions.
Applied a total of 0 rules in 18 ms. Remains 421 /421 variables (removed 0) and now considering 642/642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41419 ms. Remains : 421/9140 places, 642/14577 transitions.
RANDOM walk for 40000 steps (8 resets) in 1343 ms. (29 steps per ms) remains 1/8 properties
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
[2024-05-26 05:32:44] [INFO ] Flow matrix only has 641 transitions (discarded 1 similar events)
// Phase 1: matrix 641 rows 421 cols
[2024-05-26 05:32:44] [INFO ] Computed 59 invariants in 3 ms
[2024-05-26 05:32:44] [INFO ] State equation strengthened by 149 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 209/242 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/394 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 616/1010 variables, 394/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 141/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/1050 variables, 20/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1050 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1050 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/1056 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1056 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1062 variables, 7/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1062 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1062 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1062 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1062/1062 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 421/421 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 209/242 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/394 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 05:32:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-26 05:32:45] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 616/1010 variables, 394/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 141/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 05:32:45] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1010 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/1050 variables, 20/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1050 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1050 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1050 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1056 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1056 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1062 variables, 7/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1062 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1062 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1062/1062 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 421/421 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1525ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 574 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=191 )
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 51575 ms.
ITS solved all properties within timeout

BK_STOP 1716701566018

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
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 r245-tall-171654350400679"
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 ;