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

About the Execution of ITS-Tools for NoC3x3-PT-8A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2069.592 14584.00 39724.00 119.20 FTTTTFTTTTFTTFTT 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-171654352100671.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-8A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352100671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.4K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 745K 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-8A-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-8A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716714139140

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-8A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-26 09:02:20] [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 09:02:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:02:20] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-26 09:02:20] [INFO ] Transformed 317 places.
[2024-05-26 09:02:20] [INFO ] Transformed 4293 transitions.
[2024-05-26 09:02:20] [INFO ] Found NUPN structural information;
[2024-05-26 09:02:20] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
[2024-05-26 09:02:21] [INFO ] Flatten gal took : 273 ms
RANDOM walk for 40000 steps (8 resets) in 2480 ms. (16 steps per ms) remains 4/16 properties
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
[2024-05-26 09:02:21] [INFO ] Flatten gal took : 89 ms
[2024-05-26 09:02:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5752708754827117775.gal : 54 ms
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 4/4 properties
[2024-05-26 09:02:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16662430905476021858.prop : 2 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/ReachabilityCardinality5752708754827117775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16662430905476021858.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties

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
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality16662430905476021858.prop.
[2024-05-26 09:02:21] [INFO ] Flow matrix only has 566 transitions (discarded 120 similar events)
// Phase 1: matrix 566 rows 317 cols
[2024-05-26 09:02:21] [INFO ] Computed 66 invariants in 19 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :2 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 19
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :19 after 28
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :28 after 82
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :82 after 8813
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8813 after 119269
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :119269 after 7.33845e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7.33845e+07 after 1.51185e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.51185e+09 after 2.05258e+15
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 117/166 variables, 34/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 117/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.05258e+15 after 8.2716e+15
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 151/317 variables, 32/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 151/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 566/883 variables, 317/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/883 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 883/883 variables, and 700 constraints, problems are : Problem set: 0 solved, 4 unsolved in 886 ms.
Refiners :[Domain max(s): 317/317 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem NoC3x3-PT-8A-ReachabilityFireability-2024-12 is UNSAT
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 117/166 variables, 34/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 117/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/317 variables, 32/232 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 151/383 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 566/883 variables, 317/700 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 3/703 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/883 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 883/883 variables, and 703 constraints, problems are : Problem set: 1 solved, 3 unsolved in 614 ms.
Refiners :[Domain max(s): 317/317 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1686ms problems are : Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8.2716e+15 after 1.98158e+23
Parikh walk visited 0 properties in 1403 ms.
Support contains 47 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 686/686 transitions.
Graph (trivial) has 101 edges and 317 vertex of which 49 / 317 are part of one of the 21 SCC in 3 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 85 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 137 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 236 transition count 449
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 236 transition count 449
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 111 place count 234 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 0 with 134 rules applied. Total rules applied 245 place count 234 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 253 place count 226 transition count 313
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 270 place count 226 transition count 313
Applied a total of 270 rules in 99 ms. Remains 226 /317 variables (removed 91) and now considering 313/686 (removed 373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 226/317 places, 313/686 transitions.
RANDOM walk for 40000 steps (8 resets) in 559 ms. (71 steps per ms) remains 1/3 properties
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
// Phase 1: matrix 313 rows 226 cols
[2024-05-26 09:02:25] [INFO ] Computed 58 invariants in 18 ms
[2024-05-26 09:02:25] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/97 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/226 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/539 variables, 226/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 103/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/539 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 226/226 constraints, ReadFeed: 103/103 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/97 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/226 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:02:25] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 313/539 variables, 226/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 103/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/539 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 226/226 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 30 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 313/313 transitions.
Graph (trivial) has 20 edges and 226 vertex of which 10 / 226 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 220 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 220 transition count 302
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 214 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 25 place count 214 transition count 286
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 214 transition count 286
Applied a total of 28 rules in 54 ms. Remains 214 /226 variables (removed 12) and now considering 286/313 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 214/226 places, 286/313 transitions.
RANDOM walk for 40000 steps (8 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1136526 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :0 out of 1
Probabilistic random walk after 1136526 steps, saw 993607 distinct states, run finished after 3005 ms. (steps per millisecond=378 ) properties seen :0
// Phase 1: matrix 286 rows 214 cols
[2024-05-26 09:02:28] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 09:02:28] [INFO ] State equation strengthened by 129 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/93 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/214 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/500 variables, 214/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 129/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 214/214 constraints, ReadFeed: 129/129 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/93 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/214 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:02:29] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 286/500 variables, 214/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 129/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:02:29] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/500 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 404 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 214/214 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 30 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 286/286 transitions.
Applied a total of 0 rules in 21 ms. Remains 214 /214 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 214/214 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 286/286 transitions.
Applied a total of 0 rules in 8 ms. Remains 214 /214 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-05-26 09:02:29] [INFO ] Invariant cache hit.
[2024-05-26 09:02:29] [INFO ] Implicit Places using invariants in 144 ms returned [15, 40, 59, 85, 122, 166, 194]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 150 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/214 places, 286/286 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 207 transition count 269
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 190 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 188 transition count 267
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 188 transition count 267
Applied a total of 41 rules in 18 ms. Remains 188 /207 variables (removed 19) and now considering 267/286 (removed 19) transitions.
// Phase 1: matrix 267 rows 188 cols
[2024-05-26 09:02:29] [INFO ] Computed 51 invariants in 2 ms
[2024-05-26 09:02:29] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-26 09:02:29] [INFO ] Invariant cache hit.
[2024-05-26 09:02:29] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-26 09:02:30] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/214 places, 267/286 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 491 ms. Remains : 188/214 places, 267/286 transitions.
RANDOM walk for 40000 steps (8 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1359292 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :0 out of 1
Probabilistic random walk after 1359292 steps, saw 1107476 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
[2024-05-26 09:02:33] [INFO ] Invariant cache hit.
[2024-05-26 09:02:33] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/89 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/188 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 267/455 variables, 188/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 94/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/455 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 188/188 constraints, ReadFeed: 94/94 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/89 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/188 variables, 26/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:02:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 267/455 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 94/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 09:02:33] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-26 09:02:33] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/455 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/455 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 188/188 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
FORMULA NoC3x3-PT-8A-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 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 13445 ms.

BK_STOP 1716714153724

--------------------
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-8A"
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-8A, 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-171654352100671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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