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.r488-tall-171631133100646.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 DoubleLock-PT-p3s3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 DoubleLock-PT-p3s3-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2023-08
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717203268060

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:54:29] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-01 00:54:29] [INFO ] Transformed 306 places.
[2024-06-01 00:54:29] [INFO ] Transformed 3136 transitions.
[2024-06-01 00:54:29] [INFO ] Parsed PT model containing 306 places and 3136 transitions and 12672 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 68 places in 13 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40004 steps (382 resets) in 2177 ms. (18 steps per ms) remains 10/13 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (69 resets) in 426 ms. (93 steps per ms) remains 9/10 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (59 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (62 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 562 ms. (71 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 395 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (65 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (61 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (66 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
[2024-06-01 00:54:30] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2024-06-01 00:54:30] [INFO ] Computed 4 invariants in 42 ms
[2024-06-01 00:54:31] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-09 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-14 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 165/228 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2119/2347 variables, 228/232 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2347 variables, 143/375 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2347 variables, 0/375 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/2359 variables, 10/385 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2359 variables, 0/385 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2359 variables, 0/385 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2359/2359 variables, and 385 constraints, problems are : Problem set: 7 solved, 2 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 204/227 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 1/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-06-01 00:54:32] [INFO ] Deduced a trap composed of 126 places in 286 ms of which 25 ms to minimize.
[2024-06-01 00:54:33] [INFO ] Deduced a trap composed of 95 places in 279 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/6 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2118/2345 variables, 227/233 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2345 variables, 142/375 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2345 variables, 0/375 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/2359 variables, 11/386 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2359 variables, 1/387 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2359 variables, 2/389 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2359 variables, 0/389 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2359 variables, 0/389 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2359/2359 variables, and 389 constraints, problems are : Problem set: 7 solved, 2 unsolved in 3203 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 4884ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 23 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 237 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 139 ms. Remains 237 /238 variables (removed 1) and now considering 3008/3008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 237/238 places, 3008/3008 transitions.
RANDOM walk for 40006 steps (374 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (63 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 203504 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 203504 steps, saw 154956 distinct states, run finished after 3015 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 00:54:39] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 237 cols
[2024-06-01 00:54:39] [INFO ] Computed 3 invariants in 24 ms
[2024-06-01 00:54:39] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 203/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2118/2344 variables, 226/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2344 variables, 142/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2344 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/2358 variables, 11/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2358 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2358 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2358 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2358/2358 variables, and 383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, ReadFeed: 143/143 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 203/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:54:40] [INFO ] Deduced a trap composed of 87 places in 265 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2118/2344 variables, 226/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2344 variables, 142/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:54:41] [INFO ] Deduced a trap composed of 85 places in 256 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2344 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2344 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/2358 variables, 11/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2358 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2358 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:54:51] [INFO ] Deduced a trap composed of 106 places in 237 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2358 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2358 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2358 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2358/2358 variables, and 388 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 36314ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 23 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 3008/3008 transitions.
Applied a total of 0 rules in 60 ms. Remains 237 /237 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 237/237 places, 3008/3008 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 3008/3008 transitions.
Applied a total of 0 rules in 72 ms. Remains 237 /237 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2024-06-01 00:55:15] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-06-01 00:55:15] [INFO ] Invariant cache hit.
[2024-06-01 00:55:15] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 00:55:15] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-06-01 00:55:15] [INFO ] Invariant cache hit.
[2024-06-01 00:55:16] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-06-01 00:55:34] [INFO ] Implicit Places using invariants and state equation in 18808 ms returned []
Implicit Place search using SMT with State Equation took 19114 ms to find 0 implicit places.
[2024-06-01 00:55:34] [INFO ] Redundant transitions in 154 ms returned []
Running 3006 sub problems to find dead transitions.
[2024-06-01 00:55:34] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-06-01 00:55:34] [INFO ] Invariant cache hit.
[2024-06-01 00:55:34] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2358 variables, and 3 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/237 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2358 variables, and 3 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/237 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints]
After SMT, in 66931ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 66963ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86328 ms. Remains : 237/237 places, 3008/3008 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 887 transitions.
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 237 transition count 2121
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 887 place count 237 transition count 2116
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 897 place count 232 transition count 2116
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 1 with 2 rules applied. Total rules applied 899 place count 231 transition count 2115
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 900 place count 231 transition count 2114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 901 place count 230 transition count 2114
Applied a total of 901 rules in 110 ms. Remains 230 /237 variables (removed 7) and now considering 2114/3008 (removed 894) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2114 rows 230 cols
[2024-06-01 00:56:42] [INFO ] Computed 3 invariants in 18 ms
[2024-06-01 00:56:42] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:56:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:56:43] [INFO ] After 1009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:56:44] [INFO ] After 1886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:56:44] [INFO ] After 2559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2777 ms.
[2024-06-01 00:56:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 00:56:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 3008 transitions and 12128 arcs took 16 ms.
[2024-06-01 00:56:45] [INFO ] Flatten gal took : 222 ms
Total runtime 135841 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 : DoubleLock-PT-p3s3-ReachabilityCardinality-2024-00
Could not compute solution for formula : DoubleLock-PT-p3s3-ReachabilityCardinality-2023-08

BK_STOP 1717203405319

--------------------
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 DoubleLock-PT-p3s3-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/553/inv_0_
rfs formula name DoubleLock-PT-p3s3-ReachabilityCardinality-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/553/inv_1_
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="DoubleLock-PT-p3s3"
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 DoubleLock-PT-p3s3, 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 r488-tall-171631133100646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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