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.r500-smll-171649587500126.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 HirschbergSinclair-PT-45, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K 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.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 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 616K 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 HirschbergSinclair-PT-45-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717254824078

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:13:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:13:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:13:47] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2024-06-01 15:13:47] [INFO ] Transformed 1138 places.
[2024-06-01 15:13:47] [INFO ] Transformed 1042 transitions.
[2024-06-01 15:13:47] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 2736 ms. (14 steps per ms) remains 10/16 properties
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 850 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 616 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
// Phase 1: matrix 1042 rows 1138 cols
[2024-06-01 15:13:49] [INFO ] Computed 96 invariants in 64 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-01 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-09 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 757/1010 variables, 77/77 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1010 variables, 0/77 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/1049 variables, 13/90 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/90 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 55/1104 variables, 6/96 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1104 variables, 0/96 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1042/2146 variables, 1104/1200 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2146 variables, 0/1200 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/2180 variables, 34/1234 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2180/2180 variables, and 1234 constraints, problems are : Problem set: 7 solved, 3 unsolved in 3677 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1138/1138 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 851/947 variables, 61/61 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 27 places in 679 ms of which 118 ms to minimize.
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 62 places in 434 ms of which 8 ms to minimize.
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 10 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 59 places in 527 ms of which 9 ms to minimize.
[2024-06-01 15:13:57] [INFO ] Deduced a trap composed of 195 places in 437 ms of which 10 ms to minimize.
[2024-06-01 15:13:57] [INFO ] Deduced a trap composed of 43 places in 580 ms of which 10 ms to minimize.
[2024-06-01 15:13:58] [INFO ] Deduced a trap composed of 202 places in 421 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/947 variables, 7/68 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/947 variables, 0/68 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 87/1034 variables, 29/97 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 0/97 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 63/1097 variables, 6/103 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 95 places in 706 ms of which 9 ms to minimize.
SMT process timed out in 9758ms, After SMT, problems are : Problem set: 8 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 1138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Graph (complete) has 2184 edges and 1138 vertex of which 1094 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.9 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 371 transitions
Trivial Post-agglo rules discarded 371 transitions
Performed 371 trivial Post agglomeration. Transition count delta: 371
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 1094 transition count 670
Reduce places removed 371 places and 0 transitions.
Graph (complete) has 1240 edges and 723 vertex of which 624 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.3 ms
Discarding 99 places :
Also discarding 0 output transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 400 rules applied. Total rules applied 773 place count 624 transition count 642
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 900 place count 596 transition count 543
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 904 place count 592 transition count 539
Iterating global reduction 3 with 4 rules applied. Total rules applied 908 place count 592 transition count 539
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 911 place count 589 transition count 536
Iterating global reduction 3 with 3 rules applied. Total rules applied 914 place count 589 transition count 536
Free-agglomeration rule (complex) applied 60 times.
Iterating global reduction 3 with 60 rules applied. Total rules applied 974 place count 589 transition count 476
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1034 place count 529 transition count 476
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 1071 place count 492 transition count 439
Applied a total of 1071 rules in 530 ms. Remains 492 /1138 variables (removed 646) and now considering 439/1042 (removed 603) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 492/1138 places, 439/1042 transitions.
RANDOM walk for 40000 steps (88 resets) in 1343 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (21 resets) in 327 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (18 resets) in 272 ms. (146 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 439 rows 492 cols
[2024-06-01 15:14:00] [INFO ] Computed 53 invariants in 5 ms
[2024-06-01 15:14:00] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/445 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/470 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/898 variables, 470/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 47/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/918 variables, 15/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/919 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/919 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/920 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/923 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/923 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/923 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/931 variables, and 589 constraints, problems are : Problem set: 0 solved, 1 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 488/492 constraints, ReadFeed: 48/48 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/445 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/470 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 428/898 variables, 470/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 47/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/918 variables, 15/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/918 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/918 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/919 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/919 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/920 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/923 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/923 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/923 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 923/931 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 488/492 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 33 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 439/439 transitions.
Graph (complete) has 897 edges and 492 vertex of which 481 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 481 transition count 407
Reduce places removed 28 places and 0 transitions.
Graph (complete) has 772 edges and 453 vertex of which 451 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 61 rules applied. Total rules applied 94 place count 451 transition count 375
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 130 place count 419 transition count 371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 417 transition count 371
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 132 place count 417 transition count 350
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 174 place count 396 transition count 350
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 395 transition count 349
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 395 transition count 349
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 394 transition count 348
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 394 transition count 348
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 393 transition count 347
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 393 transition count 343
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 189 place count 388 transition count 343
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 189 place count 388 transition count 336
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 203 place count 381 transition count 336
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 377 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 376 transition count 332
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 208 place count 376 transition count 326
Deduced a syphon composed of 6 places in 44 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 220 place count 370 transition count 326
Applied a total of 220 rules in 328 ms. Remains 370 /492 variables (removed 122) and now considering 326/439 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 370/492 places, 326/439 transitions.
RANDOM walk for 40000 steps (120 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (36 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549919 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549919 steps, saw 120861 distinct states, run finished after 3006 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 326 rows 370 cols
[2024-06-01 15:14:07] [INFO ] Computed 44 invariants in 3 ms
[2024-06-01 15:14:07] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 296/337 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/362 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 326/688 variables, 362/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 688/696 variables, and 435 constraints, problems are : Problem set: 1 solved, 0 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 362/370 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 21093 ms.
ITS solved all properties within timeout

BK_STOP 1717254847868

--------------------
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

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="HirschbergSinclair-PT-45"
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 HirschbergSinclair-PT-45, 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 r500-smll-171649587500126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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