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.r246-tall-171654352000599.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 itstools
Input is NoC3x3-PT-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352000599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 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:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 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 581K 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-3B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716697157187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-26 04:19:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 04:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:19:18] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-26 04:19:18] [INFO ] Transformed 2117 places.
[2024-05-26 04:19:18] [INFO ] Transformed 2435 transitions.
[2024-05-26 04:19:18] [INFO ] Found NUPN structural information;
[2024-05-26 04:19:18] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 1800 ms. (22 steps per ms) remains 3/16 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
[2024-05-26 04:19:19] [INFO ] Flatten gal took : 342 ms
// Phase 1: matrix 2435 rows 2117 cols
[2024-05-26 04:19:19] [INFO ] Computed 66 invariants in 39 ms
[2024-05-26 04:19:19] [INFO ] Flatten gal took : 157 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 04:19:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4444663898332613763.gal : 53 ms
[2024-05-26 04:19:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6395410655701450253.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4444663898332613763.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6395410655701450253.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 2 (OVERLAPS) 1076/1094 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1094 variables, 1076/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality6395410655701450253.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1094 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1023/2117 variables, 33/1160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2117 variables, 1023/2183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 0/2183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2435/4552 variables, 2117/4300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4552/4552 variables, and 4300 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1754 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2117/2117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1076/1094 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1094 variables, 1076/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 04:19:21] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 35 ms to minimize.
[2024-05-26 04:19:22] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 3 ms to minimize.
[2024-05-26 04:19:22] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-26 04:19:22] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-26 04:19:22] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-26 04:19:22] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1094 variables, 6/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 6 (OVERLAPS) 1023/2117 variables, 33/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 1023/2189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
[2024-05-26 04:19:23] [INFO ] Deduced a trap composed of 61 places in 471 ms of which 8 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
[2024-05-26 04:19:23] [INFO ] Deduced a trap composed of 33 places in 477 ms of which 9 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 66
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :66 after 509
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :509 after 684
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :684 after 1971
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1971 after 8420
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :8420 after 475439
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :475439 after 2.27753e+08
[2024-05-26 04:19:24] [INFO ] Deduced a trap composed of 35 places in 505 ms of which 8 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.27753e+08 after 3.89501e+09
[2024-05-26 04:19:24] [INFO ] Deduced a trap composed of 66 places in 444 ms of which 7 ms to minimize.
[2024-05-26 04:19:25] [INFO ] Deduced a trap composed of 84 places in 380 ms of which 7 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.89501e+09 after 1.62956e+10
[2024-05-26 04:19:25] [INFO ] Deduced a trap composed of 83 places in 316 ms of which 5 ms to minimize.
[2024-05-26 04:19:25] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 3 ms to minimize.
[2024-05-26 04:19:26] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 3 ms to minimize.
[2024-05-26 04:19:26] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-26 04:19:26] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2117/4552 variables, and 2199 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5016 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/2117 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 16/16 constraints]
After SMT, in 6904ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1708 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 9 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 2049 transition count 1936
Reduce places removed 427 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 433 rules applied. Total rules applied 866 place count 1622 transition count 1930
Reduce places removed 3 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 13 rules applied. Total rules applied 879 place count 1619 transition count 1920
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 889 place count 1609 transition count 1920
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 889 place count 1609 transition count 1898
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 933 place count 1587 transition count 1898
Discarding 361 places :
Symmetric choice reduction at 4 with 361 rule applications. Total rules 1294 place count 1226 transition count 1537
Iterating global reduction 4 with 361 rules applied. Total rules applied 1655 place count 1226 transition count 1537
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1655 place count 1226 transition count 1497
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1735 place count 1186 transition count 1497
Discarding 135 places :
Symmetric choice reduction at 4 with 135 rule applications. Total rules 1870 place count 1051 transition count 1324
Iterating global reduction 4 with 135 rules applied. Total rules applied 2005 place count 1051 transition count 1324
Discarding 136 places :
Symmetric choice reduction at 4 with 136 rule applications. Total rules 2141 place count 915 transition count 1173
Iterating global reduction 4 with 136 rules applied. Total rules applied 2277 place count 915 transition count 1173
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 2332 place count 860 transition count 1076
Iterating global reduction 4 with 55 rules applied. Total rules applied 2387 place count 860 transition count 1076
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 17 rules applied. Total rules applied 2404 place count 859 transition count 1060
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2405 place count 858 transition count 1060
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 2444 place count 819 transition count 1021
Iterating global reduction 6 with 39 rules applied. Total rules applied 2483 place count 819 transition count 1021
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2491 place count 815 transition count 1017
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2495 place count 811 transition count 1017
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 2522 place count 784 transition count 963
Iterating global reduction 8 with 27 rules applied. Total rules applied 2549 place count 784 transition count 963
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 2576 place count 757 transition count 936
Iterating global reduction 8 with 27 rules applied. Total rules applied 2603 place count 757 transition count 936
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 37 rules applied. Total rules applied 2640 place count 752 transition count 904
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2645 place count 747 transition count 904
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 2 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 10 with 592 rules applied. Total rules applied 3237 place count 451 transition count 608
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3251 place count 437 transition count 594
Iterating global reduction 10 with 14 rules applied. Total rules applied 3265 place count 437 transition count 594
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 3276 place count 426 transition count 572
Iterating global reduction 10 with 11 rules applied. Total rules applied 3287 place count 426 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3289 place count 426 transition count 570
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3290 place count 425 transition count 568
Iterating global reduction 11 with 1 rules applied. Total rules applied 3291 place count 425 transition count 568
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 3331 place count 405 transition count 639
Free-agglomeration rule applied 22 times.
Iterating global reduction 11 with 22 rules applied. Total rules applied 3353 place count 405 transition count 617
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 29 rules applied. Total rules applied 3382 place count 383 transition count 610
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 3384 place count 383 transition count 608
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 3388 place count 383 transition count 604
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3392 place count 379 transition count 604
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 3395 place count 379 transition count 604
Applied a total of 3395 rules in 963 ms. Remains 379 /2117 variables (removed 1738) and now considering 604/2435 (removed 1831) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 974 ms. Remains : 379/2117 places, 604/2435 transitions.
SDD proceeding with computation,3 properties remain. new max is 32768
RANDOM walk for 40000 steps (544 resets) in 834 ms. (47 steps per ms) remains 1/3 properties
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD size :1.62956e+10 after 1.61883e+11
BEST_FIRST walk for 40004 steps (33 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
// Phase 1: matrix 604 rows 379 cols
[2024-05-26 04:19:27] [INFO ] Computed 55 invariants in 6 ms
[2024-05-26 04:19:27] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/188 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/336 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 593/929 variables, 336/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 60/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/983 variables, 43/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/983 variables, 11/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/983 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 379/379 constraints, ReadFeed: 71/71 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/188 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-26 04:19:28] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 148/336 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:28] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-26 04:19:28] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 593/929 variables, 336/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 60/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 54/983 variables, 43/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/983 variables, 11/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/983 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 379/379 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 704ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 15 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 379 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 378 transition count 603
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 378 transition count 602
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 377 transition count 602
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 375 transition count 591
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 375 transition count 591
Applied a total of 8 rules in 25 ms. Remains 375 /379 variables (removed 4) and now considering 591/604 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 375/379 places, 591/604 transitions.
RANDOM walk for 40000 steps (537 resets) in 366 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (31 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.61883e+11 after 3.62379e+14
Interrupted probabilistic random walk after 736149 steps, run timeout after 3005 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 736149 steps, saw 144045 distinct states, run finished after 3021 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 591 rows 375 cols
[2024-05-26 04:19:31] [INFO ] Computed 55 invariants in 3 ms
[2024-05-26 04:19:31] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/187 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/332 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 580/912 variables, 332/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 57/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/966 variables, 43/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/966 variables, 11/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/966 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 966/966 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 375/375 constraints, ReadFeed: 68/68 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/187 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 145/332 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-26 04:19:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-26 04:19:32] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-26 04:19:32] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-26 04:19:32] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 580/912 variables, 332/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 57/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 54/966 variables, 43/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 11/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/966 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 966/966 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 375/375 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 788ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 14137 ms.

BK_STOP 1716697172534

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-3B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-3B, 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 r246-tall-171654352000599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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