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.r536-tall-171690533300878.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 Szymanski-PT-b06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300878
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b06-ReachabilityCardinality-2024-00
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-01
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2023-02
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-03
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-04
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-05
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-06
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-07
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-08
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-09
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-10
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-11
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-12
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-13
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-14
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717283299126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:08:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:08:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:08:20] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2024-06-01 23:08:20] [INFO ] Transformed 568 places.
[2024-06-01 23:08:20] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:08:20] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40007 steps (9 resets) in 2119 ms. (18 steps per ms) remains 9/10 properties
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 163 ms. (243 steps per ms) remains 8/9 properties
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (16 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 569 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (13 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
[2024-06-01 23:08:22] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:08:22] [INFO ] Computed 3 invariants in 47 ms
[2024-06-01 23:08:22] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 286/307 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 5 solved, 3 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/307 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-01 23:08:24] [INFO ] Deduced a trap composed of 127 places in 602 ms of which 26 ms to minimize.
[2024-06-01 23:08:25] [INFO ] Deduced a trap composed of 142 places in 592 ms of which 3 ms to minimize.
[2024-06-01 23:08:25] [INFO ] Deduced a trap composed of 131 places in 522 ms of which 3 ms to minimize.
[2024-06-01 23:08:26] [INFO ] Deduced a trap composed of 141 places in 603 ms of which 5 ms to minimize.
[2024-06-01 23:08:26] [INFO ] Deduced a trap composed of 46 places in 566 ms of which 3 ms to minimize.
[2024-06-01 23:08:27] [INFO ] Deduced a trap composed of 130 places in 556 ms of which 2 ms to minimize.
[2024-06-01 23:08:27] [INFO ] Deduced a trap composed of 39 places in 622 ms of which 2 ms to minimize.
[2024-06-01 23:08:28] [INFO ] Deduced a trap composed of 118 places in 563 ms of which 2 ms to minimize.
[2024-06-01 23:08:29] [INFO ] Deduced a trap composed of 122 places in 580 ms of which 2 ms to minimize.
SMT process timed out in 7038ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 306 transition count 7939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 305 transition count 7811
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 305 transition count 7811
Applied a total of 128 rules in 464 ms. Remains 305 /308 variables (removed 3) and now considering 7811/8064 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 305/308 places, 7811/8064 transitions.
RANDOM walk for 40007 steps (8 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/3 properties
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-06-01 23:08:29] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2024-06-01 23:08:29] [INFO ] Computed 1 invariants in 29 ms
[2024-06-01 23:08:29] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2607/2912 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2912 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2912 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2912 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2912/2912 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 828 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:08:31] [INFO ] Deduced a trap composed of 72 places in 703 ms of which 2 ms to minimize.
[2024-06-01 23:08:31] [INFO ] Deduced a trap composed of 57 places in 403 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2607/2912 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2912 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2912 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:08:38] [INFO ] Deduced a trap composed of 134 places in 364 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2912 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2912 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2912/2912 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8423 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 9319ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 574 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 305 transition count 7808
Applied a total of 3 rules in 227 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7811 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 305/305 places, 7808/7811 transitions.
RANDOM walk for 40005 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188950 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188950 steps, saw 84710 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 23:08:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:08:43] [INFO ] Computed 3 invariants in 22 ms
[2024-06-01 23:08:43] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:08:44] [INFO ] Deduced a trap composed of 134 places in 439 ms of which 2 ms to minimize.
[2024-06-01 23:08:44] [INFO ] Deduced a trap composed of 85 places in 384 ms of which 2 ms to minimize.
[2024-06-01 23:08:45] [INFO ] Deduced a trap composed of 108 places in 447 ms of which 2 ms to minimize.
[2024-06-01 23:08:45] [INFO ] Deduced a trap composed of 122 places in 423 ms of which 2 ms to minimize.
[2024-06-01 23:08:45] [INFO ] Deduced a trap composed of 129 places in 430 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:08:46] [INFO ] Deduced a trap composed of 50 places in 541 ms of which 2 ms to minimize.
[2024-06-01 23:08:47] [INFO ] Deduced a trap composed of 75 places in 545 ms of which 2 ms to minimize.
[2024-06-01 23:08:47] [INFO ] Deduced a trap composed of 60 places in 514 ms of which 2 ms to minimize.
[2024-06-01 23:08:48] [INFO ] Deduced a trap composed of 130 places in 567 ms of which 2 ms to minimize.
[2024-06-01 23:08:48] [INFO ] Deduced a trap composed of 106 places in 422 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6960 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 7583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 331 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 194 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:08:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:08:51] [INFO ] Invariant cache hit.
[2024-06-01 23:08:52] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-06-01 23:08:52] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:08:52] [INFO ] Invariant cache hit.
[2024-06-01 23:08:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:09:07] [INFO ] Implicit Places using invariants and state equation in 15774 ms returned []
Implicit Place search using SMT with State Equation took 16391 ms to find 0 implicit places.
[2024-06-01 23:09:08] [INFO ] Redundant transitions in 886 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:09:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:09:08] [INFO ] Invariant cache hit.
[2024-06-01 23:09:08] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:10:10] [INFO ] Deduced a trap composed of 138 places in 369 ms of which 2 ms to minimize.
[2024-06-01 23:10:12] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 2 ms to minimize.
[2024-06-01 23:10:13] [INFO ] Deduced a trap composed of 49 places in 403 ms of which 2 ms to minimize.
[2024-06-01 23:10:13] [INFO ] Deduced a trap composed of 42 places in 321 ms of which 1 ms to minimize.
[2024-06-01 23:10:13] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 1 ms to minimize.
[2024-06-01 23:10:14] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 2 ms to minimize.
[2024-06-01 23:10:14] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 2 ms to minimize.
[2024-06-01 23:10:15] [INFO ] Deduced a trap composed of 57 places in 419 ms of which 2 ms to minimize.
[2024-06-01 23:10:15] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 2 ms to minimize.
[2024-06-01 23:10:15] [INFO ] Deduced a trap composed of 62 places in 429 ms of which 2 ms to minimize.
[2024-06-01 23:10:16] [INFO ] Deduced a trap composed of 70 places in 422 ms of which 2 ms to minimize.
[2024-06-01 23:10:16] [INFO ] Deduced a trap composed of 75 places in 436 ms of which 3 ms to minimize.
[2024-06-01 23:10:17] [INFO ] Deduced a trap composed of 102 places in 401 ms of which 5 ms to minimize.
[2024-06-01 23:10:17] [INFO ] Deduced a trap composed of 72 places in 264 ms of which 1 ms to minimize.
[2024-06-01 23:10:18] [INFO ] Deduced a trap composed of 101 places in 413 ms of which 2 ms to minimize.
[2024-06-01 23:10:18] [INFO ] Deduced a trap composed of 114 places in 386 ms of which 2 ms to minimize.
[2024-06-01 23:10:19] [INFO ] Deduced a trap composed of 78 places in 292 ms of which 2 ms to minimize.
[2024-06-01 23:10:19] [INFO ] Deduced a trap composed of 134 places in 242 ms of which 1 ms to minimize.
[2024-06-01 23:10:19] [INFO ] Deduced a trap composed of 137 places in 279 ms of which 2 ms to minimize.
[2024-06-01 23:10:19] [INFO ] Deduced a trap composed of 195 places in 260 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:10:24] [INFO ] Deduced a trap composed of 111 places in 331 ms of which 2 ms to minimize.
[2024-06-01 23:10:27] [INFO ] Deduced a trap composed of 195 places in 482 ms of which 2 ms to minimize.
[2024-06-01 23:10:28] [INFO ] Deduced a trap composed of 204 places in 464 ms of which 5 ms to minimize.
[2024-06-01 23:10:28] [INFO ] Deduced a trap composed of 209 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:10:29] [INFO ] Deduced a trap composed of 116 places in 446 ms of which 3 ms to minimize.
[2024-06-01 23:10:29] [INFO ] Deduced a trap composed of 136 places in 434 ms of which 2 ms to minimize.
[2024-06-01 23:10:30] [INFO ] Deduced a trap composed of 139 places in 434 ms of which 2 ms to minimize.
[2024-06-01 23:10:31] [INFO ] Deduced a trap composed of 208 places in 407 ms of which 1 ms to minimize.
[2024-06-01 23:10:32] [INFO ] Deduced a trap composed of 116 places in 346 ms of which 2 ms to minimize.
[2024-06-01 23:10:33] [INFO ] Deduced a trap composed of 146 places in 311 ms of which 2 ms to minimize.
[2024-06-01 23:10:33] [INFO ] Deduced a trap composed of 209 places in 298 ms of which 2 ms to minimize.
[2024-06-01 23:10:33] [INFO ] Deduced a trap composed of 208 places in 337 ms of which 1 ms to minimize.
[2024-06-01 23:10:34] [INFO ] Deduced a trap composed of 144 places in 225 ms of which 2 ms to minimize.
[2024-06-01 23:10:36] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 2 ms to minimize.
[2024-06-01 23:10:36] [INFO ] Deduced a trap composed of 77 places in 374 ms of which 4 ms to minimize.
SMT process timed out in 88092ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105715 ms. Remains : 305/305 places, 7808/7808 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5136 edges and 305 vertex of which 37 / 305 are part of one of the 3 SCC in 3 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 4072 transitions
Ensure Unique test removed 1307 transitions
Reduce isomorphic transitions removed 5379 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 270 transition count 2428
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 419 place count 270 transition count 2012
Applied a total of 419 rules in 237 ms. Remains 270 /305 variables (removed 35) and now considering 2012/7808 (removed 5796) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2012 rows 270 cols
[2024-06-01 23:10:37] [INFO ] Computed 3 invariants in 19 ms
[2024-06-01 23:10:37] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 23:10:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:10:37] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 23:10:37] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-06-01 23:10:37] [INFO ] After 148ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 23:10:37] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 23:10:37] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1021 ms.
[2024-06-01 23:10:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 23:10:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 38 ms.
[2024-06-01 23:10:38] [INFO ] Flatten gal took : 573 ms
Total runtime 138732 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 : Szymanski-PT-b06-ReachabilityCardinality-2023-02

BK_STOP 1717283439252

--------------------
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 Szymanski-PT-b06-ReachabilityCardinality-2023-02
rfs formula type EF
rfs formula formula --invariant=/tmp/730/inv_0_
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r536-tall-171690533300878"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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