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.r356-tall-171683760300063.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 ShieldIIPs-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 66K 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 ShieldIIPs-PT-004B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716883619183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 08:07:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 08:07:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:07:00] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-28 08:07:00] [INFO ] Transformed 243 places.
[2024-05-28 08:07:00] [INFO ] Transformed 239 transitions.
[2024-05-28 08:07:00] [INFO ] Found NUPN structural information;
[2024-05-28 08:07:00] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 08:07:00] [INFO ] Flatten gal took : 97 ms
[2024-05-28 08:07:01] [INFO ] Flatten gal took : 49 ms
[2024-05-28 08:07:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11280850385576203874.gal : 19 ms
[2024-05-28 08:07:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8648595873839328639.prop : 4 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/ReachabilityCardinality11280850385576203874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8648595873839328639.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
RANDOM walk for 40000 steps (69 resets) in 1516 ms. (26 steps per ms) remains 5/16 properties
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality8648595873839328639.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :13 after 112
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :112 after 1137
BEST_FIRST walk for 40002 steps (9 resets) in 599 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 409 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1030 ms. (38 steps per ms) remains 5/5 properties
// Phase 1: matrix 239 rows 243 cols
[2024-05-28 08:07:01] [INFO ] Computed 37 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 133/243 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 133/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 239/482 variables, 243/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 523 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1040 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1137 after 641848
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 133/243 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 133/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 08:07:03] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 15 ms to minimize.
Problem ShieldIIPs-PT-004B-ReachabilityFireability-2024-01 is UNSAT
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 3 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 6 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 20 ms to minimize.
[2024-05-28 08:07:04] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-28 08:07:05] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-28 08:07:05] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-28 08:07:05] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 15/295 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 08:07:05] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/296 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 239/482 variables, 243/539 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 4/543 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 08:07:05] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 1/544 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 08:07:06] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 1/545 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 08:07:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 08:07:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 2/547 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 08:07:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 1/548 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/482 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 548 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4174 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 21/21 constraints]
After SMT, in 5338ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 3799 ms.
Support contains 95 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 239/239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 243 transition count 235
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 239 transition count 231
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 235 transition count 231
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 16 place count 235 transition count 221
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 36 place count 225 transition count 221
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 49 place count 212 transition count 208
Iterating global reduction 3 with 13 rules applied. Total rules applied 62 place count 212 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 212 transition count 207
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 211 transition count 207
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 114 place count 186 transition count 182
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 186 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 185 transition count 181
Applied a total of 121 rules in 72 ms. Remains 185 /243 variables (removed 58) and now considering 181/239 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 185/243 places, 181/239 transitions.
RANDOM walk for 40000 steps (75 resets) in 437 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 274 ms. (145 steps per ms) remains 3/4 properties
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 96 ms. (412 steps per ms) remains 2/3 properties
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (9 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
// Phase 1: matrix 181 rows 185 cols
[2024-05-28 08:07:11] [INFO ] Computed 37 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/183 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/185 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 181/366 variables, 185/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/183 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 08:07:11] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2024-05-28 08:07:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-28 08:07:11] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:07:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 08:07:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/185 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 181/366 variables, 185/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 08:07:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:07:12] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-05-28 08:07:12] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
[2024-05-28 08:07:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 1388ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 77 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 181/181 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 178
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 182 transition count 177
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 181 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 171 transition count 167
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 171 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 170 transition count 166
Applied a total of 32 rules in 25 ms. Remains 170 /185 variables (removed 15) and now considering 166/181 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 170/185 places, 166/181 transitions.
RANDOM walk for 40000 steps (78 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 976345 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 2
Probabilistic random walk after 976345 steps, saw 177210 distinct states, run finished after 3008 ms. (steps per millisecond=324 ) properties seen :0
// Phase 1: matrix 166 rows 170 cols
[2024-05-28 08:07:16] [INFO ] Computed 37 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/170 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 166/336 variables, 170/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 08:07:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
[2024-05-28 08:07:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:07:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 08:07:16] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:07:16] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/170 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 166/336 variables, 170/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1392ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 77 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 166/166 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 170/170 places, 166/166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 166/166 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2024-05-28 08:07:18] [INFO ] Invariant cache hit.
[2024-05-28 08:07:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 08:07:18] [INFO ] Invariant cache hit.
[2024-05-28 08:07:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-28 08:07:18] [INFO ] Redundant transitions in 17 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-28 08:07:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 4/170 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 8 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:07:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:07:20] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:07:21] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:07:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:07:21] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:07:21] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:07:21] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:07:21] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:07:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:07:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:23] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 166/336 variables, 170/260 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:25] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:07:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 08:07:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 08:07:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:07:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:07:27] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:07:29] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 9/305 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:07:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 08:07:30] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-28 08:07:30] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 08:07:30] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 3 ms to minimize.
[2024-05-28 08:07:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:07:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:07:31] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:07:31] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:31] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 10/315 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:07:32] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 08:07:32] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:07:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:33] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:07:33] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:07:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:33] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:07:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:36] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/336 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 18 (OVERLAPS) 0/336 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 325 constraints, problems are : Problem set: 0 solved, 162 unsolved in 21174 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 4/170 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 118/155 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:40] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:07:40] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 166/336 variables, 170/327 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 162/489 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:45] [INFO ] Deduced a trap composed of 22 places in 1853 ms of which 28 ms to minimize.
[2024-05-28 08:07:46] [INFO ] Deduced a trap composed of 14 places in 792 ms of which 2 ms to minimize.
[2024-05-28 08:07:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 08:07:48] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:07:49] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 08:07:49] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:07:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:07:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:07:53] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:07:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:07:54] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:07:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:07:56] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 7/504 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:07:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 08:08:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 506 constraints, problems are : Problem set: 0 solved, 162 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 137/137 constraints]
After SMT, in 51247ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 51251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51495 ms. Remains : 170/170 places, 166/166 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 08:08:09] [INFO ] Flatten gal took : 17 ms
[2024-05-28 08:08:09] [INFO ] Applying decomposition
[2024-05-28 08:08:09] [INFO ] Flatten gal took : 14 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/graph11232979503137465710.txt' '-o' '/tmp/graph11232979503137465710.bin' '-w' '/tmp/graph11232979503137465710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11232979503137465710.bin' '-l' '-1' '-v' '-w' '/tmp/graph11232979503137465710.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:08:09] [INFO ] Decomposing Gal with order
[2024-05-28 08:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:08:09] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-28 08:08:09] [INFO ] Flatten gal took : 49 ms
[2024-05-28 08:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 08:08:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11080098897059984936.gal : 5 ms
[2024-05-28 08:08:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16203137187965440331.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/ReachabilityCardinality11080098897059984936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16203137187965440331.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16203137187965440331.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 2211
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2211 after 3.63285e+08
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3.99613e+09 after 1.14589e+11
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.14589e+11 after 1.87272e+12
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.87272e+12 after 6.11071e+13
Detected timeout of ITS tools.
[2024-05-28 08:38:09] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6969601651795829886
[2024-05-28 08:38:10] [INFO ] Applying decomposition
[2024-05-28 08:38:10] [INFO ] Computing symmetric may disable matrix : 166 transitions.
[2024-05-28 08:38:10] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:38:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:10] [INFO ] Computing symmetric may enable matrix : 166 transitions.
[2024-05-28 08:38:10] [INFO ] Computation of Complete enable matrix. took 0 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/graph13511985805429650205.txt' '-o' '/tmp/graph13511985805429650205.bin' '-w' '/tmp/graph13511985805429650205.weights'
[2024-05-28 08:38:10] [INFO ] Computing Do-Not-Accords matrix : 166 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13511985805429650205.bin' '-l' '-1' '-v' '-w' '/tmp/graph13511985805429650205.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:38:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:10] [INFO ] Decomposing Gal with order
[2024-05-28 08:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:38:10] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-28 08:38:10] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6969601651795829886
Running compilation step : cd /tmp/ltsmin6969601651795829886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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-28 08:38:10] [INFO ] Flatten gal took : 20 ms
[2024-05-28 08:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2024-05-28 08:38:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2303970003890149388.gal : 4 ms
[2024-05-28 08:38:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3768565301216559868.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/ReachabilityFireability2303970003890149388.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3768565301216559868.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability3768565301216559868.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 130563
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6.65858e+07 after 3.29733e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.29733e+08 after 4.50058e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.50058e+08 after 1.59503e+11
Compilation finished in 567 ms.
Running link step : cd /tmp/ltsmin6969601651795829886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6969601651795829886;'/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' 'ShieldIIPsPT004BReachabilityFireability202404==true'
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.59503e+11 after 1.44122e+12
Invariant property ShieldIIPs-PT-004B-ReachabilityFireability-2024-11 does not hold.
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.44122e+12 after 8.53668e+15
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6969601651795829886;'/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' 'ShieldIIPsPT004BReachabilityFireability202404==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6969601651795829886;'/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' 'ShieldIIPsPT004BReachabilityFireability202404==true'

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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-004B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760300063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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