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

About the Execution of GreatSPN+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
1008.119 38372.00 62255.00 164.00 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.r245-tall-171654349000023.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 greatspnxred
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 r245-tall-171654349000023
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 15:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:52:51] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2024-05-24 15:52:51] [INFO ] Transformed 4260 places.
[2024-05-24 15:52:51] [INFO ] Transformed 6027 transitions.
[2024-05-24 15:52:51] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 506 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 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 (956 resets) in 2120 ms. (18 steps per ms) remains 10/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-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-01 FALSE 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 696 ms. (57 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (245 resets) in 934 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (244 resets) in 305 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (247 resets) in 446 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (244 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (244 resets) in 346 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (244 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (244 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (244 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (245 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
[2024-05-24 15:52:53] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2024-05-24 15:52:54] [INFO ] Computed 497 invariants in 339 ms
[2024-05-24 15:52:54] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 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/1032 variables, 19/48 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 5/1037 variables, 5/58 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1037 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 9 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) 2410/3447 variables, 228/286 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3447 variables, 0/286 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 813/4260 variables, 211/497 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4260 variables, 0/497 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5755/10015 variables, 4260/4757 constraints. Problems are: Problem set: 6 solved, 4 unsolved
SMT process timed out in 5880ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 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.19 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 977 transitions
Trivial Post-agglo rules discarded 977 transitions
Performed 977 trivial Post agglomeration. Transition count delta: 977
Iterating post reduction 0 with 977 rules applied. Total rules applied 978 place count 4232 transition count 5050
Reduce places removed 977 places and 0 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 1 with 1073 rules applied. Total rules applied 2051 place count 3255 transition count 4954
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 2147 place count 3159 transition count 4954
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 2147 place count 3159 transition count 4830
Deduced a syphon composed of 124 places in 8 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 2395 place count 3035 transition count 4830
Discarding 925 places :
Symmetric choice reduction at 3 with 925 rule applications. Total rules 3320 place count 2110 transition count 3905
Iterating global reduction 3 with 925 rules applied. Total rules applied 4245 place count 2110 transition count 3905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4245 place count 2110 transition count 3904
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4247 place count 2109 transition count 3904
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 4449 place count 1907 transition count 3096
Iterating global reduction 3 with 202 rules applied. Total rules applied 4651 place count 1907 transition count 3096
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 4679 place count 1893 transition count 3082
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 3 with 102 rules applied. Total rules applied 4781 place count 1893 transition count 2980
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 4883 place count 1791 transition count 2980
Partial Free-agglomeration rule applied 107 times.
Drop transitions (Partial Free agglomeration) removed 107 transitions
Iterating global reduction 4 with 107 rules applied. Total rules applied 4990 place count 1791 transition count 2980
Applied a total of 4990 rules in 1485 ms. Remains 1791 /4260 variables (removed 2469) and now considering 2980/6027 (removed 3047) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1498 ms. Remains : 1791/4260 places, 2980/6027 transitions.
RANDOM walk for 40000 steps (1332 resets) in 912 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (264 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (264 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (264 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (264 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 57774 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 4
Probabilistic random walk after 57774 steps, saw 26396 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 15:53:04] [INFO ] Flow matrix only has 2606 transitions (discarded 374 similar events)
// Phase 1: matrix 2606 rows 1791 cols
[2024-05-24 15:53:04] [INFO ] Computed 469 invariants in 43 ms
[2024-05-24 15:53:04] [INFO ] State equation strengthened by 1028 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) 1097/1200 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1200 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/1205 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1205 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 524/1729 variables, 382/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1729 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/1737 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 54/1791 variables, 54/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1791 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2606/4397 variables, 1791/2260 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/4397 variables, 1028/3288 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4397 variables, 0/3288 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4397 variables, 0/3288 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4397/4397 variables, and 3288 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 438/438 constraints, State Equation: 1791/1791 constraints, ReadFeed: 1028/1028 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) 1123/1171 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:53:07] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1171 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1171 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/1172 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1172 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 546/1718 variables, 383/397 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:53:08] [INFO ] Deduced a trap composed of 6 places in 1072 ms of which 21 ms to minimize.
[2024-05-24 15:53:09] [INFO ] Deduced a trap composed of 41 places in 1065 ms of which 12 ms to minimize.
[2024-05-24 15:53:10] [INFO ] Deduced a trap composed of 71 places in 1039 ms of which 11 ms to minimize.
[2024-05-24 15:53:11] [INFO ] Deduced a trap composed of 228 places in 1001 ms of which 11 ms to minimize.
[2024-05-24 15:53:12] [INFO ] Deduced a trap composed of 263 places in 981 ms of which 11 ms to minimize.
[2024-05-24 15:53:13] [INFO ] Deduced a trap composed of 276 places in 985 ms of which 11 ms to minimize.
[2024-05-24 15:53:14] [INFO ] Deduced a trap composed of 254 places in 997 ms of which 12 ms to minimize.
[2024-05-24 15:53:15] [INFO ] Deduced a trap composed of 277 places in 960 ms of which 11 ms to minimize.
[2024-05-24 15:53:16] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 3 ms to minimize.
[2024-05-24 15:53:17] [INFO ] Deduced a trap composed of 198 places in 971 ms of which 11 ms to minimize.
[2024-05-24 15:53:17] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-05-24 15:53:18] [INFO ] Deduced a trap composed of 283 places in 1014 ms of which 11 ms to minimize.
[2024-05-24 15:53:19] [INFO ] Deduced a trap composed of 293 places in 976 ms of which 12 ms to minimize.
[2024-05-24 15:53:20] [INFO ] Deduced a trap composed of 193 places in 970 ms of which 11 ms to minimize.
[2024-05-24 15:53:21] [INFO ] Deduced a trap composed of 100 places in 955 ms of which 10 ms to minimize.
[2024-05-24 15:53:22] [INFO ] Deduced a trap composed of 315 places in 994 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1718 variables, 16/413 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 0/413 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/1736 variables, 18/431 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1736 variables, 0/431 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/1791 variables, 55/486 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:53:23] [INFO ] Deduced a trap composed of 295 places in 1028 ms of which 12 ms to minimize.
[2024-05-24 15:53:24] [INFO ] Deduced a trap composed of 334 places in 1031 ms of which 10 ms to minimize.
[2024-05-24 15:53:25] [INFO ] Deduced a trap composed of 314 places in 1033 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1791 variables, 3/489 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1791 variables, 0/489 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2606/4397 variables, 1791/2280 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 4397/4397 variables, and 3308 constraints, problems are : Problem set: 4 solved, 0 unsolved in 21497 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 438/438 constraints, State Equation: 1791/1791 constraints, ReadFeed: 1028/1028 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 20/20 constraints]
After SMT, in 23701ms 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 37097 ms.
ITS solved all properties within timeout

BK_STOP 1716566008611

--------------------
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="greatspnxred"
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 greatspnxred"
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 r245-tall-171654349000023"
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 ;