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

About the Execution of ITS-Tools for DoubleExponent-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15078.487 3600000.00 5606298.00 7659.90 ??????F????F???? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631133000574.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 DoubleExponent-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631133000574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-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 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2023-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2023-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716400168209

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 17:49:29] [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-22 17:49:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:49:29] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-22 17:49:29] [INFO ] Transformed 5304 places.
[2024-05-22 17:49:29] [INFO ] Transformed 4998 transitions.
[2024-05-22 17:49:29] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1319 resets) in 2038 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 191 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 96 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 88 ms. (44 steps per ms) remains 16/16 properties
[2024-05-22 17:49:31] [INFO ] Flatten gal took : 386 ms
BEST_FIRST walk for 4001 steps (110 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 88 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (105 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (107 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (120 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
[2024-05-22 17:49:31] [INFO ] Flatten gal took : 235 ms
BEST_FIRST walk for 4000 steps (103 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (110 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
[2024-05-22 17:49:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16717407926738898279.gal : 102 ms
[2024-05-22 17:49:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6463350034904927796.prop : 2 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/ReachabilityCardinality16717407926738898279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6463350034904927796.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6463350034904927796.prop.
Interrupted probabilistic random walk after 61878 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 16
Probabilistic random walk after 61878 steps, saw 30944 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-22 17:49:35] [INFO ] Invariants computation overflowed in 297 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 712/991 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/991 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2899/3890 variables, 1180/1459 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3890 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3876/7766 variables, 2100/3559 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7766 variables, 0/3559 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2077/9843 variables, 1384/4943 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9843/10302 variables, and 4943 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5068 ms.
Refiners :[State Equation: 4943/5304 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 712/991 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/991 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2899/3890 variables, 1180/1459 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3890 variables, 16/1475 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3890 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 3876/7766 variables, 2100/3575 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7766/10302 variables, and 3575 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5050 ms.
Refiners :[State Equation: 3559/5304 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10621ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 279 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 926 transitions
Trivial Post-agglo rules discarded 926 transitions
Performed 926 trivial Post agglomeration. Transition count delta: 926
Iterating post reduction 0 with 929 rules applied. Total rules applied 930 place count 5297 transition count 4070
Reduce places removed 926 places and 0 transitions.
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Iterating post reduction 1 with 1019 rules applied. Total rules applied 1949 place count 4371 transition count 3977
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 2042 place count 4278 transition count 3977
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 2042 place count 4278 transition count 3770
Deduced a syphon composed of 207 places in 190 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 2456 place count 4071 transition count 3770
Performed 777 Post agglomeration using F-continuation condition.Transition count delta: 777
Deduced a syphon composed of 777 places in 87 ms
Reduce places removed 777 places and 0 transitions.
Iterating global reduction 3 with 1554 rules applied. Total rules applied 4010 place count 3294 transition count 2993
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 80 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4212 place count 3193 transition count 2993
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 127 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 4336 place count 3131 transition count 2993
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4340 place count 3131 transition count 2989
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4344 place count 3127 transition count 2989
Free-agglomeration rule (complex) applied 417 times.
Iterating global reduction 4 with 417 rules applied. Total rules applied 4761 place count 3127 transition count 2572
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 4 with 417 rules applied. Total rules applied 5178 place count 2710 transition count 2572
Partial Free-agglomeration rule applied 389 times.
Drop transitions (Partial Free agglomeration) removed 389 transitions
Iterating global reduction 5 with 389 rules applied. Total rules applied 5567 place count 2710 transition count 2572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5568 place count 2709 transition count 2571
Applied a total of 5568 rules in 2614 ms. Remains 2709 /5304 variables (removed 2595) and now considering 2571/4998 (removed 2427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2623 ms. Remains : 2709/5304 places, 2571/4998 transitions.
RANDOM walk for 40000 steps (3679 resets) in 879 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (280 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (273 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (258 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (267 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (283 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (278 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (280 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (276 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (286 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (262 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (282 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (273 resets) in 22 ms. (173 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (278 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (264 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (269 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (296 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :11 after 20
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :20 after 31
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :31 after 63
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :63 after 115
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :115 after 310
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :310 after 2444
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :2444 after 21116
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :21116 after 202385
Interrupted probabilistic random walk after 81659 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 16
Probabilistic random walk after 81659 steps, saw 40944 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 2571 rows 2709 cols
[2024-05-22 17:49:51] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-22 17:49:51] [INFO ] State equation strengthened by 322 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 928/1207 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1207 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :202385 after 876441
At refinement iteration 4 (OVERLAPS) 2880/4087 variables, 1458/1757 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :876441 after 2.3132e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/4087 variables, 191/1948 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4087 variables, 0/1948 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5260/5280 variables, and 2902 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45048 ms.
Refiners :[State Equation: 2691/2709 constraints, ReadFeed: 211/322 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 928/1207 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1207 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2880/4087 variables, 1458/1757 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4087 variables, 191/1948 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4087 variables, 11/1959 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4087/5280 variables, and 1959 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45016 ms.
Refiners :[State Equation: 1737/2709 constraints, ReadFeed: 211/322 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 90227ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 279 out of 2709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2571/2571 transitions.
Applied a total of 0 rules in 127 ms. Remains 2709 /2709 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2709/2709 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2709/2709 places, 2571/2571 transitions.
Applied a total of 0 rules in 120 ms. Remains 2709 /2709 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
// Phase 1: matrix 2571 rows 2709 cols
[2024-05-22 17:51:22] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-22 17:51:24] [INFO ] Implicit Places using invariants in 1949 ms returned []
// Phase 1: matrix 2571 rows 2709 cols
[2024-05-22 17:51:24] [INFO ] Invariants computation overflowed in 82 ms
[2024-05-22 17:51:25] [INFO ] State equation strengthened by 322 read => feed constraints.
[2024-05-22 17:51:55] [INFO ] Performed 175/2709 implicitness test of which 9 returned IMPLICIT in 30 seconds.
[2024-05-22 17:52:35] [INFO ] Performed 337/2709 implicitness test of which 21 returned IMPLICIT in 69 seconds.
[2024-05-22 17:53:13] [INFO ] Performed 339/2709 implicitness test of which 21 returned IMPLICIT in 107 seconds.
[2024-05-22 17:54:04] [INFO ] Performed 350/2709 implicitness test of which 21 returned IMPLICIT in 158 seconds.
[2024-05-22 17:54:04] [INFO ] Implicit Places using invariants and state equation in 160124 ms returned [22, 28, 52, 61, 85, 90, 112, 144, 175, 181, 202, 205, 208, 233, 239, 260, 265, 291, 297, 320, 328]
[2024-05-22 17:54:04] [INFO ] Actually due to overlaps returned [28, 181, 328, 22, 144, 175, 291, 205, 297, 320]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 162087 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2699/2709 places, 2571/2571 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2699 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2698 transition count 2570
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 2698 transition count 2570
Applied a total of 7 rules in 617 ms. Remains 2698 /2699 variables (removed 1) and now considering 2570/2571 (removed 1) transitions.
// Phase 1: matrix 2570 rows 2698 cols
[2024-05-22 17:54:05] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-22 17:54:06] [INFO ] Implicit Places using invariants in 1552 ms returned []
// Phase 1: matrix 2570 rows 2698 cols
[2024-05-22 17:54:06] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-22 17:54:07] [INFO ] State equation strengthened by 322 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :2.3132e+06 after 1.25458e+08
[2024-05-22 17:54:39] [INFO ] Performed 55/2698 implicitness test of which 1 returned IMPLICIT in 31 seconds.
[2024-05-22 17:55:10] [INFO ] Performed 312/2698 implicitness test of which 11 returned IMPLICIT in 62 seconds.
[2024-05-22 17:55:44] [INFO ] Performed 439/2698 implicitness test of which 16 returned IMPLICIT in 96 seconds.
[2024-05-22 17:56:46] [INFO ] Performed 440/2698 implicitness test of which 16 returned IMPLICIT in 158 seconds.
[2024-05-22 17:56:46] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160098 ms
[2024-05-22 17:56:46] [INFO ] Actually due to overlaps returned [439, 201, 58, 349, 49, 342, 434, 196]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 161654 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2690/2709 places, 2570/2571 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2690 transition count 2568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2688 transition count 2568
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 2688 transition count 2568
Applied a total of 6 rules in 352 ms. Remains 2688 /2690 variables (removed 2) and now considering 2568/2570 (removed 2) transitions.
// Phase 1: matrix 2568 rows 2688 cols
[2024-05-22 17:56:47] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-22 17:56:48] [INFO ] Implicit Places using invariants in 1422 ms returned []
// Phase 1: matrix 2568 rows 2688 cols
[2024-05-22 17:56:48] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-22 17:56:49] [INFO ] State equation strengthened by 322 read => feed constraints.
[2024-05-22 17:57:20] [INFO ] Performed 74/2688 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 17:57:50] [INFO ] Performed 323/2688 implicitness test of which 7 returned IMPLICIT in 60 seconds.
[2024-05-22 17:58:20] [INFO ] Performed 549/2688 implicitness test of which 14 returned IMPLICIT in 90 seconds.
[2024-05-22 17:58:50] [INFO ] Performed 707/2688 implicitness test of which 25 returned IMPLICIT in 120 seconds.
[2024-05-22 17:59:21] [INFO ] Performed 864/2688 implicitness test of which 31 returned IMPLICIT in 151 seconds.
[2024-05-22 17:59:28] [INFO ] Implicit Places using invariants and state equation in 160114 ms returned [80, 85, 107, 221, 227, 248, 253, 375, 456, 462, 485, 492, 513, 519, 558, 579, 585, 607, 614, 638, 644, 667, 672, 693, 698, 754, 760, 784, 786, 790, 859, 878, 884]
[2024-05-22 17:59:28] [INFO ] Actually due to overlaps returned [558, 585, 462, 884, 227, 760, 85, 456, 579, 754, 878, 80, 221, 375]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 161540 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2674/2709 places, 2568/2571 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2674 transition count 2565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 2671 transition count 2565
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 2671 transition count 2565
Applied a total of 9 rules in 355 ms. Remains 2671 /2674 variables (removed 3) and now considering 2565/2568 (removed 3) transitions.
// Phase 1: matrix 2565 rows 2671 cols
[2024-05-22 17:59:29] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-22 17:59:30] [INFO ] Implicit Places using invariants in 1390 ms returned []
// Phase 1: matrix 2565 rows 2671 cols
[2024-05-22 17:59:30] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-22 17:59:31] [INFO ] State equation strengthened by 322 read => feed constraints.
[2024-05-22 18:00:01] [INFO ] Performed 95/2671 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 18:00:45] [INFO ] Performed 135/2671 implicitness test of which 1 returned IMPLICIT in 73 seconds.
[2024-05-22 18:01:17] [INFO ] Performed 286/2671 implicitness test of which 3 returned IMPLICIT in 105 seconds.
[2024-05-22 18:01:50] [INFO ] Performed 377/2671 implicitness test of which 3 returned IMPLICIT in 138 seconds.
[2024-05-22 18:02:10] [INFO ] Implicit Places using invariants and state equation in 160141 ms returned [105, 244, 249]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 161552 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 2668/2709 places, 2565/2571 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2668 transition count 2564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2667 transition count 2564
Applied a total of 2 rules in 247 ms. Remains 2667 /2668 variables (removed 1) and now considering 2564/2565 (removed 1) transitions.
// Phase 1: matrix 2564 rows 2667 cols
[2024-05-22 18:02:10] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 18:02:12] [INFO ] Implicit Places using invariants in 1427 ms returned []
// Phase 1: matrix 2564 rows 2667 cols
[2024-05-22 18:02:12] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 18:02:13] [INFO ] State equation strengthened by 322 read => feed constraints.
[2024-05-22 18:02:43] [INFO ] Performed 81/2667 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 18:03:16] [INFO ] Performed 229/2667 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2024-05-22 18:04:01] [INFO ] Performed 426/2667 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-05-22 18:04:39] [INFO ] Performed 428/2667 implicitness test of which 0 returned IMPLICIT in 145 seconds.
[2024-05-22 18:04:39] [INFO ] Timeout of Implicit test with SMT after 145 seconds.
[2024-05-22 18:04:39] [INFO ] Implicit Places using invariants and state equation in 147170 ms returned []
Implicit Place search using SMT with State Equation took 148597 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 2667/2709 places, 2564/2571 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 797122 ms. Remains : 2667/2709 places, 2564/2571 transitions.
RANDOM walk for 40000 steps (3793 resets) in 599 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (272 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (270 resets) in 142 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (282 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (267 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (275 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (272 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (275 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (270 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (270 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (284 resets) in 121 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (273 resets) in 96 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (256 resets) in 79 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (258 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (267 resets) in 144 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (266 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (262 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 36949 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :0 out of 16
Probabilistic random walk after 36949 steps, saw 18490 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
// Phase 1: matrix 2564 rows 2667 cols
[2024-05-22 18:04:43] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 18:04:43] [INFO ] State equation strengthened by 322 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 933/1212 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1212 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2851/4063 variables, 1435/1734 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4063 variables, 194/1928 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4063 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5209/5231 variables, and 2861 constraints, problems are : Problem set: 0 solved, 16 unsolved in 75026 ms.
Refiners :[State Equation: 2647/2667 constraints, ReadFeed: 214/322 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 933/1212 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1212 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2851/4063 variables, 1435/1734 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4063 variables, 194/1928 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4063 variables, 11/1939 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4063 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5209/5231 variables, and 2872 constraints, problems are : Problem set: 0 solved, 16 unsolved in 75027 ms.
Refiners :[State Equation: 2647/2667 constraints, ReadFeed: 214/322 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 150161ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 279 out of 2667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2667/2667 places, 2564/2564 transitions.
Applied a total of 0 rules in 115 ms. Remains 2667 /2667 variables (removed 0) and now considering 2564/2564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 2667/2667 places, 2564/2564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2667/2667 places, 2564/2564 transitions.
Applied a total of 0 rules in 107 ms. Remains 2667 /2667 variables (removed 0) and now considering 2564/2564 (removed 0) transitions.
// Phase 1: matrix 2564 rows 2667 cols
[2024-05-22 18:07:13] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 18:07:15] [INFO ] Implicit Places using invariants in 1353 ms returned []
// Phase 1: matrix 2564 rows 2667 cols
[2024-05-22 18:07:15] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 18:07:16] [INFO ] State equation strengthened by 322 read => feed constraints.
[2024-05-22 18:07:48] [INFO ] Performed 90/2667 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-22 18:08:19] [INFO ] Performed 229/2667 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-22 18:09:04] [INFO ] Performed 426/2667 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-05-22 18:09:42] [INFO ] Performed 428/2667 implicitness test of which 0 returned IMPLICIT in 146 seconds.
[2024-05-22 18:09:42] [INFO ] Timeout of Implicit test with SMT after 146 seconds.
[2024-05-22 18:09:42] [INFO ] Implicit Places using invariants and state equation in 147350 ms returned []
Implicit Place search using SMT with State Equation took 148707 ms to find 0 implicit places.
[2024-05-22 18:09:42] [INFO ] Redundant transitions in 128 ms returned []
Running 2563 sub problems to find dead transitions.
// Phase 1: matrix 2564 rows 2667 cols
[2024-05-22 18:09:42] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-22 18:09:42] [INFO ] State equation strengthened by 322 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2666/5231 variables, and 0 constraints, problems are : Problem set: 0 solved, 2563 unsolved in 30069 ms.
Refiners :[State Equation: 0/2667 constraints, ReadFeed: 0/322 constraints, PredecessorRefiner: 2563/2563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2563 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2666/5231 variables, and 0 constraints, problems are : Problem set: 0 solved, 2563 unsolved in 30058 ms.
Refiners :[State Equation: 0/2667 constraints, ReadFeed: 0/322 constraints, PredecessorRefiner: 0/2563 constraints, Known Traps: 0/0 constraints]
After SMT, in 61684ms problems are : Problem set: 0 solved, 2563 unsolved
Search for dead transitions found 0 dead transitions in 61716ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210687 ms. Remains : 2667/2667 places, 2564/2564 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 2667 transition count 2550
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 2653 transition count 2550
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 134 Pre rules applied. Total rules applied 28 place count 2653 transition count 2416
Deduced a syphon composed of 134 places in 44 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 296 place count 2519 transition count 2416
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 302 place count 2513 transition count 2410
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 2513 transition count 2410
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 2513 transition count 2408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 312 place count 2511 transition count 2408
Applied a total of 312 rules in 548 ms. Remains 2511 /2667 variables (removed 156) and now considering 2408/2564 (removed 156) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 2408 rows 2511 cols
[2024-05-22 18:10:45] [INFO ] Invariants computation overflowed in 69 ms
[2024-05-22 18:10:46] [INFO ] After 918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-22 18:18:16] [INFO ] After 448470ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2024-05-22 18:18:16] [INFO ] State equation strengthened by 1 read => feed constraints.
SMT process timed out, exceeded limit of 225
[2024-05-22 18:18:16] [INFO ] After 1ms SMT Verify possible using After timeout in natural domain returned unsat :2 sat :7
[2024-05-22 18:18:16] [INFO ] After 450065ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2023-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2024-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -2 properties in 451734 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 18:18:16] [INFO ] Flatten gal took : 233 ms
[2024-05-22 18:18:16] [INFO ] Applying decomposition
[2024-05-22 18:18:16] [INFO ] Flatten gal took : 193 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/graph10298259765847091276.txt' '-o' '/tmp/graph10298259765847091276.bin' '-w' '/tmp/graph10298259765847091276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10298259765847091276.bin' '-l' '-1' '-v' '-w' '/tmp/graph10298259765847091276.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:18:17] [INFO ] Decomposing Gal with order
[2024-05-22 18:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:18:19] [INFO ] Removed a total of 1413 redundant transitions.
[2024-05-22 18:18:19] [INFO ] Flatten gal took : 336 ms
[2024-05-22 18:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 124 ms.
[2024-05-22 18:18:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12131194463444877561.gal : 74 ms
[2024-05-22 18:18:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11692037730324204054.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/ReachabilityCardinality12131194463444877561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11692037730324204054.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11692037730324204054.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :11 after 20
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :20 after 32
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :32 after 70
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :70 after 132
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :132 after 318
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :318 after 2096
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :2096 after 15949
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :15949 after 174406
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :174406 after 851645
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :851645 after 2.17888e+06
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :2.17888e+06 after 1.16067e+08
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :1.16067e+08 after 8.03658e+08
SDD proceeding with computation,14 properties remain. new max is 262144
SDD size :8.03658e+08 after 3.21429e+09
SDD proceeding with computation,14 properties remain. new max is 524288
SDD size :3.21429e+09 after 1.07601e+10
SDD proceeding with computation,14 properties remain. new max is 1048576
SDD size :1.07601e+10 after 3.79452e+10
SDD proceeding with computation,14 properties remain. new max is 2097152
SDD size :3.79452e+10 after 1.27421e+11
SDD proceeding with computation,14 properties remain. new max is 4194304
SDD size :1.27421e+11 after 2.63621e+11
SDD proceeding with computation,14 properties remain. new max is 8388608
SDD size :2.63621e+11 after 5.76427e+11
Detected timeout of ITS tools.
[2024-05-22 18:48:21] [INFO ] Flatten gal took : 183 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14264885299594104456
[2024-05-22 18:48:21] [INFO ] Too many transitions (2564) to apply POR reductions. Disabling POR matrices.
[2024-05-22 18:48:21] [INFO ] Applying decomposition
[2024-05-22 18:48:21] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14264885299594104456
Running compilation step : cd /tmp/ltsmin14264885299594104456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '51' '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-22 18:48:21] [INFO ] Flatten gal took : 144 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/graph11321431492099605806.txt' '-o' '/tmp/graph11321431492099605806.bin' '-w' '/tmp/graph11321431492099605806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11321431492099605806.bin' '-l' '-1' '-v' '-w' '/tmp/graph11321431492099605806.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:48:21] [INFO ] Decomposing Gal with order
[2024-05-22 18:48:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:48:21] [INFO ] Removed a total of 1538 redundant transitions.
[2024-05-22 18:48:22] [INFO ] Flatten gal took : 201 ms
[2024-05-22 18:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 610 labels/synchronizations in 85 ms.
[2024-05-22 18:48:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18305604258603109298.gal : 30 ms
[2024-05-22 18:48:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7629288521989944727.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/ReachabilityCardinality18305604258603109298.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7629288521989944727.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7629288521989944727.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :8 after 15
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :27 after 51
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :51 after 83
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :83 after 310
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :310 after 781
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :781 after 3369
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :3369 after 237650
Compilation finished in 9586 ms.
Running link step : cd /tmp/ltsmin14264885299594104456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202400==true'
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :237650 after 1.00108e+06
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :1.00108e+06 after 1.0079e+06
WARNING : LTSmin timed out (>18 s) on command cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202401==true'
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :1.0079e+06 after 1.02293e+06
WARNING : LTSmin timed out (>18 s) on command cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202402==true'
WARNING : LTSmin timed out (>18 s) on command cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202402==true'
Running LTSmin : cd /tmp/ltsmin14264885299594104456;'/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' 'DoubleExponentPT100ReachabilityCardinality202403==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
+ [[ 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="DoubleExponent-PT-100"
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 DoubleExponent-PT-100, 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 r136-tall-171631133000574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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