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

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2231.575 58614.00 146820.00 152.90 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.r246-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 itstools
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 r246-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 1716567372058

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 16:16:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 16:16:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:16:13] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-05-24 16:16:13] [INFO ] Transformed 4260 places.
[2024-05-24 16:16:13] [INFO ] Transformed 6027 transitions.
[2024-05-24 16:16:13] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 445 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 (956 resets) in 2773 ms. (14 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 559 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 699 ms. (57 steps per ms) remains 12/12 properties
[2024-05-24 16:16:15] [INFO ] Flatten gal took : 784 ms
BEST_FIRST walk for 40001 steps (244 resets) in 1337 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 340 ms. (117 steps per ms) remains 12/12 properties
[2024-05-24 16:16:15] [INFO ] Flatten gal took : 506 ms
BEST_FIRST walk for 40003 steps (244 resets) in 380 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (247 resets) in 585 ms. (68 steps per ms) remains 12/12 properties
[2024-05-24 16:16:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality291165480666994287.gal : 164 ms
[2024-05-24 16:16:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15362758406601218845.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality291165480666994287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15362758406601218845.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (244 resets) in 300 ms. (132 steps per ms) remains 12/12 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (244 resets) in 538 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 355 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (244 resets) in 340 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 286 ms. (139 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
[2024-05-24 16:16:16] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
Loading property file /tmp/ReachabilityCardinality15362758406601218845.prop.
[2024-05-24 16:16:16] [INFO ] Computed 497 invariants in 423 ms
[2024-05-24 16:16:16] [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 5039 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-24 16:16:23] [INFO ] Deduced a trap composed of 98 places in 566 ms of which 85 ms to minimize.
[2024-05-24 16:16:24] [INFO ] Deduced a trap composed of 177 places in 896 ms of which 24 ms to minimize.
[2024-05-24 16:16:24] [INFO ] Deduced a trap composed of 177 places in 435 ms of which 5 ms to minimize.
[2024-05-24 16:16:25] [INFO ] Deduced a trap composed of 128 places in 354 ms of which 4 ms to minimize.
[2024-05-24 16:16:26] [INFO ] Deduced a trap composed of 173 places in 703 ms of which 5 ms to minimize.
[2024-05-24 16:16:26] [INFO ] Deduced a trap composed of 50 places in 907 ms of which 4 ms to minimize.
[2024-05-24 16:16:27] [INFO ] Deduced a trap composed of 139 places in 307 ms of which 9 ms to minimize.
[2024-05-24 16:16:27] [INFO ] Deduced a trap composed of 173 places in 306 ms of which 7 ms to minimize.
SMT process timed out in 11137ms, After SMT, 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.24 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 7 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 2 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 1859 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 1881 ms. Remains : 1801/4260 places, 2999/6027 transitions.
RANDOM walk for 40000 steps (1332 resets) in 1142 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (264 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 58500 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 6
Probabilistic random walk after 58500 steps, saw 26719 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 16:16:33] [INFO ] Flow matrix only has 2625 transitions (discarded 374 similar events)
// Phase 1: matrix 2625 rows 1801 cols
[2024-05-24 16:16:33] [INFO ] Computed 469 invariants in 53 ms
[2024-05-24 16:16:33] [INFO ] State equation strengthened by 1037 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1184 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1184 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1184 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5/1189 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 520/1709 variables, 350/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
At refinement iteration 9 (INCLUDED_ONLY) 0/1709 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 8/1717 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1717 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 84/1801 variables, 84/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1801 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 14
At refinement iteration 14 (OVERLAPS) 2625/4426 variables, 1801/2270 constraints. Problems are: Problem set: 0 solved, 6 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
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :14 after 19
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, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4426 variables, 0/3307 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/4426 variables, 0/3307 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4426/4426 variables, and 3307 constraints, problems are : Problem set: 3 solved, 3 unsolved in 3127 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1105/1162 variables, 15/16 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 16:16:37] [INFO ] Deduced a trap composed of 420 places in 532 ms of which 7 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :19 after 38
[2024-05-24 16:16:38] [INFO ] Deduced a trap composed of 168 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:16:38] [INFO ] Deduced a trap composed of 452 places in 309 ms of which 5 ms to minimize.
[2024-05-24 16:16:38] [INFO ] Deduced a trap composed of 424 places in 329 ms of which 5 ms to minimize.
[2024-05-24 16:16:39] [INFO ] Deduced a trap composed of 197 places in 994 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1162 variables, 5/21 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 16:16:40] [INFO ] Deduced a trap composed of 218 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:16:40] [INFO ] Deduced a trap composed of 438 places in 373 ms of which 6 ms to minimize.
[2024-05-24 16:16:41] [INFO ] Deduced a trap composed of 227 places in 519 ms of which 7 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :38 after 72
[2024-05-24 16:16:41] [INFO ] Deduced a trap composed of 404 places in 377 ms of which 6 ms to minimize.
[2024-05-24 16:16:42] [INFO ] Deduced a trap composed of 406 places in 379 ms of which 5 ms to minimize.
[2024-05-24 16:16:42] [INFO ] Deduced a trap composed of 372 places in 402 ms of which 6 ms to minimize.
[2024-05-24 16:16:42] [INFO ] Deduced a trap composed of 407 places in 393 ms of which 6 ms to minimize.
[2024-05-24 16:16:43] [INFO ] Deduced a trap composed of 408 places in 383 ms of which 5 ms to minimize.
[2024-05-24 16:16:43] [INFO ] Deduced a trap composed of 443 places in 434 ms of which 5 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :72 after 110
[2024-05-24 16:16:44] [INFO ] Deduced a trap composed of 218 places in 500 ms of which 7 ms to minimize.
[2024-05-24 16:16:44] [INFO ] Deduced a trap composed of 332 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:16:45] [INFO ] Deduced a trap composed of 312 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:16:45] [INFO ] Deduced a trap composed of 285 places in 465 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1162 variables, 13/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1162 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/1163 variables, 1/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 538/1701 variables, 352/387 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 16:16:46] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 3 ms to minimize.
[2024-05-24 16:16:46] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 4 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 3 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 3 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 114 places in 218 ms of which 4 ms to minimize.
[2024-05-24 16:16:47] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 3 ms to minimize.
[2024-05-24 16:16:48] [INFO ] Deduced a trap composed of 111 places in 218 ms of which 4 ms to minimize.
[2024-05-24 16:16:49] [INFO ] Deduced a trap composed of 209 places in 904 ms of which 13 ms to minimize.
[2024-05-24 16:16:50] [INFO ] Deduced a trap composed of 374 places in 874 ms of which 10 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :110 after 396
[2024-05-24 16:16:51] [INFO ] Deduced a trap composed of 254 places in 891 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1701 variables, 11/398 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1701 variables, 0/398 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/1717 variables, 16/414 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 16:16:52] [INFO ] Deduced a trap composed of 267 places in 948 ms of which 11 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :396 after 417
[2024-05-24 16:16:53] [INFO ] Deduced a trap composed of 272 places in 981 ms of which 10 ms to minimize.
[2024-05-24 16:16:54] [INFO ] Deduced a trap composed of 245 places in 978 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1717 variables, 3/417 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1717 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 84/1801 variables, 84/501 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 16:16:55] [INFO ] Deduced a trap composed of 305 places in 1047 ms of which 11 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1801 variables, 1/502 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1801 variables, 0/502 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2625/4426 variables, 1801/2303 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :417 after 463
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 18 (INCLUDED_ONLY) 0/4426 variables, 1037/3340 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4426 variables, 2/3342 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4426 variables, 0/3342 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/4426 variables, 0/3342 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4426/4426 variables, and 3342 constraints, problems are : Problem set: 4 solved, 2 unsolved in 22657 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: 2/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 25970ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 10 out of 1801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1801/1801 places, 2999/2999 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1801 transition count 2984
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1786 transition count 2984
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 1786 transition count 2972
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 1774 transition count 2972
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 76 place count 1752 transition count 2920
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 1752 transition count 2920
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 1752 transition count 2919
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1751 transition count 2919
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 1740 transition count 2875
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 1740 transition count 2875
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 1737 transition count 2872
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 207 place count 1737 transition count 3453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 286 place count 1658 transition count 3453
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 292 place count 1652 transition count 3447
Iterating global reduction 3 with 6 rules applied. Total rules applied 298 place count 1652 transition count 3447
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 312 place count 1652 transition count 3447
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 321 place count 1643 transition count 3438
Iterating global reduction 3 with 9 rules applied. Total rules applied 330 place count 1643 transition count 3438
Applied a total of 330 rules in 767 ms. Remains 1643 /1801 variables (removed 158) and now considering 3438/2999 (removed -439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 1643/1801 places, 3438/2999 transitions.
RANDOM walk for 40000 steps (1577 resets) in 1365 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 62227 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62227 steps, saw 27709 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 16:17:03] [INFO ] Flow matrix only has 3040 transitions (discarded 398 similar events)
// Phase 1: matrix 3040 rows 1643 cols
[2024-05-24 16:17:03] [INFO ] Computed 469 invariants in 64 ms
[2024-05-24 16:17:04] [INFO ] State equation strengthened by 1634 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1014/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/1025 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/1520 variables, 337/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1520 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 24/1544 variables, 24/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 99/1643 variables, 99/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1643 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :463 after 501
At refinement iteration 11 (OVERLAPS) 3040/4683 variables, 1643/2112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4683 variables, 1634/3746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4683 variables, 0/3746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4683 variables, 0/3746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4683/4683 variables, and 3746 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1643/1643 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1014/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/1025 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 495/1520 variables, 337/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:17:06] [INFO ] Deduced a trap composed of 191 places in 932 ms of which 9 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :501 after 574
[2024-05-24 16:17:07] [INFO ] Deduced a trap composed of 172 places in 865 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1520 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/1544 variables, 24/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 99/1643 variables, 99/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1643 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3040/4683 variables, 1643/2114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4683 variables, 1634/3748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4683 variables, 2/3750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4683 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4683 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4683/4683 variables, and 3750 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4845 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1643/1643 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 6604ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 355 steps, including 66 resets, run visited all 1 properties in 6 ms. (steps per millisecond=59 )
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 42 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 57440 ms.

BK_STOP 1716567430672

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r246-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 ;