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

About the Execution of ITS-Tools for ResAllocation-PT-R020C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
578.863 20277.00 60486.00 98.70 TFTTTTTFTTFFTFFF 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.r312-tall-171662339500871.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 ResAllocation-PT-R020C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-ReachabilityFireability-2024-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716718681126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-26 10:18:02] [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-26 10:18:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:18:02] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-26 10:18:02] [INFO ] Transformed 80 places.
[2024-05-26 10:18:02] [INFO ] Transformed 42 transitions.
[2024-05-26 10:18:02] [INFO ] Found NUPN structural information;
[2024-05-26 10:18:02] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 10:18:02] [INFO ] Flatten gal took : 60 ms
[2024-05-26 10:18:02] [INFO ] Flatten gal took : 18 ms
[2024-05-26 10:18:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17327316879113239439.gal : 18 ms
[2024-05-26 10:18:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7266924845288544341.prop : 5 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/ReachabilityCardinality17327316879113239439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7266924845288544341.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality7266924845288544341.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :32 after 448
Invariant property ResAllocation-PT-R020C002-ReachabilityFireability-2024-13 does not hold.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ResAllocation-PT-R020C002-ReachabilityFireability-2024-12 is true.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :448 after 14336
RANDOM walk for 40000 steps (344 resets) in 1926 ms. (20 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (64 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (83 resets) in 770 ms. (51 steps per ms) remains 11/12 properties
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (64 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (31 resets) in 157 ms. (253 steps per ms) remains 9/11 properties
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (80 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (79 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
Invariant property ResAllocation-PT-R020C002-ReachabilityFireability-2024-01 does not hold.
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :14336 after 458752
BEST_FIRST walk for 40004 steps (43 resets) in 438 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (73 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (77 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (65 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
// Phase 1: matrix 42 rows 80 cols
[2024-05-26 10:18:04] [INFO ] Computed 40 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-07 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-14 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 40/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 42/122 variables, 80/200 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/122 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 200 constraints, problems are : Problem set: 2 solved, 7 unsolved in 386 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-09 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 39/118 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 8 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem ResAllocation-PT-R020C002-ReachabilityFireability-2024-04 is UNSAT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 6/124 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/124 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/125 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/126 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:18:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-26 10:18:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/129 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/129 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 42/122 variables, 80/209 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 5/214 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-26 10:18:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 1/215 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/215 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/215 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 215 constraints, problems are : Problem set: 4 solved, 5 unsolved in 709 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 10/10 constraints]
After SMT, in 1209ms problems are : Problem set: 4 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 900 ms.
Support contains 54 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 80/80 places, 42/42 transitions.
RANDOM walk for 40000 steps (343 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (79 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (77 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (77 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1060144 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 4
Probabilistic random walk after 1060144 steps, saw 238246 distinct states, run finished after 3004 ms. (steps per millisecond=352 ) properties seen :0
[2024-05-26 10:18:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 24/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/80 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 42/122 variables, 80/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 200 constraints, problems are : Problem set: 0 solved, 4 unsolved in 327 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 24/78 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/80 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 42/122 variables, 80/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 8 ms to minimize.
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/122 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/122 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/122 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/122 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/122 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 215 constraints, problems are : Problem set: 0 solved, 4 unsolved in 949 ms.
Refiners :[Domain max(s): 80/80 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 692 ms.
Support contains 54 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 80/80 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:18:11] [INFO ] Invariant cache hit.
[2024-05-26 10:18:11] [INFO ] Implicit Places using invariants in 97 ms returned [41, 49, 55, 61, 63, 69, 73, 75]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 114 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/80 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 119 ms. Remains : 72/80 places, 42/42 transitions.
RANDOM walk for 40000 steps (343 resets) in 176 ms. (225 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (79 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Reachability property ResAllocation-PT-R020C002-ReachabilityFireability-2024-03 is true.
Reachability property ResAllocation-PT-R020C002-ReachabilityFireability-2024-00 is true.
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :1.83501e+06 after 2.09715e+06
Interrupted probabilistic random walk after 1064145 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 4
Probabilistic random walk after 1064145 steps, saw 239651 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
// Phase 1: matrix 42 rows 72 cols
[2024-05-26 10:18:14] [INFO ] Computed 32 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/72 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 42/114 variables, 72/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 221 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/72 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 42/114 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 10:18:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/114 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 188 constraints, problems are : Problem set: 0 solved, 4 unsolved in 651 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 625 ms.
Support contains 54 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 72/72 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-26 10:18:16] [INFO ] Invariant cache hit.
[2024-05-26 10:18:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-26 10:18:16] [INFO ] Invariant cache hit.
[2024-05-26 10:18:16] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-26 10:18:16] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-26 10:18:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 31/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 4 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 7 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:18:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-26 10:18:18] [INFO ] Deduced a trap composed of 4 places in 718 ms of which 0 ms to minimize.
[2024-05-26 10:18:18] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-05-26 10:18:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-26 10:18:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:18:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 19/121 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 42/114 variables, 72/195 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 195 constraints, problems are : Problem set: 0 solved, 40 unsolved in 3539 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 31/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 19/121 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 42/114 variables, 72/195 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 40/235 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 235 constraints, problems are : Problem set: 0 solved, 40 unsolved in 969 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
After SMT, in 4515ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 4520ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4667 ms. Remains : 72/72 places, 42/42 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-26 10:18:21] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:18:21] [INFO ] Applying decomposition
[2024-05-26 10:18:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14842517142019744447.txt' '-o' '/tmp/graph14842517142019744447.bin' '-w' '/tmp/graph14842517142019744447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14842517142019744447.bin' '-l' '-1' '-v' '-w' '/tmp/graph14842517142019744447.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:18:21] [INFO ] Decomposing Gal with order
[2024-05-26 10:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:18:21] [INFO ] Flatten gal took : 30 ms
[2024-05-26 10:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:18:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12810667795896782688.gal : 3 ms
[2024-05-26 10:18:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11976294124234907294.prop : 1 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/ReachabilityCardinality12810667795896782688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11976294124234907294.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality11976294124234907294.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.15343e+07,0.02631,4616,80,7,2017,29,259,2806,18,32,0
Total reachable state count : 11534336

Verifying 4 reachability properties.
Invariant property ResAllocation-PT-R020C002-ReachabilityFireability-2024-02 is true.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R020C002-ReachabilityFireability-2024-02,0,0.027704,4932,1,0,2017,29,293,2806,23,32,186
Invariant property ResAllocation-PT-R020C002-ReachabilityFireability-2024-05 is true.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R020C002-ReachabilityFireability-2024-05,0,0.030349,4932,1,0,2017,29,397,2806,23,32,723
Reachability property ResAllocation-PT-R020C002-ReachabilityFireability-2024-11 does not hold.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ResAllocation-PT-R020C002-ReachabilityFireability-2024-11

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R020C002-ReachabilityFireability-2024-11,0,0.030665,4932,1,0,2017,29,413,2806,23,32,748
Reachability property ResAllocation-PT-R020C002-ReachabilityFireability-2024-15 does not hold.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ResAllocation-PT-R020C002-ReachabilityFireability-2024-15

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R020C002-ReachabilityFireability-2024-15,0,0.031483,4932,1,0,2017,29,443,2806,23,32,838
All properties solved without resorting to model-checking.
Total runtime 19129 ms.

BK_STOP 1716718701403

--------------------
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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r312-tall-171662339500871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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