fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654350700023
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1045.508 32469.00 56267.00 130.40 FFFTTTTTFFTTTTFT normal

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.r508-tall-171654350700023.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 MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717195255144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:40:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:40:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:40:56] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2024-05-31 22:40:56] [INFO ] Transformed 4260 places.
[2024-05-31 22:40:56] [INFO ] Transformed 6027 transitions.
[2024-05-31 22:40:56] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 464 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (954 resets) in 1695 ms. (23 steps per ms) remains 12/15 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (244 resets) in 451 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 420 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 933 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 228 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (247 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (244 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (244 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
[2024-05-31 22:40:58] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2024-05-31 22:40:59] [INFO ] Computed 497 invariants in 473 ms
[2024-05-31 22:40:59] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 649/1035 variables, 19/48 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1035 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 5/1040 variables, 5/58 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1040 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 2407/3447 variables, 228/286 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3447 variables, 0/286 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 813/4260 variables, 211/497 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4260 variables, 0/497 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10015/10015 variables, and 4757 constraints, problems are : Problem set: 6 solved, 6 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 451/451 constraints, State Equation: 4260/4260 constraints, ReadFeed: 0/1634 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 715/825 variables, 22/27 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-31 22:41:05] [INFO ] Deduced a trap composed of 98 places in 437 ms of which 48 ms to minimize.
[2024-05-31 22:41:05] [INFO ] Deduced a trap composed of 177 places in 383 ms of which 6 ms to minimize.
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 177 places in 435 ms of which 17 ms to minimize.
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 128 places in 276 ms of which 5 ms to minimize.
[2024-05-31 22:41:06] [INFO ] Deduced a trap composed of 173 places in 283 ms of which 5 ms to minimize.
[2024-05-31 22:41:07] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 4 ms to minimize.
[2024-05-31 22:41:07] [INFO ] Deduced a trap composed of 139 places in 264 ms of which 4 ms to minimize.
[2024-05-31 22:41:07] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 4 ms to minimize.
[2024-05-31 22:41:07] [INFO ] Deduced a trap composed of 215 places in 242 ms of which 4 ms to minimize.
[2024-05-31 22:41:08] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 5 ms to minimize.
[2024-05-31 22:41:08] [INFO ] Deduced a trap composed of 173 places in 258 ms of which 5 ms to minimize.
[2024-05-31 22:41:08] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 4 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 181 places in 252 ms of which 5 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 177 places in 254 ms of which 4 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 173 places in 259 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/10015 variables, and 42 constraints, problems are : Problem set: 6 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 26/46 constraints, Generalized P Invariants (flows): 1/451 constraints, State Equation: 0/4260 constraints, ReadFeed: 0/1634 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 15/15 constraints]
After SMT, in 11000ms problems are : Problem set: 6 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.18 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 968 transitions
Trivial Post-agglo rules discarded 968 transitions
Performed 968 trivial Post agglomeration. Transition count delta: 968
Iterating post reduction 0 with 968 rules applied. Total rules applied 969 place count 4232 transition count 5059
Reduce places removed 968 places and 0 transitions.
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Iterating post reduction 1 with 1071 rules applied. Total rules applied 2040 place count 3264 transition count 4956
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 2 with 103 rules applied. Total rules applied 2143 place count 3161 transition count 4956
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 2143 place count 3161 transition count 4833
Deduced a syphon composed of 123 places in 5 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 2389 place count 3038 transition count 4833
Discarding 922 places :
Symmetric choice reduction at 3 with 922 rule applications. Total rules 3311 place count 2116 transition count 3911
Iterating global reduction 3 with 922 rules applied. Total rules applied 4233 place count 2116 transition count 3911
Discarding 199 places :
Symmetric choice reduction at 3 with 199 rule applications. Total rules 4432 place count 1917 transition count 3115
Iterating global reduction 3 with 199 rules applied. Total rules applied 4631 place count 1917 transition count 3115
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 4659 place count 1903 transition count 3101
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 3 with 102 rules applied. Total rules applied 4761 place count 1903 transition count 2999
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 4863 place count 1801 transition count 2999
Partial Free-agglomeration rule applied 123 times.
Drop transitions (Partial Free agglomeration) removed 123 transitions
Iterating global reduction 4 with 123 rules applied. Total rules applied 4986 place count 1801 transition count 2999
Applied a total of 4986 rules in 1298 ms. Remains 1801 /4260 variables (removed 2459) and now considering 2999/6027 (removed 3028) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1307 ms. Remains : 1801/4260 places, 2999/6027 transitions.
RANDOM walk for 40000 steps (1335 resets) in 725 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 169 ms. (235 steps per ms) remains 4/6 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (264 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (264 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (264 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
[2024-05-31 22:41:11] [INFO ] Flow matrix only has 2625 transitions (discarded 374 similar events)
// Phase 1: matrix 2625 rows 1801 cols
[2024-05-31 22:41:11] [INFO ] Computed 469 invariants in 96 ms
[2024-05-31 22:41:11] [INFO ] State equation strengthened by 1037 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1183 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1183 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1183 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/1188 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1188 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 521/1709 variables, 350/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1709 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/1717 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1717 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 84/1801 variables, 84/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1801 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2625/4426 variables, 1801/2270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (INCLUDED_ONLY) 0/4426 variables, 1037/3307 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4426 variables, 0/3307 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4426 variables, 0/3307 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4426/4426 variables, and 3307 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1801/1801 constraints, ReadFeed: 1037/1037 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1110/1158 variables, 14/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-31 22:41:14] [INFO ] Deduced a trap composed of 380 places in 486 ms of which 7 ms to minimize.
[2024-05-31 22:41:14] [INFO ] Deduced a trap composed of 431 places in 466 ms of which 6 ms to minimize.
[2024-05-31 22:41:15] [INFO ] Deduced a trap composed of 168 places in 481 ms of which 6 ms to minimize.
[2024-05-31 22:41:15] [INFO ] Deduced a trap composed of 367 places in 469 ms of which 7 ms to minimize.
[2024-05-31 22:41:16] [INFO ] Deduced a trap composed of 411 places in 501 ms of which 6 ms to minimize.
[2024-05-31 22:41:17] [INFO ] Deduced a trap composed of 407 places in 470 ms of which 6 ms to minimize.
[2024-05-31 22:41:17] [INFO ] Deduced a trap composed of 398 places in 482 ms of which 6 ms to minimize.
[2024-05-31 22:41:17] [INFO ] Deduced a trap composed of 323 places in 457 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 8/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1158 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/1159 variables, 1/23 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1159 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 540/1699 variables, 352/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 6 places in 971 ms of which 11 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 181 places in 975 ms of which 11 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 213 places in 974 ms of which 11 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 215 places in 957 ms of which 11 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 193 places in 982 ms of which 11 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 299 places in 961 ms of which 13 ms to minimize.
[2024-05-31 22:41:25] [INFO ] Deduced a trap composed of 289 places in 935 ms of which 10 ms to minimize.
[2024-05-31 22:41:25] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1699 variables, 9/384 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1699 variables, 0/384 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/1717 variables, 18/402 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1717 variables, 0/402 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/1801 variables, 84/486 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1801 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2625/4426 variables, 1801/2287 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 4426/4426 variables, and 3324 constraints, problems are : Problem set: 4 solved, 0 unsolved in 13690 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1801/1801 constraints, ReadFeed: 1037/1037 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 15856ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 31273 ms.
ITS solved all properties within timeout

BK_STOP 1717195287613

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

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

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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="ReachabilityFireability"
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 MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350700023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;