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-171683760300094.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-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 164K 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-010B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716894245148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 11:04: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-28 11:04:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:04:06] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-28 11:04:06] [INFO ] Transformed 603 places.
[2024-05-28 11:04:06] [INFO ] Transformed 593 transitions.
[2024-05-28 11:04:06] [INFO ] Found NUPN structural information;
[2024-05-28 11:04:06] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:04:07] [INFO ] Flatten gal took : 185 ms
RANDOM walk for 40000 steps (28 resets) in 1885 ms. (21 steps per ms) remains 1/13 properties
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 11:04:07] [INFO ] Flatten gal took : 101 ms
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
// Phase 1: matrix 593 rows 603 cols
[2024-05-28 11:04:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8435010684112823064.gal : 46 ms
[2024-05-28 11:04:07] [INFO ] Computed 91 invariants in 22 ms
[2024-05-28 11:04:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3366934949610301627.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/ReachabilityCardinality8435010684112823064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3366934949610301627.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/ReachabilityCardinality3366934949610301627.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/68 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 388
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :388 after 500
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :500 after 103203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :103203 after 1.53401e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.53401e+08 after 5.00436e+15
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.00436e+15 after 1.66497e+25
At refinement iteration 5 (OVERLAPS) 535/603 variables, 83/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 535/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.66497e+25 after 6.03352e+27
At refinement iteration 8 (OVERLAPS) 593/1196 variables, 603/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1196 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.03352e+27 after 6.03352e+27
At refinement iteration 10 (OVERLAPS) 0/1196 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 1297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Domain max(s): 603/603 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 603/603 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/68 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:08] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 535/603 variables, 83/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 535/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.03352e+27 after 6.03352e+27
[2024-05-28 11:04:08] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-28 11:04:08] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:04:08] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:04:08] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 4 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.03352e+27 after 6.03352e+27
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 15/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 593/1196 variables, 603/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1196 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-28 11:04:10] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.03352e+27 after 6.03352e+27
[2024-05-28 11:04:11] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 5 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1196 variables, 20/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:04:12] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:04:13] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:04:13] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
SMT process timed out in 5788ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 603 transition count 543
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 553 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 552 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 102 place count 552 transition count 491
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 204 place count 501 transition count 491
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 273 place count 432 transition count 422
Iterating global reduction 3 with 69 rules applied. Total rules applied 342 place count 432 transition count 422
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 342 place count 432 transition count 393
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 400 place count 403 transition count 393
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 692 place count 257 transition count 247
Partial Free-agglomeration rule applied 66 times.
Drop transitions (Partial Free agglomeration) removed 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 758 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 759 place count 256 transition count 246
Applied a total of 759 rules in 203 ms. Remains 256 /603 variables (removed 347) and now considering 246/593 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 256/603 places, 246/593 transitions.
RANDOM walk for 40000 steps (32 resets) in 1533 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 800526 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 800526 steps, saw 335616 distinct states, run finished after 3012 ms. (steps per millisecond=265 ) properties seen :0
// Phase 1: matrix 246 rows 256 cols
[2024-05-28 11:04:16] [INFO ] Computed 91 invariants in 7 ms
[2024-05-28 11:04:16] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/41 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/45 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/110 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/194 variables, 40/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 103/297 variables, 48/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 15/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/300 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/300 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/306 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 101/407 variables, 54/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/407 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/469 variables, 36/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/469 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/469 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/473 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/473 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/473 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/477 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/477 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/477 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 25/502 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/502 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/502 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/502 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, ReadFeed: 4/4 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/41 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/45 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/110 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/194 variables, 40/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 103/297 variables, 48/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 15/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/300 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/300 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/306 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/306 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/306 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/306 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 101/407 variables, 54/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/407 variables, 17/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/407 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 62/469 variables, 36/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/469 variables, 9/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/469 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/473 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/473 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/473 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/473 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 4/477 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/477 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/477 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 25/502 variables, 20/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/502 variables, 8/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:04:17] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 5 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:04:18] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/502 variables, 13/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/502 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/502 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 246/246 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 256/256 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 246/246 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-28 11:04:18] [INFO ] Invariant cache hit.
[2024-05-28 11:04:18] [INFO ] Implicit Places using invariants in 177 ms returned [241]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 185 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 255/256 places, 246/246 transitions.
Applied a total of 0 rules in 14 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 210 ms. Remains : 255/256 places, 246/246 transitions.
RANDOM walk for 40000 steps (33 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :6.03352e+27 after 6.03352e+27
Interrupted probabilistic random walk after 875996 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 1
Probabilistic random walk after 875996 steps, saw 361055 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
// Phase 1: matrix 246 rows 255 cols
[2024-05-28 11:04:21] [INFO ] Computed 90 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/40 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/109 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 84/193 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 103/296 variables, 48/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 15/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/299 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/305 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/305 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 101/406 variables, 54/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/406 variables, 17/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/406 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 62/468 variables, 36/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/468 variables, 9/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/468 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/472 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/472 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/472 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/476 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/476 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/476 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 25/501 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/501 variables, 8/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/501 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 255/255 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/40 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/109 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 84/193 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 103/296 variables, 48/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 15/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/296 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/299 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/305 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/305 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/305 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 101/406 variables, 54/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/406 variables, 17/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/406 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 62/468 variables, 36/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/468 variables, 9/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/468 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/472 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/472 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/472 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/472 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 4/476 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/476 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/476 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/476 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 25/501 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/501 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:04:22] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:04:23] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:04:23] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:04:23] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:04:23] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:04:23] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/501 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/501 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/501 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 1530ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 255/255 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-28 11:04:23] [INFO ] Invariant cache hit.
[2024-05-28 11:04:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-28 11:04:23] [INFO ] Invariant cache hit.
[2024-05-28 11:04:23] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-28 11:04:23] [INFO ] Redundant transitions in 17 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-28 11:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:04:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:04:26] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 2/255 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:28] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:04:28] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:04:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 246/501 variables, 255/374 constraints. Problems are: Problem set: 0 solved, 244 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.03352e+27 after 6.03352e+27
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:04:32] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:04:33] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:04:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:04:35] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:04:35] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:04:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:04:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:04:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:04:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:04:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:04:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:04:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:04:36] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:04:39] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:04:39] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:04:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:04:39] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:04:39] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 6/412 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:40] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:04:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:04:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:04:41] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 5 ms to minimize.
[2024-05-28 11:04:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 5/417 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:04:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:04:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:45] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:04:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:47] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:04:47] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:04:48] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:04:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:49] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:04:50] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:52] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:04:52] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:04:53] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
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 Real declared 501/501 variables, and 432 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 80/159 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 2/255 variables, 11/170 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 246/501 variables, 255/432 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 244/676 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:04:59] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:05:01] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:05:03] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:05:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 524288
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:05:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
SDD size :6.03352e+27 after 6.03352e+27
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:05:05] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:05:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 12/688 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-05-28 11:05:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:05:12] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 691 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 102/102 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60641 ms. Remains : 255/255 places, 246/246 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 11:05:24] [INFO ] Flatten gal took : 34 ms
[2024-05-28 11:05:24] [INFO ] Applying decomposition
[2024-05-28 11:05:24] [INFO ] Flatten gal took : 32 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/graph14314380857553750879.txt' '-o' '/tmp/graph14314380857553750879.bin' '-w' '/tmp/graph14314380857553750879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14314380857553750879.bin' '-l' '-1' '-v' '-w' '/tmp/graph14314380857553750879.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:05:24] [INFO ] Decomposing Gal with order
[2024-05-28 11:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:05:24] [INFO ] Removed a total of 230 redundant transitions.
[2024-05-28 11:05:24] [INFO ] Flatten gal took : 76 ms
[2024-05-28 11:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-28 11:05:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18239636988362174057.gal : 12 ms
[2024-05-28 11:05:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14925882562388793265.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/ReachabilityCardinality18239636988362174057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14925882562388793265.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/ReachabilityCardinality14925882562388793265.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1095
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1095 after 6.53331e+27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.53331e+27 after 9.09735e+28
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.09735e+28 after 2.57855e+29
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.57855e+29 after 2.38466e+31
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.38466e+31 after 3.88908e+32
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.88908e+32 after 3.91627e+32
ITS-tools command line returned an error code 137
[2024-05-28 11:29:46] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6792415193715603433
[2024-05-28 11:29:46] [INFO ] Computing symmetric may disable matrix : 246 transitions.
[2024-05-28 11:29:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:29:46] [INFO ] Computing symmetric may enable matrix : 246 transitions.
[2024-05-28 11:29:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:29:46] [INFO ] Applying decomposition
[2024-05-28 11:29:46] [INFO ] Computing Do-Not-Accords matrix : 246 transitions.
[2024-05-28 11:29:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:29:46] [INFO ] Flatten gal took : 29 ms
[2024-05-28 11:29:46] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6792415193715603433
Running compilation step : cd /tmp/ltsmin6792415193715603433;'/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'
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/graph6928949560269503776.txt' '-o' '/tmp/graph6928949560269503776.bin' '-w' '/tmp/graph6928949560269503776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6928949560269503776.bin' '-l' '-1' '-v' '-w' '/tmp/graph6928949560269503776.weights' '-q' '0' '-e' '0.001'
[2024-05-28 11:29:46] [INFO ] Decomposing Gal with order
[2024-05-28 11:29:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:29:46] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-28 11:29:46] [INFO ] Flatten gal took : 20 ms
[2024-05-28 11:29:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 11 ms.
[2024-05-28 11:29:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality919732522315709002.gal : 4 ms
[2024-05-28 11:29:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5560498055929950956.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/ReachabilityCardinality919732522315709002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5560498055929950956.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 ...306
Loading property file /tmp/ReachabilityCardinality5560498055929950956.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :762 after 19392
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19392 after 6.91393e+08
Compilation finished in 764 ms.
Running link step : cd /tmp/ltsmin6792415193715603433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6792415193715603433;'/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' 'ShieldIIPsPT010BReachabilityCardinality202404==true'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.91393e+08 after 6.13116e+13
ITS-tools command line returned an error code 137
[2024-05-28 11:55:34] [INFO ] Applying decomposition
[2024-05-28 11:55:34] [INFO ] Flatten gal took : 81 ms
[2024-05-28 11:55:34] [INFO ] Decomposing Gal with order
[2024-05-28 11:55:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 11:55:34] [INFO ] Removed a total of 223 redundant transitions.
[2024-05-28 11:55:34] [INFO ] Flatten gal took : 97 ms
[2024-05-28 11:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 464 labels/synchronizations in 158 ms.
[2024-05-28 11:55:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16386297275209808435.gal : 24 ms
[2024-05-28 11:55:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3446509815581729642.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/ReachabilityCardinality16386297275209808435.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3446509815581729642.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 ...308
Loading property file /tmp/ReachabilityCardinality3446509815581729642.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 6
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.196: Initializing POR dependencies: labels 247, guards 246
pins2lts-mc-linux64( 6/ 8), 0.201: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.689: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 0.724: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.725: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.728: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.728: There are 247 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.728: State length is 255, there are 246 groups
pins2lts-mc-linux64( 0/ 8), 0.728: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.728: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.728: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.728: Visible groups: 0 / 246, labels: 1 / 247
pins2lts-mc-linux64( 0/ 8), 0.728: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.728: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.726: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.727: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.726: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.727: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.727: "ShieldIIPsPT010BReachabilityCardinality202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.817: ~12 levels ~960 states ~3120 transitions
pins2lts-mc-linux64( 4/ 8), 0.836: ~9 levels ~1920 states ~7720 transitions
pins2lts-mc-linux64( 4/ 8), 0.883: ~11 levels ~3840 states ~16608 transitions
pins2lts-mc-linux64( 4/ 8), 1.011: ~12 levels ~7680 states ~34792 transitions
pins2lts-mc-linux64( 0/ 8), 1.189: ~18 levels ~15360 states ~70960 transitions
pins2lts-mc-linux64( 0/ 8), 1.560: ~20 levels ~30720 states ~144656 transitions
pins2lts-mc-linux64( 4/ 8), 2.342: ~16 levels ~61440 states ~328120 transitions
pins2lts-mc-linux64( 7/ 8), 3.579: ~10 levels ~122880 states ~716656 transitions
pins2lts-mc-linux64( 7/ 8), 5.874: ~11 levels ~245760 states ~1459176 transitions
pins2lts-mc-linux64( 4/ 8), 10.705: ~20 levels ~491520 states ~2915264 transitions
pins2lts-mc-linux64( 5/ 8), 20.015: ~13 levels ~983040 states ~6498160 transitions
pins2lts-mc-linux64( 5/ 8), 39.020: ~14 levels ~1966080 states ~13536936 transitions
pins2lts-mc-linux64( 5/ 8), 78.688: ~16 levels ~3932160 states ~28164368 transitions
pins2lts-mc-linux64( 5/ 8), 162.498: ~17 levels ~7864320 states ~58824888 transitions
pins2lts-mc-linux64( 5/ 8), 341.473: ~18 levels ~15728640 states ~121709008 transitions
pins2lts-mc-linux64( 0/ 8), 707.856: ~32 levels ~31457280 states ~250224872 transitions
pins2lts-mc-linux64( 5/ 8), 1451.033: ~20 levels ~62914560 states ~523295856 transitions
pins2lts-mc-linux64( 6/ 8), 1706.759: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1706.782:
pins2lts-mc-linux64( 0/ 8), 1706.782: mean standard work distribution: 5.3% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1706.782:
pins2lts-mc-linux64( 0/ 8), 1706.782: Explored 67953527 states 591512390 transitions, fanout: 8.705
pins2lts-mc-linux64( 0/ 8), 1706.782: Total exploration time 1706.040 sec (1706.030 sec minimum, 1706.035 sec on average)
pins2lts-mc-linux64( 0/ 8), 1706.782: States per second: 39831, Transitions per second: 346717
pins2lts-mc-linux64( 0/ 8), 1706.782: Ignoring proviso: 40804232
pins2lts-mc-linux64( 0/ 8), 1706.782:
pins2lts-mc-linux64( 0/ 8), 1706.782: Queue width: 8B, total height: 54225444, memory: 413.71MB
pins2lts-mc-linux64( 0/ 8), 1706.782: Tree memory: 1188.1MB, 10.2 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1706.782: Tree fill ratio (roots/leafs): 91.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1706.782: Stored 257 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1706.782: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1706.782: Est. total memory use: 1601.9MB (~1437.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6792415193715603433;'/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' 'ShieldIIPsPT010BReachabilityCardinality202404==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6792415193715603433;'/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' 'ShieldIIPsPT010BReachabilityCardinality202404==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)

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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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 r356-tall-171683760300094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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