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-171654349000022.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000022
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716565938038

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
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:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 15:52:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:52:19] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2024-05-24 15:52:19] [INFO ] Transformed 4260 places.
[2024-05-24 15:52:19] [INFO ] Transformed 6027 transitions.
[2024-05-24 15:52:19] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (956 resets) in 2796 ms. (14 steps per ms) remains 15/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (24 resets) in 116 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 139 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 102 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 210 ms. (18 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 31789 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 15
Probabilistic random walk after 31789 steps, saw 15053 distinct states, run finished after 3005 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 15:52:24] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2024-05-24 15:52:24] [INFO ] Computed 497 invariants in 280 ms
[2024-05-24 15:52:24] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 695/930 variables, 9/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 34/964 variables, 32/42 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/964 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 2583/3547 variables, 247/289 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3547 variables, 0/289 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/3552 variables, 5/294 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3552 variables, 0/294 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 693/4245 variables, 188/482 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4245 variables, 0/482 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/4260 variables, 15/497 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4260 variables, 0/497 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5755/10015 variables, 4260/4757 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/10015 variables, 1634/6391 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/10015 variables, 0/6391 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/10015 variables, 0/6391 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10015/10015 variables, and 6391 constraints, problems are : Problem set: 13 solved, 2 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 451/451 constraints, State Equation: 4260/4260 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 698/743 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/1 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2293/3036 variables, 162/163 constraints. Problems are: Problem set: 13 solved, 2 unsolved
[2024-05-24 15:52:32] [INFO ] Deduced a trap composed of 50 places in 2390 ms of which 159 ms to minimize.
[2024-05-24 15:52:34] [INFO ] Deduced a trap composed of 385 places in 2335 ms of which 22 ms to minimize.
SMT process timed out in 10824ms, After SMT, problems are : Problem set: 13 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 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.16 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1065 transitions
Trivial Post-agglo rules discarded 1065 transitions
Performed 1065 trivial Post agglomeration. Transition count delta: 1065
Iterating post reduction 0 with 1065 rules applied. Total rules applied 1066 place count 4232 transition count 4962
Reduce places removed 1065 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 1074 rules applied. Total rules applied 2140 place count 3167 transition count 4953
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 2149 place count 3158 transition count 4953
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 2149 place count 3158 transition count 4817
Deduced a syphon composed of 136 places in 3 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 2421 place count 3022 transition count 4817
Discarding 929 places :
Symmetric choice reduction at 3 with 929 rule applications. Total rules 3350 place count 2093 transition count 3888
Iterating global reduction 3 with 929 rules applied. Total rules applied 4279 place count 2093 transition count 3888
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4279 place count 2093 transition count 3887
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 4281 place count 2092 transition count 3887
Discarding 210 places :
Symmetric choice reduction at 3 with 210 rule applications. Total rules 4491 place count 1882 transition count 3047
Iterating global reduction 3 with 210 rules applied. Total rules applied 4701 place count 1882 transition count 3047
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 4733 place count 1866 transition count 3031
Free-agglomeration rule (complex) applied 159 times.
Iterating global reduction 3 with 159 rules applied. Total rules applied 4892 place count 1866 transition count 3379
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 3 with 159 rules applied. Total rules applied 5051 place count 1707 transition count 3379
Partial Free-agglomeration rule applied 119 times.
Drop transitions (Partial Free agglomeration) removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 5170 place count 1707 transition count 3379
Applied a total of 5170 rules in 1482 ms. Remains 1707 /4260 variables (removed 2553) and now considering 3379/6027 (removed 2648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1492 ms. Remains : 1707/4260 places, 3379/6027 transitions.
RANDOM walk for 40000 steps (1516 resets) in 1045 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (272 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (272 resets) in 294 ms. (135 steps per ms) remains 1/2 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 15:52:36] [INFO ] Flow matrix only has 2997 transitions (discarded 382 similar events)
// Phase 1: matrix 2997 rows 1707 cols
[2024-05-24 15:52:36] [INFO ] Computed 469 invariants in 56 ms
[2024-05-24 15:52:37] [INFO ] State equation strengthened by 1511 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1034 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1034 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/1570 variables, 327/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1570 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/1598 variables, 28/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1598 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/1707 variables, 109/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1707 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2997/4704 variables, 1707/2176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4704 variables, 1511/3687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4704 variables, 0/3687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4704 variables, 0/3687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4704/4704 variables, and 3687 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1707/1707 constraints, ReadFeed: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1034 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1034 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 1570/4704 variables, and 332 constraints, problems are : Problem set: 1 solved, 0 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/33 constraints, Generalized P Invariants (flows): 327/436 constraints, State Equation: 0/1707 constraints, ReadFeed: 0/1511 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1930ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 19598 ms.
ITS solved all properties within timeout

BK_STOP 1716565958859

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="ReachabilityCardinality"
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 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 r245-tall-171654349000022"
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 [ "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 ;