Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654350300623.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is NoC3x3-PT-5A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300623
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 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 248K 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-5A-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716690909116

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 02:35:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 02:35:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:35:10] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-26 02:35:10] [INFO ] Transformed 417 places.
[2024-05-26 02:35:10] [INFO ] Transformed 933 transitions.
[2024-05-26 02:35:10] [INFO ] Found NUPN structural information;
[2024-05-26 02:35:10] [INFO ] Parsed PT model containing 417 places and 933 transitions and 3585 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1362 ms. (29 steps per ms) remains 3/16 properties
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-5A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
[2024-05-26 02:35:11] [INFO ] Flow matrix only has 851 transitions (discarded 82 similar events)
// Phase 1: matrix 851 rows 417 cols
[2024-05-26 02:35:11] [INFO ] Computed 66 invariants in 24 ms
[2024-05-26 02:35:11] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 267/342 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 267/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/417 variables, 20/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 75/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 851/1268 variables, 417/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1268 variables, 32/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1268 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1268 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 932 constraints, problems are : Problem set: 0 solved, 2 unsolved in 741 ms.
Refiners :[Domain max(s): 417/417 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 417/417 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 267/342 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 267/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/417 variables, 20/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 75/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 851/1268 variables, 417/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1268 variables, 32/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1268 variables, 2/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1268 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1268 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1268/1268 variables, and 934 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1383 ms.
Refiners :[Domain max(s): 417/417 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 417/417 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2300ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 693 ms.
Support contains 75 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 933/933 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 351 transition count 786
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 351 transition count 786
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 136 place count 347 transition count 770
Iterating global reduction 0 with 4 rules applied. Total rules applied 140 place count 347 transition count 770
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 148 place count 347 transition count 762
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 172 place count 347 transition count 738
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 174 place count 345 transition count 738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 344 transition count 735
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 344 transition count 735
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 208 place count 344 transition count 735
Applied a total of 208 rules in 128 ms. Remains 344 /417 variables (removed 73) and now considering 735/933 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 344/417 places, 735/933 transitions.
RANDOM walk for 40000 steps (8 resets) in 823 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 361319 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 2
Probabilistic random walk after 361319 steps, saw 317628 distinct states, run finished after 3004 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-26 02:35:17] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
// Phase 1: matrix 722 rows 344 cols
[2024-05-26 02:35:17] [INFO ] Computed 64 invariants in 8 ms
[2024-05-26 02:35:17] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 206/281 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/344 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 722/1066 variables, 344/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 37/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1066 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1066/1066 variables, and 445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 344/344 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 206/281 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/344 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 722/1066 variables, 344/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 37/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1066 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1066/1066 variables, and 447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 344/344 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1819ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 695 ms.
Support contains 75 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 735/735 transitions.
Applied a total of 0 rules in 16 ms. Remains 344 /344 variables (removed 0) and now considering 735/735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 344/344 places, 735/735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 735/735 transitions.
Applied a total of 0 rules in 20 ms. Remains 344 /344 variables (removed 0) and now considering 735/735 (removed 0) transitions.
[2024-05-26 02:35:20] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
[2024-05-26 02:35:20] [INFO ] Invariant cache hit.
[2024-05-26 02:35:20] [INFO ] Implicit Places using invariants in 173 ms returned [40, 75, 109, 158, 221, 259, 293]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 180 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 337/344 places, 735/735 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 337 transition count 735
Applied a total of 7 rules in 22 ms. Remains 337 /337 variables (removed 0) and now considering 735/735 (removed 0) transitions.
[2024-05-26 02:35:20] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
// Phase 1: matrix 722 rows 337 cols
[2024-05-26 02:35:20] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:35:20] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-26 02:35:20] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
[2024-05-26 02:35:20] [INFO ] Invariant cache hit.
[2024-05-26 02:35:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-26 02:35:21] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 337/344 places, 735/735 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 723 ms. Remains : 337/344 places, 735/735 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 412627 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 412627 steps, saw 376564 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-05-26 02:35:24] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
[2024-05-26 02:35:24] [INFO ] Invariant cache hit.
[2024-05-26 02:35:24] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 206/281 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/337 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 722/1059 variables, 337/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 30/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1059 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1059 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1059/1059 variables, and 424 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 337/337 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 206/281 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/337 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 02:35:24] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 02:35:24] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-26 02:35:24] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 722/1059 variables, 337/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 30/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1059 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1059 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1059/1059 variables, and 429 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1667 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 337/337 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 2000ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 539 ms.
Support contains 75 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 735/735 transitions.
Applied a total of 0 rules in 10 ms. Remains 337 /337 variables (removed 0) and now considering 735/735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 337/337 places, 735/735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 735/735 transitions.
Applied a total of 0 rules in 10 ms. Remains 337 /337 variables (removed 0) and now considering 735/735 (removed 0) transitions.
[2024-05-26 02:35:26] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
[2024-05-26 02:35:26] [INFO ] Invariant cache hit.
[2024-05-26 02:35:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-26 02:35:26] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
[2024-05-26 02:35:26] [INFO ] Invariant cache hit.
[2024-05-26 02:35:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-26 02:35:27] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-26 02:35:27] [INFO ] Redundant transitions in 44 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-26 02:35:27] [INFO ] Flow matrix only has 722 transitions (discarded 13 similar events)
[2024-05-26 02:35:27] [INFO ] Invariant cache hit.
[2024-05-26 02:35:27] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-26 02:35:35] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 722/1059 variables, 337/395 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 30/425 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1059/1059 variables, and 425 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 337/337 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 722/1059 variables, 337/395 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 30/425 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1059 variables, 734/1159 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/1059 variables, and 1159 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 337/337 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60916 ms. Remains : 337/337 places, 735/735 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 337 transition count 722
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 337 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 337 transition count 719
Applied a total of 17 rules in 29 ms. Remains 337 /337 variables (removed 0) and now considering 719/735 (removed 16) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 719 rows 337 cols
[2024-05-26 02:36:27] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 02:36:27] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:36:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:36:28] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-26 02:36:28] [INFO ] After 781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:36:28] [INFO ] After 1144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1266 ms.
[2024-05-26 02:36:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-26 02:36:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 337 places, 735 transitions and 2872 arcs took 7 ms.
[2024-05-26 02:36:29] [INFO ] Flatten gal took : 103 ms
Total runtime 78986 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-5A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 337
TRANSITIONS: 735
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.007s]


SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 605
MODEL NAME: /home/mcc/execution/405/model
337 places, 735 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-5A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is NoC3x3-PT-5A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350300623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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