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.r202-smll-171649587500118.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 HirschbergSinclair-PT-40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587500118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 13 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 580K May 18 16:42 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 HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716624785165

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 08:13:06] [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 08:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:13:07] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-25 08:13:07] [INFO ] Transformed 1068 places.
[2024-05-25 08:13:07] [INFO ] Transformed 982 transitions.
[2024-05-25 08:13:07] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 2966 ms. (13 steps per ms) remains 7/16 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-25 08:13:08] [INFO ] Flatten gal took : 489 ms
BEST_FIRST walk for 40004 steps (8 resets) in 954 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
[2024-05-25 08:13:09] [INFO ] Flatten gal took : 235 ms
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 7/7 properties
[2024-05-25 08:13:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16949437714961324451.gal : 123 ms
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
[2024-05-25 08:13:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6564237557493057755.prop : 3 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/ReachabilityCardinality16949437714961324451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6564237557493057755.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
BEST_FIRST walk for 40004 steps (8 resets) in 704 ms. (56 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality6564237557493057755.prop.
// Phase 1: matrix 982 rows 1068 cols
[2024-05-25 08:13:09] [INFO ] Computed 86 invariants in 50 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 6
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 68
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :68 after 75
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :75 after 179
At refinement iteration 1 (OVERLAPS) 748/922 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :179 after 2692
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2692 after 2.4705e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/922 variables, 1/60 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 63/985 variables, 21/81 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 54/1039 variables, 5/86 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1039 variables, 0/86 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 982/2021 variables, 1039/1125 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2021 variables, 0/1125 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 29/2050 variables, 29/1154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 1154 constraints, problems are : Problem set: 3 solved, 4 unsolved in 3379 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1068/1068 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 751/921 variables, 59/59 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/921 variables, 1/60 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 08:13:14] [INFO ] Deduced a trap composed of 19 places in 499 ms of which 71 ms to minimize.
[2024-05-25 08:13:14] [INFO ] Deduced a trap composed of 60 places in 385 ms of which 8 ms to minimize.
[2024-05-25 08:13:15] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 7 ms to minimize.
[2024-05-25 08:13:15] [INFO ] Deduced a trap composed of 97 places in 346 ms of which 7 ms to minimize.
[2024-05-25 08:13:15] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/921 variables, 5/65 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 08:13:16] [INFO ] Deduced a trap composed of 18 places in 373 ms of which 6 ms to minimize.
[2024-05-25 08:13:16] [INFO ] Deduced a trap composed of 104 places in 289 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 2/67 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 08:13:17] [INFO ] Deduced a trap composed of 103 places in 277 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 1/68 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 0/68 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 63/984 variables, 21/89 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 08:13:17] [INFO ] Deduced a trap composed of 15 places in 344 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 1/90 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/984 variables, 0/90 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 55/1039 variables, 5/95 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1039/2050 variables, and 95 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/1068 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 8697ms problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Graph (complete) has 2054 edges and 1068 vertex of which 1034 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1034 transition count 703
Reduce places removed 279 places and 0 transitions.
Graph (complete) has 1335 edges and 755 vertex of which 687 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.7 ms
Discarding 68 places :
Also discarding 0 output transitions
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 310 rules applied. Total rules applied 590 place count 687 transition count 673
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 688 place count 657 transition count 605
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 694 place count 651 transition count 599
Iterating global reduction 3 with 6 rules applied. Total rules applied 700 place count 651 transition count 599
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 705 place count 646 transition count 594
Iterating global reduction 3 with 5 rules applied. Total rules applied 710 place count 646 transition count 594
Free-agglomeration rule (complex) applied 53 times.
Iterating global reduction 3 with 53 rules applied. Total rules applied 763 place count 646 transition count 541
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 816 place count 593 transition count 541
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 839 place count 570 transition count 518
Applied a total of 839 rules in 469 ms. Remains 570 /1068 variables (removed 498) and now considering 518/982 (removed 464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 570/1068 places, 518/982 transitions.
RANDOM walk for 40000 steps (75 resets) in 1373 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 294 ms. (135 steps per ms) remains 2/3 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 254 ms. (156 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 518 rows 570 cols
[2024-05-25 08:13:19] [INFO ] Computed 52 invariants in 5 ms
[2024-05-25 08:13:19] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/472 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/475 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/538 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 506/1044 variables, 538/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1044 variables, 94/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1044 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/1080 variables, 27/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1083 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1083 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1083/1088 variables, and 714 constraints, problems are : Problem set: 0 solved, 1 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 46/47 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 567/570 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/472 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:20] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 4 ms to minimize.
[2024-05-25 08:13:20] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:20] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/475 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:21] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/538 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:21] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:21] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 506/1044 variables, 538/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 94/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:22] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1044 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1044 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/1080 variables, 27/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1080 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1080 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 08:13:23] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 5 ms to minimize.
[2024-05-25 08:13:23] [INFO ] Deduced a trap composed of 85 places in 197 ms of which 4 ms to minimize.
[2024-05-25 08:13:23] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 4 ms to minimize.
[2024-05-25 08:13:23] [INFO ] Deduced a trap composed of 120 places in 206 ms of which 4 ms to minimize.
[2024-05-25 08:13:24] [INFO ] Deduced a trap composed of 127 places in 183 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1080 variables, 5/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1080 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/1083 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1083 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1083 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1083 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1083/1088 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4328 ms.
Refiners :[Positive P Invariants (semi-flows): 46/47 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 567/570 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 5144ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 169 ms.
Support contains 49 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 518/518 transitions.
Graph (complete) has 1036 edges and 570 vertex of which 557 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 557 transition count 462
Reduce places removed 46 places and 0 transitions.
Graph (complete) has 919 edges and 511 vertex of which 503 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 106 place count 503 transition count 460
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 116 place count 501 transition count 452
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 498 transition count 449
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 498 transition count 449
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 498 transition count 448
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 904 edges and 497 vertex of which 495 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 495 transition count 448
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 495 transition count 446
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 494 transition count 445
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 494 transition count 445
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 139 place count 494 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 149 place count 484 transition count 435
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 161 place count 472 transition count 423
Applied a total of 161 rules in 198 ms. Remains 472 /570 variables (removed 98) and now considering 423/518 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 472/570 places, 423/518 transitions.
RANDOM walk for 40000 steps (92 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327462 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327462 steps, saw 83581 distinct states, run finished after 3008 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 423 rows 472 cols
[2024-05-25 08:13:28] [INFO ] Computed 49 invariants in 5 ms
[2024-05-25 08:13:28] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/460 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/881 variables, 460/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/881 variables, 12/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/881 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/895 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/895 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 895/895 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 472/472 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/460 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/881 variables, 460/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/881 variables, 12/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/881 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/895 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/895 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 895/895 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 472/472 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2296ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 49 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 423/423 transitions.
Applied a total of 0 rules in 21 ms. Remains 472 /472 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 472/472 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 423/423 transitions.
Applied a total of 0 rules in 28 ms. Remains 472 /472 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-05-25 08:13:30] [INFO ] Invariant cache hit.
[2024-05-25 08:13:31] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-25 08:13:31] [INFO ] Invariant cache hit.
[2024-05-25 08:13:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 08:13:34] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 3785 ms to find 0 implicit places.
[2024-05-25 08:13:34] [INFO ] Redundant transitions in 32 ms returned []
Running 406 sub problems to find dead transitions.
[2024-05-25 08:13:34] [INFO ] Invariant cache hit.
[2024-05-25 08:13:34] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 6/458 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 7/465 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 423/888 variables, 465/514 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 12/526 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 888/895 variables, and 526 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 465/472 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 6/458 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 7/465 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 423/888 variables, 465/514 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 12/526 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/888 variables, 406/932 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 888/895 variables, and 932 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 465/472 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64118 ms. Remains : 472/472 places, 423/423 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 460 transition count 197
Reduce places removed 226 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 231 rules applied. Total rules applied 469 place count 234 transition count 192
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 474 place count 229 transition count 192
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 474 place count 229 transition count 144
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 570 place count 181 transition count 144
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 571 place count 180 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 572 place count 179 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 179 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 577 place count 177 transition count 141
Applied a total of 577 rules in 73 ms. Remains 177 /472 variables (removed 295) and now considering 141/423 (removed 282) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 177 cols
[2024-05-25 08:14:34] [INFO ] Computed 36 invariants in 2 ms
[2024-05-25 08:14:35] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:14:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-05-25 08:14:35] [INFO ] [Nat]Absence check using 4 positive and 32 generalized place invariants in 42 ms returned sat
[2024-05-25 08:14:35] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 08:14:35] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:14:35] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:14:35] [INFO ] Flatten gal took : 19 ms
[2024-05-25 08:14:35] [INFO ] Flatten gal took : 12 ms
[2024-05-25 08:14:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2556776595989339018.gal : 3 ms
[2024-05-25 08:14:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1893552197507300334.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/ReachabilityCardinality2556776595989339018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1893552197507300334.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/ReachabilityCardinality1893552197507300334.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 288
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 5184
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5184 after 497664
Detected timeout of ITS tools.
[2024-05-25 08:14:50] [INFO ] Flatten gal took : 23 ms
[2024-05-25 08:14:50] [INFO ] Applying decomposition
[2024-05-25 08:14:50] [INFO ] Flatten gal took : 11 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/graph16697249852994760623.txt' '-o' '/tmp/graph16697249852994760623.bin' '-w' '/tmp/graph16697249852994760623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16697249852994760623.bin' '-l' '-1' '-v' '-w' '/tmp/graph16697249852994760623.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:14:50] [INFO ] Decomposing Gal with order
[2024-05-25 08:14:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:14:50] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-25 08:14:50] [INFO ] Flatten gal took : 75 ms
[2024-05-25 08:14:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-25 08:14:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14539048573358508302.gal : 6 ms
[2024-05-25 08:14:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7243008601123300032.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/ReachabilityCardinality14539048573358508302.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7243008601123300032.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/ReachabilityCardinality7243008601123300032.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 36
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 288
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :288 after 5184
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5184 after 995328
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31257 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 08:15:06] [INFO ] Flatten gal took : 81 ms
[2024-05-25 08:15:06] [INFO ] Applying decomposition
[2024-05-25 08:15:06] [INFO ] Flatten gal took : 69 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/graph7813374211689774409.txt' '-o' '/tmp/graph7813374211689774409.bin' '-w' '/tmp/graph7813374211689774409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7813374211689774409.bin' '-l' '-1' '-v' '-w' '/tmp/graph7813374211689774409.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:15:06] [INFO ] Decomposing Gal with order
[2024-05-25 08:15:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:15:06] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-25 08:15:06] [INFO ] Flatten gal took : 154 ms
[2024-05-25 08:15:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 26 ms.
[2024-05-25 08:15:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13743129579640947213.gal : 29 ms
[2024-05-25 08:15:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7544908403281624649.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/ReachabilityCardinality13743129579640947213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7544908403281624649.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/ReachabilityCardinality7544908403281624649.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 58
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :58 after 1418
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1418 after 86693
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :86693 after 9.17151e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.17151e+08 after 1.98272e+18
Detected timeout of ITS tools.
[2024-05-25 08:45:06] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
[2024-05-25 08:45:06] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin7259355227605876701
[2024-05-25 08:45:07] [INFO ] Flatten gal took : 29 ms
[2024-05-25 08:45:07] [INFO ] Computing symmetric may disable matrix : 423 transitions.
[2024-05-25 08:45:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:45:07] [INFO ] Computing symmetric may enable matrix : 423 transitions.
[2024-05-25 08:45:07] [INFO ] Computation of Complete enable matrix. took 1 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/graph5794782164681893675.txt' '-o' '/tmp/graph5794782164681893675.bin' '-w' '/tmp/graph5794782164681893675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5794782164681893675.bin' '-l' '-1' '-v' '-w' '/tmp/graph5794782164681893675.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:45:07] [INFO ] Decomposing Gal with order
[2024-05-25 08:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:45:07] [INFO ] Computing Do-Not-Accords matrix : 423 transitions.
[2024-05-25 08:45:07] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-25 08:45:07] [INFO ] Flatten gal took : 46 ms
[2024-05-25 08:45:07] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 08:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 28 ms.
[2024-05-25 08:45:07] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7259355227605876701
Running compilation step : cd /tmp/ltsmin7259355227605876701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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 08:45:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6519827252762487846.gal : 42 ms
[2024-05-25 08:45:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2913681967623343706.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/ReachabilityCardinality6519827252762487846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2913681967623343706.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/ReachabilityCardinality2913681967623343706.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 39
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :39 after 156
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :156 after 5616
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5616 after 438048
Compilation finished in 2087 ms.
Running link step : cd /tmp/ltsmin7259355227605876701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7259355227605876701;'/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' 'HirschbergSinclairPT40ReachabilityCardinality202404==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :438048 after 2.60234e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.60234e+08 after 4.96746e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.96746e+08 after 2.49083e+10
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.269: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.288: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.294: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.305: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.305: Initializing POR dependencies: labels 424, guards 423
pins2lts-mc-linux64( 6/ 8), 0.297: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 4.302: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 4.451: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 4.451: There are 424 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 4.451: State length is 472, there are 423 groups
pins2lts-mc-linux64( 0/ 8), 4.451: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 4.451: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 4.451: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 4.451: Visible groups: 0 / 423, labels: 1 / 424
pins2lts-mc-linux64( 0/ 8), 4.451: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 4.451: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 4.451: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 4.443: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 4.453: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 4.444: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 4.444: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 4.444: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 4.446: "HirschbergSinclairPT40ReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 4.779: ~1 levels ~960 states ~16080 transitions
pins2lts-mc-linux64( 5/ 8), 5.098: ~1 levels ~1920 states ~32136 transitions
pins2lts-mc-linux64( 5/ 8), 5.562: ~2 levels ~3840 states ~63848 transitions
pins2lts-mc-linux64( 5/ 8), 6.231: ~2 levels ~7680 states ~127848 transitions
pins2lts-mc-linux64( 5/ 8), 7.512: ~3 levels ~15360 states ~253784 transitions
pins2lts-mc-linux64( 5/ 8), 9.717: ~3 levels ~30720 states ~506096 transitions
pins2lts-mc-linux64( 5/ 8), 13.874: ~4 levels ~61440 states ~999584 transitions
pins2lts-mc-linux64( 5/ 8), 22.051: ~5 levels ~122880 states ~1997640 transitions
pins2lts-mc-linux64( 5/ 8), 37.050: ~5 levels ~245760 states ~3973616 transitions
pins2lts-mc-linux64( 5/ 8), 63.045: ~6 levels ~491520 states ~7821080 transitions
pins2lts-mc-linux64( 7/ 8), 119.684: ~7 levels ~983040 states ~15101200 transitions
pins2lts-mc-linux64( 5/ 8), 230.545: ~7 levels ~1966080 states ~31236664 transitions
pins2lts-mc-linux64( 5/ 8), 434.343: ~8 levels ~3932160 states ~61335016 transitions
pins2lts-mc-linux64( 7/ 8), 882.535: ~9 levels ~7864320 states ~119541552 transitions
pins2lts-mc-linux64( 4/ 8), 942.479: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 942.612:
pins2lts-mc-linux64( 0/ 8), 942.612: mean standard work distribution: 2.0% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 942.612:
pins2lts-mc-linux64( 0/ 8), 942.612: Explored 8100553 states 127569148 transitions, fanout: 15.748
pins2lts-mc-linux64( 0/ 8), 942.612: Total exploration time 938.150 sec (938.030 sec minimum, 938.076 sec on average)
pins2lts-mc-linux64( 0/ 8), 942.612: States per second: 8635, Transitions per second: 135979
pins2lts-mc-linux64( 0/ 8), 942.612: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 942.613:
pins2lts-mc-linux64( 0/ 8), 942.613: Queue width: 8B, total height: 11969918, memory: 91.32MB
pins2lts-mc-linux64( 0/ 8), 942.613: Tree memory: 409.1MB, 21.4 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 942.613: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 942.613: Stored 425 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 942.613: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 942.613: Est. total memory use: 500.4MB (~1115.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7259355227605876701;'/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' 'HirschbergSinclairPT40ReachabilityCardinality202404==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7259355227605876701;'/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' 'HirschbergSinclairPT40ReachabilityCardinality202404==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:114)
at java.base/java.lang.Thread.run(Thread.java:840)
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.49083e+10 after 1.99769e+11

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//
++ 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 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="HirschbergSinclair-PT-40"
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 HirschbergSinclair-PT-40, 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 r202-smll-171649587500118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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