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.r268-smll-171654406700006.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 PaceMaker-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406700006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 5.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 158K 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 PaceMaker-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716650058120

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PaceMaker-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 15:14:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:14:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:14:21] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-25 15:14:21] [INFO ] Transformed 70 places.
[2024-05-25 15:14:21] [INFO ] Transformed 164 transitions.
[2024-05-25 15:14:21] [INFO ] Parsed PT model containing 70 places and 164 transitions and 954 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 15:14:22] [INFO ] Flatten gal took : 166 ms
[2024-05-25 15:14:22] [INFO ] Flatten gal took : 77 ms
[2024-05-25 15:14:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality396884985635546733.gal : 38 ms
[2024-05-25 15:14:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11461434014120721883.prop : 9 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/ReachabilityCardinality396884985635546733.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11461434014120721883.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 3781 ms. (10 steps per ms) remains 15/16 properties

its-reach command run as :
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

/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 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
Loading property file /tmp/ReachabilityCardinality11461434014120721883.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 42
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :96 after 222
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :222 after 4040
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4040 after 5540
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :5540 after 74544
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 183 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 93243 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 15
Probabilistic random walk after 93243 steps, saw 72960 distinct states, run finished after 3008 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-25 15:14:25] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2024-05-25 15:14:25] [INFO ] Computed 35 invariants in 15 ms
[2024-05-25 15:14:25] [INFO ] State equation strengthened by 131 read => feed constraints.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 35/35 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 158/228 variables, 70/105 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 131/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/228 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 236 constraints, problems are : Problem set: 4 solved, 11 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 70/70 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 32/32 constraints. Problems are: Problem set: 4 solved, 11 unsolved
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 70 ms of which 18 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 2 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 36 ms of which 6 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 2 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 36 ms of which 1 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-25 15:14:27] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:14:28] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:14:28] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:14:28] [INFO ] Deduced a trap composed of 1 places in 45 ms of which 1 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 14/46 constraints. Problems are: Problem set: 7 solved, 8 unsolved
[2024-05-25 15:14:28] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/47 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/70 variables, 3/50 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 7 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 158/228 variables, 70/120 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 131/251 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 6/257 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/257 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/257 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 228/228 variables, and 257 constraints, problems are : Problem set: 9 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 70/70 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 6/15 constraints, Known Traps: 15/15 constraints]
After SMT, in 6535ms problems are : Problem set: 9 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 68 transition count 163
Applied a total of 3 rules in 57 ms. Remains 68 /70 variables (removed 2) and now considering 163/164 (removed 1) transitions.
Running 152 sub problems to find dead transitions.
[2024-05-25 15:14:32] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
Normalized transition count is 92 out of 157 initially.
// Phase 1: matrix 92 rows 68 cols
[2024-05-25 15:14:32] [INFO ] Computed 34 invariants in 7 ms
[2024-05-25 15:14:32] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 152 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Invariant property PaceMaker-PT-none-ReachabilityCardinality-2024-06 does not hold.
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 385 constraints, problems are : Problem set: 0 solved, 152 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 24038ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 24048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24148 ms. Remains : 68/70 places, 163/164 transitions.
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 171879 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 171879 steps, saw 131398 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-25 15:14:59] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-05-25 15:14:59] [INFO ] Invariant cache hit.
[2024-05-25 15:14:59] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 13/56 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 133/189 variables, 56/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 89/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/213 variables, 8/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 34/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/216 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/225 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 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/43 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 0 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 35 ms of which 4 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 15:15:00] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 13/56 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 133/189 variables, 56/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 89/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 24/213 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 34/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 15:15:01] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 0 ms to minimize.
[2024-05-25 15:15:01] [INFO ] Deduced a trap composed of 1 places in 14 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/216 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 9/225 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/225 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 15:15:01] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/225 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/225 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 250 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1907 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 2306ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :74544 after 2.27224e+08
Parikh walk visited 0 properties in 30002 ms.
Support contains 43 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 163/163 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 68/68 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 163/163 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-25 15:15:32] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-05-25 15:15:32] [INFO ] Invariant cache hit.
[2024-05-25 15:15:32] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 15:15:32] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-05-25 15:15:32] [INFO ] Invariant cache hit.
[2024-05-25 15:15:32] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-25 15:15:32] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-25 15:15:32] [INFO ] Redundant transitions in 6 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-25 15:15:32] [INFO ] Flow matrix only has 157 transitions (discarded 6 similar events)
[2024-05-25 15:15:32] [INFO ] Invariant cache hit.
[2024-05-25 15:15:32] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 0/225 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 233 constraints, problems are : Problem set: 0 solved, 152 unsolved in 3965 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 157/225 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 131/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 152/385 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 385 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 68/68 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 34037ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 34040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34324 ms. Remains : 68/68 places, 163/163 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 242 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 64 transition count 150
Applied a total of 5 rules in 32 ms. Remains 64 /68 variables (removed 4) and now considering 150/163 (removed 13) transitions.
Running SMT prover for 4 properties.
[2024-05-25 15:16:06] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
Normalized transition count is 88 out of 149 initially.
// Phase 1: matrix 88 rows 64 cols
[2024-05-25 15:16:06] [INFO ] Computed 32 invariants in 3 ms
[2024-05-25 15:16:06] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:16:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2024-05-25 15:16:07] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:16:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-25 15:16:07] [INFO ] After 657ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 1 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 1 places in 14 ms of which 0 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 138 ms
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 7 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-05-25 15:16:08] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
[2024-05-25 15:16:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-25 15:16:09] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
[2024-05-25 15:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 2
[2024-05-25 15:16:09] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 3
[2024-05-25 15:16:09] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
[2024-05-25 15:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
TRAPS : Iteration 4
[2024-05-25 15:16:10] [INFO ] After 3176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-25 15:16:11] [INFO ] After 5035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-25 15:16:11] [INFO ] Flatten gal took : 51 ms
[2024-05-25 15:16:11] [INFO ] Flatten gal took : 30 ms
[2024-05-25 15:16:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16223464703486177361.gal : 20 ms
[2024-05-25 15:16:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14892101869956822139.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/ReachabilityCardinality16223464703486177361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14892101869956822139.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 ...330
Loading property file /tmp/ReachabilityCardinality14892101869956822139.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 40
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :40 after 48960
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :48960 after 1.41312e+06
Detected timeout of ITS tools.
[2024-05-25 15:16:26] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:16:26] [INFO ] Applying decomposition
[2024-05-25 15:16:26] [INFO ] Flatten gal took : 12 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/graph13117161238860443081.txt' '-o' '/tmp/graph13117161238860443081.bin' '-w' '/tmp/graph13117161238860443081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13117161238860443081.bin' '-l' '-1' '-v' '-w' '/tmp/graph13117161238860443081.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:16:27] [INFO ] Decomposing Gal with order
[2024-05-25 15:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:16:27] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-25 15:16:27] [INFO ] Flatten gal took : 86 ms
[2024-05-25 15:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2024-05-25 15:16:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9288107745932507344.gal : 7 ms
[2024-05-25 15:16:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5724883159806422699.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/ReachabilityCardinality9288107745932507344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5724883159806422699.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 ...328
Loading property file /tmp/ReachabilityCardinality5724883159806422699.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 192
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :192 after 1344
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1344 after 3.38688e+06
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3.38688e+06 after 2.05471e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35787 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 15:16:42] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:16:42] [INFO ] Applying decomposition
[2024-05-25 15:16:42] [INFO ] Flatten gal took : 17 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/graph6797122495552149153.txt' '-o' '/tmp/graph6797122495552149153.bin' '-w' '/tmp/graph6797122495552149153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6797122495552149153.bin' '-l' '-1' '-v' '-w' '/tmp/graph6797122495552149153.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:16:42] [INFO ] Decomposing Gal with order
[2024-05-25 15:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:16:42] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-25 15:16:42] [INFO ] Flatten gal took : 43 ms
[2024-05-25 15:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-25 15:16:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7912810060587783571.gal : 6 ms
[2024-05-25 15:16:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16679696861505942314.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/ReachabilityCardinality7912810060587783571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16679696861505942314.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/ReachabilityCardinality16679696861505942314.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 24
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :24 after 267
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :267 after 1152
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1152 after 55296
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :55296 after 765504
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :765504 after 5.3519e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.3519e+06 after 1.66971e+07
Detected timeout of ITS tools.
[2024-05-25 15:46:42] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17767787748539814587
[2024-05-25 15:46:42] [INFO ] Applying decomposition
[2024-05-25 15:46:42] [INFO ] Computing symmetric may disable matrix : 163 transitions.
[2024-05-25 15:46:42] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:46:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:46:42] [INFO ] Computing symmetric may enable matrix : 163 transitions.
[2024-05-25 15:46:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13825678804402349279.txt' '-o' '/tmp/graph13825678804402349279.bin' '-w' '/tmp/graph13825678804402349279.weights'
[2024-05-25 15:46:42] [INFO ] Computing Do-Not-Accords matrix : 163 transitions.
[2024-05-25 15:46:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13825678804402349279.bin' '-l' '-1' '-v' '-w' '/tmp/graph13825678804402349279.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:46:42] [INFO ] Decomposing Gal with order
[2024-05-25 15:46:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:46:42] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17767787748539814587
Running compilation step : cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 15:46:42] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-25 15:46:42] [INFO ] Flatten gal took : 31 ms
[2024-05-25 15:46:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-25 15:46:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4194062911550886237.gal : 4 ms
[2024-05-25 15:46:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15759205914872145122.prop : 0 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/ReachabilityCardinality4194062911550886237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15759205914872145122.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/ReachabilityCardinality15759205914872145122.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 256
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :256 after 2048
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2048 after 9856
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :9856 after 394752
Compilation finished in 1012 ms.
Running link step : cd /tmp/ltsmin17767787748539814587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :394752 after 1.95533e+06
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.95533e+06 after 1.12899e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.12899e+07 after 2.56673e+08
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202408==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202410==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: Initializing POR dependencies: labels 167, guards 163
pins2lts-mc-linux64( 3/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.207: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 0.223: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.223: There are 167 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.223: State length is 68, there are 163 groups
pins2lts-mc-linux64( 0/ 8), 0.223: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.223: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.223: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.223: Visible groups: 0 / 163, labels: 1 / 167
pins2lts-mc-linux64( 0/ 8), 0.223: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.223: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.221: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.221: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.221: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.221: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.222: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.224: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.223: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.424: ~4 levels ~960 states ~10120 transitions
pins2lts-mc-linux64( 7/ 8), 0.537: ~5 levels ~1920 states ~16008 transitions
pins2lts-mc-linux64( 7/ 8), 0.749: ~5 levels ~3840 states ~33752 transitions
pins2lts-mc-linux64( 7/ 8), 1.070: ~6 levels ~7680 states ~69176 transitions
pins2lts-mc-linux64( 7/ 8), 1.709: ~7 levels ~15360 states ~138224 transitions
pins2lts-mc-linux64( 7/ 8), 2.926: ~7 levels ~30720 states ~285416 transitions
pins2lts-mc-linux64( 5/ 8), 4.880: ~6 levels ~61440 states ~664744 transitions
pins2lts-mc-linux64( 7/ 8), 8.494: ~9 levels ~122880 states ~1186792 transitions
pins2lts-mc-linux64( 7/ 8), 15.248: ~9 levels ~245760 states ~2456744 transitions
pins2lts-mc-linux64( 7/ 8), 26.929: ~10 levels ~491520 states ~4927744 transitions
pins2lts-mc-linux64( 7/ 8), 52.183: ~11 levels ~983040 states ~10282784 transitions
pins2lts-mc-linux64( 7/ 8), 101.189: ~12 levels ~1966080 states ~21117040 transitions
pins2lts-mc-linux64( 7/ 8), 205.051: ~13 levels ~3932160 states ~43489512 transitions
pins2lts-mc-linux64( 7/ 8), 415.883: ~14 levels ~7864320 states ~89364392 transitions
pins2lts-mc-linux64( 0/ 8), 603.285: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 603.403:
pins2lts-mc-linux64( 0/ 8), 603.403: mean standard work distribution: 6.3% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 603.403:
pins2lts-mc-linux64( 0/ 8), 603.403: Explored 10152539 states 127248502 transitions, fanout: 12.534
pins2lts-mc-linux64( 0/ 8), 603.404: Total exploration time 603.180 sec (603.060 sec minimum, 603.119 sec on average)
pins2lts-mc-linux64( 0/ 8), 603.404: States per second: 16832, Transitions per second: 210963
pins2lts-mc-linux64( 0/ 8), 603.404: Ignoring proviso: 3193605
pins2lts-mc-linux64( 0/ 8), 603.404:
pins2lts-mc-linux64( 0/ 8), 603.404: Queue width: 8B, total height: 12082714, memory: 92.18MB
pins2lts-mc-linux64( 0/ 8), 603.404: Tree memory: 425.6MB, 20.1 B/state, compr.: 7.3%
pins2lts-mc-linux64( 0/ 8), 603.404: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 603.404: Stored 163 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 603.404: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 603.404: Est. total memory use: 517.8MB (~1116.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17767787748539814587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="PaceMaker-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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 PaceMaker-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406700006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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