fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r246-tall-171654352100663
Last Updated
July 7, 2024

About the Execution of ITS-Tools for NoC3x3-PT-7B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
922.899 17479.00 51940.00 37.70 TFFTTFTTTFFFFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 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 2.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-7B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716712807182

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-7B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-26 08:40:08] [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 08:40:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 08:40:08] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2024-05-26 08:40:08] [INFO ] Transformed 7014 places.
[2024-05-26 08:40:08] [INFO ] Transformed 8833 transitions.
[2024-05-26 08:40:08] [INFO ] Found NUPN structural information;
[2024-05-26 08:40:08] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (13 resets) in 2208 ms. (18 steps per ms) remains 11/16 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 796 ms. (50 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
[2024-05-26 08:40:10] [INFO ] Flatten gal took : 666 ms
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
[2024-05-26 08:40:10] [INFO ] Flatten gal took : 497 ms
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
[2024-05-26 08:40:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10647327569248550959.gal : 107 ms
[2024-05-26 08:40:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4263260822275259839.prop : 3 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/ReachabilityCardinality10647327569248550959.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4263260822275259839.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 ...329
// Phase 1: matrix 8833 rows 7014 cols
[2024-05-26 08:40:11] [INFO ] Computed 66 invariants in 86 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality4263260822275259839.prop.
At refinement iteration 2 (OVERLAPS) 6664/6937 variables, 56/329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6937 variables, 6664/6993 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6937 variables, 0/6993 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 77/7014 variables, 10/7003 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7014 variables, 77/7080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7014 variables, 0/7080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5426ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 273 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7110 edges and 7014 vertex of which 1763 / 7014 are part of one of the 17 SCC in 26 ms
Free SCC test removed 1746 places
Drop transitions (Empty/Sink Transition effects.) removed 2093 transitions
Reduce isomorphic transitions removed 2093 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1969 transitions
Trivial Post-agglo rules discarded 1969 transitions
Performed 1969 trivial Post agglomeration. Transition count delta: 1969
Iterating post reduction 0 with 1969 rules applied. Total rules applied 1970 place count 5268 transition count 4771
Reduce places removed 1969 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 1 with 2200 rules applied. Total rules applied 4170 place count 3299 transition count 4540
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 115 rules applied. Total rules applied 4285 place count 3188 transition count 4536
Reduce places removed 2 places and 0 transitions.
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Iterating post reduction 3 with 164 rules applied. Total rules applied 4449 place count 3186 transition count 4374
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 4 with 189 rules applied. Total rules applied 4638 place count 3024 transition count 4347
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 4645 place count 3017 transition count 4347
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 4645 place count 3017 transition count 4306
Deduced a syphon composed of 41 places in 9 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 4727 place count 2976 transition count 4306
Discarding 627 places :
Symmetric choice reduction at 6 with 627 rule applications. Total rules 5354 place count 2349 transition count 3663
Iterating global reduction 6 with 627 rules applied. Total rules applied 5981 place count 2349 transition count 3663
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 6 with 33 rules applied. Total rules applied 6014 place count 2349 transition count 3630
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 13 rules applied. Total rules applied 6027 place count 2339 transition count 3627
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 6029 place count 2337 transition count 3627
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 39 Pre rules applied. Total rules applied 6029 place count 2337 transition count 3588
Deduced a syphon composed of 39 places in 20 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 78 rules applied. Total rules applied 6107 place count 2298 transition count 3588
Discarding 276 places :
Symmetric choice reduction at 9 with 276 rule applications. Total rules 6383 place count 2022 transition count 3186
Iterating global reduction 9 with 276 rules applied. Total rules applied 6659 place count 2022 transition count 3186
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 9 with 85 rules applied. Total rules applied 6744 place count 2022 transition count 3101
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 6768 place count 1998 transition count 3053
Iterating global reduction 10 with 24 rules applied. Total rules applied 6792 place count 1998 transition count 3053
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 6812 place count 1978 transition count 3033
Iterating global reduction 10 with 20 rules applied. Total rules applied 6832 place count 1978 transition count 3033
Discarding 17 places :
Symmetric choice reduction at 10 with 17 rule applications. Total rules 6849 place count 1961 transition count 3013
Iterating global reduction 10 with 17 rules applied. Total rules applied 6866 place count 1961 transition count 3013
Discarding 13 places :
Symmetric choice reduction at 10 with 13 rule applications. Total rules 6879 place count 1948 transition count 2987
Iterating global reduction 10 with 13 rules applied. Total rules applied 6892 place count 1948 transition count 2987
Performed 605 Post agglomeration using F-continuation condition with reduction of 49 identical transitions.
Deduced a syphon composed of 605 places in 2 ms
Reduce places removed 605 places and 0 transitions.
Iterating global reduction 10 with 1210 rules applied. Total rules applied 8102 place count 1343 transition count 2333
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 10 with 66 rules applied. Total rules applied 8168 place count 1343 transition count 2267
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 8171 place count 1340 transition count 2260
Iterating global reduction 11 with 3 rules applied. Total rules applied 8174 place count 1340 transition count 2260
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 8176 place count 1338 transition count 2258
Iterating global reduction 11 with 2 rules applied. Total rules applied 8178 place count 1338 transition count 2258
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 11 with 58 rules applied. Total rules applied 8236 place count 1309 transition count 2229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 8242 place count 1309 transition count 2223
Performed 101 Post agglomeration using F-continuation condition with reduction of 163 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 12 with 202 rules applied. Total rules applied 8444 place count 1208 transition count 2503
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 12 with 98 rules applied. Total rules applied 8542 place count 1208 transition count 2405
Performed 101 Post agglomeration using F-continuation condition with reduction of 132 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 13 with 202 rules applied. Total rules applied 8744 place count 1107 transition count 2616
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 13 with 99 rules applied. Total rules applied 8843 place count 1107 transition count 2517
Performed 85 Post agglomeration using F-continuation condition with reduction of 130 identical transitions.
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 14 with 170 rules applied. Total rules applied 9013 place count 1022 transition count 2763
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 14 with 99 rules applied. Total rules applied 9112 place count 1022 transition count 2664
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 9122 place count 1017 transition count 2735
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 9130 place count 1017 transition count 2727
Drop transitions (Redundant composition of simpler transitions.) removed 427 transitions
Redundant transition composition rules discarded 427 transitions
Iterating global reduction 16 with 427 rules applied. Total rules applied 9557 place count 1017 transition count 2300
Discarding 17 places :
Symmetric choice reduction at 16 with 17 rule applications. Total rules 9574 place count 1000 transition count 2280
Iterating global reduction 16 with 17 rules applied. Total rules applied 9591 place count 1000 transition count 2280
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -133
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 9611 place count 990 transition count 2413
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 16 with 46 rules applied. Total rules applied 9657 place count 990 transition count 2367
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 9659 place count 988 transition count 2365
Iterating global reduction 16 with 2 rules applied. Total rules applied 9661 place count 988 transition count 2365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 9663 place count 987 transition count 2384
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 9676 place count 987 transition count 2371
Free-agglomeration rule applied 138 times.
Iterating global reduction 16 with 138 rules applied. Total rules applied 9814 place count 987 transition count 2233
Reduce places removed 138 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 16 with 153 rules applied. Total rules applied 9967 place count 849 transition count 2218
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 17 with 50 rules applied. Total rules applied 10017 place count 849 transition count 2168
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 10022 place count 849 transition count 2163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 10027 place count 844 transition count 2163
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 10029 place count 844 transition count 2161
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 10031 place count 844 transition count 2159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 10033 place count 842 transition count 2159
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 10034 place count 842 transition count 2158
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 10035 place count 842 transition count 2160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 10036 place count 841 transition count 2160
Partial Free-agglomeration rule applied 69 times.
Drop transitions (Partial Free agglomeration) removed 69 transitions
Iterating global reduction 20 with 69 rules applied. Total rules applied 10105 place count 841 transition count 2160
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 10126 place count 841 transition count 2139
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 10129 place count 841 transition count 2139
Applied a total of 10129 rules in 2936 ms. Remains 841 /7014 variables (removed 6173) and now considering 2139/8833 (removed 6694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2952 ms. Remains : 841/7014 places, 2139/8833 transitions.
RANDOM walk for 40000 steps (8 resets) in 795 ms. (50 steps per ms) remains 8/11 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 7/8 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/7 properties
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
[2024-05-26 08:40:19] [INFO ] Flow matrix only has 2119 transitions (discarded 20 similar events)
// Phase 1: matrix 2119 rows 841 cols
[2024-05-26 08:40:19] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 08:40:19] [INFO ] State equation strengthened by 165 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 621/777 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/777 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 64/841 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2119/2960 variables, 841/907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2960 variables, 165/1072 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2960 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2960 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2960/2960 variables, and 1072 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 841/841 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 621/777 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 08:40:21] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/777 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/777 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 64/841 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2119/2960 variables, 841/908 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2960 variables, 165/1073 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2960 variables, 6/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2960 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2960 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2960/2960 variables, and 1079 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3165 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 841/841 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 4532ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 15127 steps, including 94 resets, run visited all 6 properties in 191 ms. (steps per millisecond=79 )
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 213 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 16292 ms.

BK_STOP 1716712824661

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-7B"
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-7B, 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-171654352100663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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