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.r464-smll-171620118400382.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 ltsminxred
Input is Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M May 18 16:42 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 Anderson-PT-12-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2023-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717262220808

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:17:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:17:03] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2024-06-01 17:17:03] [INFO ] Transformed 889 places.
[2024-06-01 17:17:03] [INFO ] Transformed 4152 transitions.
[2024-06-01 17:17:03] [INFO ] Found NUPN structural information;
[2024-06-01 17:17:03] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 899 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2844 ms. (14 steps per ms) remains 5/9 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 706 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2070 ms. (19 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 4/5 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/4 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 4152 rows 889 cols
[2024-06-01 17:17:06] [INFO ] Computed 27 invariants in 163 ms
[2024-06-01 17:17:06] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 771/866 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/866 variables, 771/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/889 variables, 14/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 23/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4152/5041 variables, 889/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5041 variables, 132/1937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5041 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/5041 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5041/5041 variables, and 1937 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5019 ms.
Refiners :[Domain max(s): 889/889 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 889/889 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 771/866 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/866 variables, 771/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/889 variables, 14/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 23/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4152/5041 variables, 889/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5041 variables, 132/1937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5041/5041 variables, and 1940 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5021 ms.
Refiners :[Domain max(s): 889/889 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 889/889 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 10799ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 96 Pre rules applied. Total rules applied 0 place count 889 transition count 4056
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 192 rules applied. Total rules applied 192 place count 793 transition count 4056
Discarding 231 places :
Symmetric choice reduction at 0 with 231 rule applications. Total rules 423 place count 562 transition count 1141
Iterating global reduction 0 with 231 rules applied. Total rules applied 654 place count 562 transition count 1141
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 692 place count 543 transition count 1122
Applied a total of 692 rules in 512 ms. Remains 543 /889 variables (removed 346) and now considering 1122/4152 (removed 3030) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 543/889 places, 1122/4152 transitions.
RANDOM walk for 40000 steps (8 resets) in 848 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 346 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227720 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227720 steps, saw 179313 distinct states, run finished after 3011 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1122 rows 543 cols
[2024-06-01 17:17:20] [INFO ] Computed 27 invariants in 61 ms
[2024-06-01 17:17:20] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 436/531 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/543 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1122/1665 variables, 543/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 132/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1665 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1665 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 702 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 543/543 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 436/531 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/543 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:17:24] [INFO ] Deduced a trap composed of 184 places in 788 ms of which 84 ms to minimize.
[2024-06-01 17:17:25] [INFO ] Deduced a trap composed of 250 places in 590 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:17:26] [INFO ] Deduced a trap composed of 171 places in 631 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1665 variables, 543/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1665 variables, 132/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1665 variables, 3/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1665 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1665 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 708 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7233 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 543/543 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 9965ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 883 ms.
Support contains 95 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 1122/1122 transitions.
Applied a total of 0 rules in 93 ms. Remains 543 /543 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 543/543 places, 1122/1122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 1122/1122 transitions.
Applied a total of 0 rules in 81 ms. Remains 543 /543 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
[2024-06-01 17:17:31] [INFO ] Invariant cache hit.
[2024-06-01 17:17:33] [INFO ] Implicit Places using invariants in 1389 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1409 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/543 places, 1122/1122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 542 transition count 1037
Reduce places removed 85 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 108 rules applied. Total rules applied 193 place count 457 transition count 1014
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 216 place count 434 transition count 1014
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 233 place count 434 transition count 997
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 250 place count 417 transition count 997
Applied a total of 250 rules in 132 ms. Remains 417 /542 variables (removed 125) and now considering 997/1122 (removed 125) transitions.
// Phase 1: matrix 997 rows 417 cols
[2024-06-01 17:17:33] [INFO ] Computed 26 invariants in 29 ms
[2024-06-01 17:17:34] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-06-01 17:17:34] [INFO ] Invariant cache hit.
[2024-06-01 17:17:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:17:38] [INFO ] Implicit Places using invariants and state equation in 4537 ms returned []
Implicit Place search using SMT with State Equation took 5308 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/543 places, 997/1122 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6933 ms. Remains : 417/543 places, 997/1122 transitions.
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 270244 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 3
Probabilistic random walk after 270244 steps, saw 205824 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2024-06-01 17:17:42] [INFO ] Invariant cache hit.
[2024-06-01 17:17:42] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 311/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/417 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 997/1414 variables, 417/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 132/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1414 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 575 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 417/417 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 311/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/417 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:17:44] [INFO ] Deduced a trap composed of 193 places in 563 ms of which 7 ms to minimize.
[2024-06-01 17:17:45] [INFO ] Deduced a trap composed of 165 places in 565 ms of which 6 ms to minimize.
[2024-06-01 17:17:45] [INFO ] Deduced a trap composed of 75 places in 466 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 997/1414 variables, 417/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 132/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1414 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1414 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 581 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15741 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 417/417 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 17299ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2581 ms.
Support contains 95 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 997/997 transitions.
Applied a total of 0 rules in 25 ms. Remains 417 /417 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 417/417 places, 997/997 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 997/997 transitions.
Applied a total of 0 rules in 22 ms. Remains 417 /417 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2024-06-01 17:18:01] [INFO ] Invariant cache hit.
[2024-06-01 17:18:02] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-06-01 17:18:02] [INFO ] Invariant cache hit.
[2024-06-01 17:18:03] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:18:07] [INFO ] Implicit Places using invariants and state equation in 4538 ms returned []
Implicit Place search using SMT with State Equation took 5308 ms to find 0 implicit places.
[2024-06-01 17:18:07] [INFO ] Redundant transitions in 113 ms returned []
Running 985 sub problems to find dead transitions.
[2024-06-01 17:18:07] [INFO ] Invariant cache hit.
[2024-06-01 17:18:07] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 985 unsolved
[2024-06-01 17:18:23] [INFO ] Deduced a trap composed of 134 places in 500 ms of which 7 ms to minimize.
[2024-06-01 17:18:24] [INFO ] Deduced a trap composed of 97 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:18:25] [INFO ] Deduced a trap composed of 145 places in 515 ms of which 7 ms to minimize.
[2024-06-01 17:18:25] [INFO ] Deduced a trap composed of 109 places in 457 ms of which 4 ms to minimize.
[2024-06-01 17:18:26] [INFO ] Deduced a trap composed of 66 places in 485 ms of which 6 ms to minimize.
[2024-06-01 17:18:27] [INFO ] Deduced a trap composed of 188 places in 579 ms of which 5 ms to minimize.
[2024-06-01 17:18:27] [INFO ] Deduced a trap composed of 147 places in 500 ms of which 7 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 148 places in 493 ms of which 7 ms to minimize.
[2024-06-01 17:18:28] [INFO ] Deduced a trap composed of 141 places in 558 ms of which 6 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 83 places in 576 ms of which 7 ms to minimize.
[2024-06-01 17:18:29] [INFO ] Deduced a trap composed of 132 places in 602 ms of which 7 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 144 places in 635 ms of which 7 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 176 places in 540 ms of which 7 ms to minimize.
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 149 places in 597 ms of which 7 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 211 places in 584 ms of which 7 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 81 places in 562 ms of which 6 ms to minimize.
[2024-06-01 17:18:33] [INFO ] Deduced a trap composed of 122 places in 585 ms of which 7 ms to minimize.
[2024-06-01 17:18:34] [INFO ] Deduced a trap composed of 88 places in 593 ms of which 7 ms to minimize.
[2024-06-01 17:18:34] [INFO ] Deduced a trap composed of 92 places in 542 ms of which 7 ms to minimize.
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 136 places in 588 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 985 unsolved
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 104 places in 557 ms of which 7 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 106 places in 607 ms of which 7 ms to minimize.
[2024-06-01 17:18:39] [INFO ] Deduced a trap composed of 90 places in 610 ms of which 7 ms to minimize.
SMT process timed out in 31920ms, After SMT, problems are : Problem set: 0 solved, 985 unsolved
Search for dead transitions found 0 dead transitions in 31945ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37420 ms. Remains : 417/417 places, 997/997 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 417 transition count 888
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 308 transition count 888
Applied a total of 218 rules in 44 ms. Remains 308 /417 variables (removed 109) and now considering 888/997 (removed 109) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 888 rows 308 cols
[2024-06-01 17:18:39] [INFO ] Computed 26 invariants in 11 ms
[2024-06-01 17:18:39] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 17:18:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 17:18:39] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 32 ms returned sat
[2024-06-01 17:18:41] [INFO ] After 1363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 17:18:42] [INFO ] After 2174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 17:18:42] [INFO ] After 3078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 3342 ms.
[2024-06-01 17:18:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-06-01 17:18:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 417 places, 997 transitions and 3870 arcs took 18 ms.
[2024-06-01 17:18:43] [INFO ] Flatten gal took : 257 ms
Total runtime 100811 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Anderson-PT-12-ReachabilityCardinality-2023-01
Could not compute solution for formula : Anderson-PT-12-ReachabilityCardinality-2024-08
Could not compute solution for formula : Anderson-PT-12-ReachabilityCardinality-2024-12

BK_STOP 1717262323865

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name Anderson-PT-12-ReachabilityCardinality-2023-01
rfs formula type AG
rfs formula formula --invariant=/tmp/657/inv_0_
rfs formula name Anderson-PT-12-ReachabilityCardinality-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/657/inv_1_
rfs formula name Anderson-PT-12-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/657/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Anderson-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Anderson-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;