About the Execution of ITS-Tools for DoubleExponent-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6188.279 | 1800000.00 | 3815216.00 | 3666.60 | [undef] | Time out reached |
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.r145-tall-171631145000352.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-020, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r145-tall-171631145000352
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 114K 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 60K 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.7K 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 340K 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
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1716404775184
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-22 19:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-22 19:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:06:16] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-22 19:06:16] [INFO ] Transformed 1064 places.
[2024-05-22 19:06:16] [INFO ] Transformed 998 transitions.
[2024-05-22 19:06:16] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 205 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1060 transition count 758
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 484 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 484 place count 820 transition count 718
Deduced a syphon composed of 40 places in 43 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 564 place count 780 transition count 718
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 4 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 932 place count 596 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 9 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1008 place count 558 transition count 534
Applied a total of 1008 rules in 169 ms. Remains 558 /1064 variables (removed 506) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2024-05-22 19:06:16] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 19:06:17] [INFO ] Implicit Places using invariants in 519 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2024-05-22 19:06:17] [INFO ] Invariants computation overflowed in 14 ms
[2024-05-22 19:06:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 19:06:24] [INFO ] Implicit Places using invariants and state equation in 7650 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8212 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 556/1064 places, 534/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 556 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 555 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 552 transition count 530
Applied a total of 8 rules in 32 ms. Remains 552 /556 variables (removed 4) and now considering 530/534 (removed 4) transitions.
// Phase 1: matrix 530 rows 552 cols
[2024-05-22 19:06:25] [INFO ] Computed 99 invariants in 76 ms
[2024-05-22 19:06:25] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-22 19:06:25] [INFO ] Invariant cache hit.
[2024-05-22 19:06:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 19:06:37] [INFO ] Implicit Places using invariants and state equation in 11610 ms returned []
Implicit Place search using SMT with State Equation took 12027 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 552/1064 places, 530/998 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 20470 ms. Remains : 552/1064 places, 530/998 transitions.
Discarding 118 transitions out of 530. Remains 412
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4866 resets) in 3982 ms. (10 steps per ms) remains 397/411 properties
BEST_FIRST walk for 400 steps (28 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (28 resets) in 15 ms. (25 steps per ms) remains 397/397 properties
[2024-05-22 19:06:38] [INFO ] Flatten gal took : 233 ms
BEST_FIRST walk for 401 steps (26 resets) in 24 ms. (16 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (31 resets) in 50 ms. (7 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (26 resets) in 14 ms. (26 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (33 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
[2024-05-22 19:06:38] [INFO ] Flatten gal took : 66 ms
BEST_FIRST walk for 402 steps (27 resets) in 19 ms. (20 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (29 resets) in 16 ms. (23 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (33 resets) in 31 ms. (12 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (25 resets) in 15 ms. (25 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (29 resets) in 31 ms. (12 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (24 resets) in 17 ms. (22 steps per ms) remains 397/397 properties
BEST_FIRST walk for 400 steps (27 resets) in 8 ms. (44 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (27 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
[2024-05-22 19:06:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11328631792000519022.gal : 34 ms
BEST_FIRST walk for 401 steps (24 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (30 resets) in 15 ms. (25 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (27 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
[2024-05-22 19:06:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11601630260728569041.prop : 5 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/ReachabilityCardinality11328631792000519022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11601630260728569041.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 401 steps (28 resets) in 18 ms. (21 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (27 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (32 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (28 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (25 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (31 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (26 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 404 steps (25 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (24 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
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
BEST_FIRST walk for 402 steps (29 resets) in 36 ms. (10 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (28 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (30 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (29 resets) in 15 ms. (25 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (27 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (26 resets) in 15 ms. (25 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (28 resets) in 17 ms. (22 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (26 resets) in 15 ms. (25 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (30 resets) in 14 ms. (26 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 14 ms. (26 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (29 resets) in 13 ms. (28 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (21 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
Loading property file /tmp/ReachabilityCardinality11601630260728569041.prop.
BEST_FIRST walk for 401 steps (28 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (30 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (30 resets) in 10 ms. (36 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (25 resets) in 9 ms. (40 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (29 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (27 resets) in 12 ms. (30 steps per ms) remains 397/397 properties
BEST_FIRST walk for 403 steps (29 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 402 steps (31 resets) in 11 ms. (33 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (28 resets) in 13 ms. (28 steps per ms) remains 397/397 properties
BEST_FIRST walk for 401 steps (33 resets) in 13 ms. (28 steps per ms) remains 397/397 properties
SDD proceeding with computation,397 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,397 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,397 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,397 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,397 properties remain. new max is 64
SDD size :21 after 32
Reachability property qltransition_94 is true.
SDD proceeding with computation,396 properties remain. new max is 64
SDD size :32 after 63
Reachability property qltransition_480 is true.
Reachability property qltransition_398 is true.
Reachability property qltransition_345 is true.
Reachability property qltransition_344 is true.
Reachability property qltransition_238 is true.
Reachability property qltransition_224 is true.
Reachability property qltransition_218 is true.
Reachability property qltransition_156 is true.
Reachability property qltransition_113 is true.
Reachability property qltransition_28 is true.
SDD proceeding with computation,386 properties remain. new max is 64
SDD size :63 after 82
Reachability property qltransition_420 is true.
Reachability property qltransition_243 is true.
Reachability property qltransition_134 is true.
SDD proceeding with computation,383 properties remain. new max is 64
SDD size :82 after 136
SDD proceeding with computation,383 properties remain. new max is 128
SDD size :136 after 237
Reachability property qltransition_500 is true.
Reachability property qltransition_363 is true.
Reachability property qltransition_359 is true.
Reachability property qltransition_244 is true.
Reachability property qltransition_189 is true.
Reachability property qltransition_180 is true.
Reachability property qltransition_143 is true.
SDD proceeding with computation,376 properties remain. new max is 128
SDD size :237 after 458
SDD proceeding with computation,376 properties remain. new max is 256
SDD size :458 after 815
SDD proceeding with computation,376 properties remain. new max is 512
SDD size :815 after 1327
Reachability property qltransition_498 is true.
Reachability property qltransition_478 is true.
Reachability property qltransition_374 is true.
Reachability property qltransition_260 is true.
Reachability property qltransition_259 is true.
Reachability property qltransition_214 is true.
Reachability property qltransition_147 is true.
Reachability property qltransition_11 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
Reachability property qltransition_4 is true.
Reachability property qltransition_1 is true.
Reachability property qltransition_0 is true.
SDD proceeding with computation,362 properties remain. new max is 512
SDD size :1327 after 4530
SDD proceeding with computation,362 properties remain. new max is 1024
SDD size :4530 after 18795
Reachability property qltransition_378 is true.
Reachability property qltransition_263 is true.
Reachability property qltransition_262 is true.
Reachability property qltransition_12 is true.
Reachability property qltransition_6 is true.
Reachability property qltransition_5 is true.
Reachability property qltransition_2 is true.
SDD proceeding with computation,355 properties remain. new max is 1024
SDD size :18795 after 70610
SDD proceeding with computation,355 properties remain. new max is 2048
SDD size :70610 after 125116
SDD proceeding with computation,355 properties remain. new max is 4096
SDD size :125116 after 217672
SDD proceeding with computation,355 properties remain. new max is 8192
SDD size :217672 after 424077
SDD proceeding with computation,355 properties remain. new max is 16384
SDD size :424077 after 848593
Interrupted probabilistic random walk after 89798 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :35 out of 397
Probabilistic random walk after 89798 steps, saw 44911 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :35
Reachability property qltransition_382 is true.
Reachability property qltransition_380 is true.
Reachability property qltransition_376 is true.
[2024-05-22 19:06:41] [INFO ] Invariant cache hit.
Reachability property qltransition_266 is true.
Reachability property qltransition_265 is true.
[2024-05-22 19:06:41] [INFO ] State equation strengthened by 40 read => feed constraints.
Reachability property qltransition_26 is true.
Reachability property qltransition_25 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_22 is true.
Reachability property qltransition_18 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,341 properties remain. new max is 16384
SDD size :848593 after 6.19373e+07
SDD proceeding with computation,341 properties remain. new max is 32768
SDD size :6.19373e+07 after 2.9523e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 83/83 constraints. Problems are: Problem set: 14 solved, 341 unsolved
SDD proceeding with computation,341 properties remain. new max is 65536
SDD size :2.9523e+08 after 1.06068e+09
(s404 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 3.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 5.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s30 1.0)
(s31 1.0)
(s33 1.0)
(s34 1.0)
(s44 1.0)
(s47 1.0)
(s51 1.0)
(s54 1.0)
(s57 1.0)
(s58 1.0)
(s65 1.0)
(s66 1.0)
(s67 2.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 3.0)
(s72 1.0)
(s73 1.0)
(s74 5.0)
(s75 5.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 3.0)
(s101 1.0)
(s102 1.0)
(s103 5.0)
(s104 9.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 5.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 3.0)
(s130 1.0)
(s131 1.0)
(s133 9.0)
(s134 5.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 5.0)
(s140 1.0)
(s141 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 3.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 5.0)
(s164 9.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s177 5.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 3.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 9.0)
(s195 5.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s201 5.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 3.0)
(s219 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 5.0)
(s226 9.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 5.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 3.0)
(s253 1.0)
(s254 1.0)
(s256 5.0)
(s257 9.0)
(s258 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 5.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 3.0)
(s284 1.0)
(s286 1.0)
(s287 5.0)
(s288 9.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s301 1.0)
(s302 5.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 3.0)
(s314 1.0)
(s315 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 9.0)
(s322 5.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s327 1.0)
(s328 5.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 3.0)
(s349 1.0)
(s350 1.0)
(s351 5.0)
(s352 9.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 5.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 3.0)
(s378 1.0)
(s379 1.0)
(s380 5.0)
(s381 9.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 5.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 3.0)
(s404 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1082 variables, and 83 constraints, problems are : Problem set: 14 solved, 341 unsolved in 5050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 83/97 constraints, State Equation: 0/552 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 79/79 constraints. Problems are: Problem set: 14 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/79 constraints. Problems are: Problem set: 14 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 32/492 variables, 6/85 constraints. Problems are: Problem set: 14 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/1082 variables, and 85 constraints, problems are : Problem set: 14 solved, 341 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 85/97 constraints, State Equation: 0/552 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/355 constraints, Known Traps: 0/0 constraints]
After SMT, in 10247ms problems are : Problem set: 14 solved, 341 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 460 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 552 transition count 521
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 521
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 30 place count 543 transition count 521
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 542 transition count 520
Applied a total of 31 rules in 66 ms. Remains 542 /552 variables (removed 10) and now considering 520/530 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 542/552 places, 520/530 transitions.
SDD proceeding with computation,341 properties remain. new max is 131072
SDD size :1.06068e+09 after 3.43189e+09
RANDOM walk for 4000000 steps (512685 resets) in 83680 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3330 resets) in 677 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3373 resets) in 829 ms. (48 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3434 resets) in 1012 ms. (39 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3462 resets) in 1103 ms. (36 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3437 resets) in 826 ms. (48 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3400 resets) in 713 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3395 resets) in 1181 ms. (33 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3436 resets) in 904 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 1093 ms. (36 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3419 resets) in 919 ms. (43 steps per ms) remains 341/341 properties
SDD proceeding with computation,341 properties remain. new max is 262144
SDD size :3.43189e+09 after 1.05536e+10
BEST_FIRST walk for 40002 steps (3377 resets) in 857 ms. (46 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3344 resets) in 884 ms. (45 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3385 resets) in 926 ms. (43 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3394 resets) in 756 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3323 resets) in 938 ms. (42 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3431 resets) in 726 ms. (55 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3386 resets) in 908 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3392 resets) in 893 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 903 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3399 resets) in 789 ms. (50 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3438 resets) in 849 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 788 ms. (50 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3377 resets) in 749 ms. (53 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3408 resets) in 671 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3409 resets) in 834 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 682 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3404 resets) in 739 ms. (54 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3421 resets) in 770 ms. (51 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 908 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3416 resets) in 874 ms. (45 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3433 resets) in 813 ms. (49 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3382 resets) in 810 ms. (49 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3392 resets) in 696 ms. (57 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3371 resets) in 981 ms. (40 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 915 ms. (43 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3372 resets) in 872 ms. (45 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3352 resets) in 764 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3337 resets) in 891 ms. (44 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3352 resets) in 790 ms. (50 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 684 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3423 resets) in 761 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3365 resets) in 649 ms. (61 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3359 resets) in 588 ms. (67 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3432 resets) in 749 ms. (53 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3368 resets) in 667 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40003 steps (3374 resets) in 846 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40004 steps (3436 resets) in 772 ms. (51 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40000 steps (3413 resets) in 845 ms. (47 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40001 steps (3391 resets) in 701 ms. (56 steps per ms) remains 341/341 properties
BEST_FIRST walk for 40002 steps (3362 resets) in 925 ms. (43 steps per ms) remains 341/341 properties
Reachability property qltransition_386 is true.
Reachability property qltransition_269 is true.
Reachability property qltransition_268 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,334 properties remain. new max is 262144
SDD size :1.05536e+10 after 2.33083e+10
SDD proceeding with computation,334 properties remain. new max is 524288
SDD size :2.33083e+10 after 3.54502e+10
SDD proceeding with computation,334 properties remain. new max is 1048576
SDD size :3.54502e+10 after 6.05581e+10
Interrupted probabilistic random walk after 3163390 steps, run timeout after 108001 ms. (steps per millisecond=29 ) properties seen :0 out of 341
Probabilistic random walk after 3163390 steps, saw 1581727 distinct states, run finished after 108001 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 520 rows 542 cols
[2024-05-22 19:09:16] [INFO ] Computed 99 invariants in 86 ms
[2024-05-22 19:09:16] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 38/489 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 32/521 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 11/532 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (OVERLAPS) 519/1051 variables, 532/629 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1051 variables, 44/673 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1051 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 11 (OVERLAPS) 10/1061 variables, 9/682 constraints. Problems are: Problem set: 0 solved, 334 unsolved
SMT process timed out in 45223ms, After SMT, problems are : Problem set: 0 solved, 334 unsolved
Fused 334 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 451 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 520/520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 541 transition count 519
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 541 transition count 519
Applied a total of 6 rules in 44 ms. Remains 541 /542 variables (removed 1) and now considering 519/520 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 541/542 places, 519/520 transitions.
RANDOM walk for 4000000 steps (513677 resets) in 79307 ms. (50 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3386 resets) in 516 ms. (77 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3345 resets) in 629 ms. (63 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 581 ms. (68 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3330 resets) in 596 ms. (67 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3362 resets) in 679 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 510 ms. (78 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3359 resets) in 539 ms. (74 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3421 resets) in 637 ms. (62 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 784 ms. (50 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3468 resets) in 662 ms. (60 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3352 resets) in 751 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3473 resets) in 781 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3412 resets) in 751 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3348 resets) in 643 ms. (62 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3415 resets) in 575 ms. (69 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3357 resets) in 731 ms. (54 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3397 resets) in 653 ms. (61 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3453 resets) in 743 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3346 resets) in 731 ms. (54 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3419 resets) in 649 ms. (61 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3375 resets) in 621 ms. (64 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3416 resets) in 754 ms. (52 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3434 resets) in 767 ms. (52 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3380 resets) in 600 ms. (66 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 612 ms. (65 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3429 resets) in 753 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3410 resets) in 623 ms. (64 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3347 resets) in 545 ms. (73 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3328 resets) in 716 ms. (55 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3402 resets) in 647 ms. (61 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3390 resets) in 688 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3344 resets) in 600 ms. (66 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3433 resets) in 712 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3419 resets) in 719 ms. (55 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 625 ms. (63 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3388 resets) in 630 ms. (63 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3326 resets) in 702 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3366 resets) in 712 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3411 resets) in 635 ms. (62 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3361 resets) in 574 ms. (69 steps per ms) remains 334/334 properties
SDD proceeding with computation,334 properties remain. new max is 2097152
BEST_FIRST walk for 40001 steps (3388 resets) in 772 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 559 ms. (71 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3473 resets) in 774 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3397 resets) in 592 ms. (67 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3364 resets) in 593 ms. (67 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3377 resets) in 599 ms. (66 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3382 resets) in 629 ms. (63 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 612 ms. (65 steps per ms) remains 334/334 properties
SDD size :6.05581e+10 after 1.12926e+11
BEST_FIRST walk for 40000 steps (3384 resets) in 727 ms. (54 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3396 resets) in 713 ms. (56 steps per ms) remains 334/334 properties
Interrupted probabilistic random walk after 4278438 steps, run timeout after 96001 ms. (steps per millisecond=44 ) properties seen :0 out of 334
Probabilistic random walk after 4278438 steps, saw 2139178 distinct states, run finished after 96001 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 519 rows 541 cols
[2024-05-22 19:12:10] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 19:12:10] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 449/900 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 63/963 variables, 29/516 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/963 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/963 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 83/1046 variables, 48/566 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1046/1060 variables, and 574 constraints, problems are : Problem set: 0 solved, 334 unsolved in 75034 ms.
Refiners :[State Equation: 528/541 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 449/900 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 317/804 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/1060 variables, and 804 constraints, problems are : Problem set: 0 solved, 334 unsolved in 75017 ms.
Refiners :[State Equation: 451/541 constraints, ReadFeed: 36/46 constraints, PredecessorRefiner: 317/334 constraints, Known Traps: 0/0 constraints]
After SMT, in 150172ms problems are : Problem set: 0 solved, 334 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 451 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 519/519 transitions.
Applied a total of 0 rules in 13 ms. Remains 541 /541 variables (removed 0) and now considering 519/519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 541/541 places, 519/519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 519/519 transitions.
Applied a total of 0 rules in 13 ms. Remains 541 /541 variables (removed 0) and now considering 519/519 (removed 0) transitions.
// Phase 1: matrix 519 rows 541 cols
[2024-05-22 19:14:40] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 19:14:40] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 519 rows 541 cols
[2024-05-22 19:14:40] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 19:14:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:14:42] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned [47, 53, 170, 240, 442, 512]
[2024-05-22 19:14:42] [INFO ] Actually due to overlaps returned [240, 170]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1435 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 539/541 places, 519/519 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 538 transition count 518
Applied a total of 2 rules in 28 ms. Remains 538 /539 variables (removed 1) and now considering 518/519 (removed 1) transitions.
// Phase 1: matrix 518 rows 538 cols
[2024-05-22 19:14:42] [INFO ] Computed 97 invariants in 41 ms
[2024-05-22 19:14:42] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 19:14:42] [INFO ] Invariant cache hit.
[2024-05-22 19:14:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:14:43] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned [47, 53, 439, 509]
[2024-05-22 19:14:43] [INFO ] Actually due to overlaps returned [509, 439]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1213 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 536/541 places, 518/519 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 536 transition count 517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 535 transition count 517
Applied a total of 2 rules in 39 ms. Remains 535 /536 variables (removed 1) and now considering 517/518 (removed 1) transitions.
// Phase 1: matrix 517 rows 535 cols
[2024-05-22 19:14:43] [INFO ] Computed 95 invariants in 39 ms
[2024-05-22 19:14:43] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 19:14:43] [INFO ] Invariant cache hit.
[2024-05-22 19:14:43] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:14:45] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2536 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 533/541 places, 517/519 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 533 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 532 transition count 516
Applied a total of 2 rules in 41 ms. Remains 532 /533 variables (removed 1) and now considering 516/517 (removed 1) transitions.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:14:45] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 19:14:46] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:14:46] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 19:14:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:14:46] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 532/541 places, 516/519 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 6196 ms. Remains : 532/541 places, 516/519 transitions.
RANDOM walk for 4000000 steps (576550 resets) in 102640 ms. (38 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 774 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3649 resets) in 733 ms. (54 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3725 resets) in 840 ms. (47 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 765 ms. (52 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3611 resets) in 705 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 692 ms. (57 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3683 resets) in 686 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3711 resets) in 1024 ms. (39 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3669 resets) in 840 ms. (47 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 761 ms. (52 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3618 resets) in 936 ms. (42 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3608 resets) in 663 ms. (60 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3677 resets) in 1025 ms. (38 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 1013 ms. (39 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3605 resets) in 1064 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3641 resets) in 745 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3618 resets) in 925 ms. (43 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3633 resets) in 905 ms. (44 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3602 resets) in 842 ms. (47 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3663 resets) in 994 ms. (40 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3635 resets) in 701 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3639 resets) in 719 ms. (55 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3656 resets) in 891 ms. (44 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3639 resets) in 922 ms. (43 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3676 resets) in 826 ms. (48 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3657 resets) in 783 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 875 ms. (45 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3626 resets) in 803 ms. (49 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3595 resets) in 789 ms. (50 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3702 resets) in 684 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3718 resets) in 931 ms. (42 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3610 resets) in 1062 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3595 resets) in 1057 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3621 resets) in 844 ms. (47 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3655 resets) in 710 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3595 resets) in 794 ms. (50 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3572 resets) in 852 ms. (46 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3680 resets) in 780 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3688 resets) in 910 ms. (43 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 834 ms. (47 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 752 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 883 ms. (45 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3649 resets) in 686 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3604 resets) in 665 ms. (60 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3657 resets) in 752 ms. (53 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3610 resets) in 932 ms. (42 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3668 resets) in 857 ms. (46 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3605 resets) in 957 ms. (41 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 682 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 767 ms. (52 steps per ms) remains 334/334 properties
SDD proceeding with computation,334 properties remain. new max is 4194304
SDD size :1.12926e+11 after 2.12486e+11
Probably explored full state space saw : 539301 states, properties seen :0
Probabilistic random walk after 1078629 steps, saw 539301 distinct states, run finished after 29046 ms. (steps per millisecond=37 ) properties seen :0
Detected timeout of ITS tools.
[2024-05-22 19:16:38] [INFO ] Flatten gal took : 40 ms
[2024-05-22 19:16:38] [INFO ] Applying decomposition
[2024-05-22 19:16:38] [INFO ] Flatten gal took : 34 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/graph1866973598726501932.txt' '-o' '/tmp/graph1866973598726501932.bin' '-w' '/tmp/graph1866973598726501932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1866973598726501932.bin' '-l' '-1' '-v' '-w' '/tmp/graph1866973598726501932.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:16:39] [INFO ] Decomposing Gal with order
[2024-05-22 19:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:16:39] [INFO ] Removed a total of 384 redundant transitions.
[2024-05-22 19:16:39] [INFO ] Flatten gal took : 226 ms
[2024-05-22 19:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 35 ms.
[2024-05-22 19:16:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11898216710081752990.gal : 21 ms
[2024-05-22 19:16:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10946472504210850308.prop : 6 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/ReachabilityCardinality11898216710081752990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10946472504210850308.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/ReachabilityCardinality10946472504210850308.prop.
SDD proceeding with computation,334 properties remain. new max is 4
SDD size :1 after 1769
SDD proceeding with computation,334 properties remain. new max is 8
SDD size :1769 after 1797
SDD proceeding with computation,334 properties remain. new max is 16
SDD size :1797 after 2203
SDD proceeding with computation,334 properties remain. new max is 32
SDD size :2203 after 7408
SDD proceeding with computation,334 properties remain. new max is 64
SDD size :7408 after 69569
SDD proceeding with computation,334 properties remain. new max is 128
SDD size :69569 after 1.1616e+06
SDD proceeding with computation,334 properties remain. new max is 256
SDD size :1.1616e+06 after 1.21175e+06
Interrupted probabilistic random walk after 4550802 steps, run timeout after 120001 ms. (steps per millisecond=37 ) properties seen :0 out of 334
Exhaustive walk after 4550802 steps, saw 2275467 distinct states, run finished after 120001 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:17:55] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:17:55] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 449/900 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 57/957 variables, 26/513 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/957 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/957 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 73/1030 variables, 38/553 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1030 variables, 8/561 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1030 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 10 (OVERLAPS) 18/1048 variables, 17/578 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 578 constraints, problems are : Problem set: 0 solved, 334 unsolved in 90022 ms.
Refiners :[State Equation: 532/532 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 449/900 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 317/804 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 334 unsolved
SMT process timed out in 180136ms, After SMT, problems are : Problem set: 0 solved, 334 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 451 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 516/516 transitions.
Applied a total of 0 rules in 34 ms. Remains 532 /532 variables (removed 0) and now considering 516/516 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 532/532 places, 516/516 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 516/516 transitions.
Applied a total of 0 rules in 19 ms. Remains 532 /532 variables (removed 0) and now considering 516/516 (removed 0) transitions.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:20:56] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 19:20:56] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:20:56] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 19:20:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:20:57] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2024-05-22 19:20:57] [INFO ] Redundant transitions in 27 ms returned []
Running 515 sub problems to find dead transitions.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:20:57] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:20:57] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (OVERLAPS) 516/1047 variables, 531/531 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1047 variables, 46/577 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1047 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 515 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 30303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31310 ms. Remains : 532/532 places, 516/516 transitions.
RANDOM walk for 400000 steps (57780 resets) in 13491 ms. (29 steps per ms) remains 451/451 properties
Running SMT prover for 451 properties.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:21:31] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 19:21:34] [INFO ] After 2888ms SMT Verify possible using state equation in real domain returned unsat :0 sat :451
[2024-05-22 19:21:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:21:43] [INFO ] After 8879ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :451
TRAPS : Iteration 0
SDD proceeding with computation,334 properties remain. new max is 512
SDD size :1.21175e+06 after 1.29188e+06
[2024-05-22 19:22:06] [INFO ] After 32448ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:451
[2024-05-22 19:22:06] [INFO ] After 35662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:451
[2024-05-22 19:22:10] [INFO ] After 3839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :451
[2024-05-22 19:22:38] [INFO ] After 27841ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :451
TRAPS : Iteration 0
[2024-05-22 19:22:38] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 21 ms to minimize.
[2024-05-22 19:22:39] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2024-05-22 19:22:39] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-05-22 19:22:40] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 3 ms to minimize.
[2024-05-22 19:22:40] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-05-22 19:22:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1809 ms
[2024-05-22 19:22:42] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-05-22 19:22:42] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-22 19:22:42] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-22 19:22:42] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-22 19:22:43] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-22 19:22:43] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-22 19:22:43] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:22:43] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:22:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 890 ms
[2024-05-22 19:22:43] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 2 ms to minimize.
[2024-05-22 19:22:44] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-22 19:22:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2024-05-22 19:22:44] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-22 19:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-22 19:22:45] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-05-22 19:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2024-05-22 19:22:45] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-22 19:22:45] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-05-22 19:22:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2024-05-22 19:22:47] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-22 19:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-05-22 19:22:47] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 19:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-22 19:22:48] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-22 19:22:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-22 19:22:48] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-22 19:22:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-22 19:22:49] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-22 19:22:49] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-22 19:22:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2024-05-22 19:22:49] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-22 19:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-22 19:22:51] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 19:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-22 19:22:51] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-22 19:22:51] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-22 19:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2024-05-22 19:22:51] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-22 19:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-05-22 19:22:52] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-22 19:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-22 19:22:53] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:22:54] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2024-05-22 19:22:54] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:22:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 920 ms
[2024-05-22 19:22:54] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-22 19:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-22 19:22:56] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-22 19:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-22 19:22:57] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 11 ms to minimize.
[2024-05-22 19:22:57] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-22 19:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2024-05-22 19:22:58] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-22 19:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-22 19:22:58] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-22 19:22:59] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:22:59] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-22 19:22:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2024-05-22 19:23:00] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-05-22 19:23:00] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2024-05-22 19:23:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2024-05-22 19:23:00] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-22 19:23:01] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-22 19:23:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2024-05-22 19:23:02] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:23:02] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:23:02] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 19:23:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 391 ms
[2024-05-22 19:23:03] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-22 19:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-22 19:23:03] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:23:04] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-22 19:23:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2024-05-22 19:23:04] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-22 19:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-05-22 19:23:04] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:23:04] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:23:05] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 2 ms to minimize.
[2024-05-22 19:23:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2024-05-22 19:23:06] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:23:06] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:23:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2024-05-22 19:23:07] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-05-22 19:23:07] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 0 ms to minimize.
[2024-05-22 19:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-22 19:23:13] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:23:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1177 ms
[2024-05-22 19:23:16] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 1
[2024-05-22 19:23:50] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2024-05-22 19:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-22 19:23:58] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-22 19:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-05-22 19:23:58] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-05-22 19:24:16] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-22 19:24:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-05-22 19:24:17] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:24:18] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:24:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-22 19:24:18] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-22 19:24:24] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-05-22 19:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-22 19:24:27] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-22 19:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-22 19:24:28] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-22 19:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-22 19:24:28] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:24:28] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:24:29] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-22 19:24:29] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:24:29] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:24:29] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:24:29] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:24:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 738 ms
TRAPS : Iteration 2
[2024-05-22 19:24:46] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-22 19:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-22 19:24:50] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:24:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-22 19:24:55] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-22 19:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2024-05-22 19:24:57] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-05-22 19:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1136 ms
[2024-05-22 19:25:02] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 3 ms to minimize.
[2024-05-22 19:25:02] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 3 ms to minimize.
[2024-05-22 19:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
TRAPS : Iteration 3
[2024-05-22 19:25:26] [INFO ] After 195844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :450
[2024-05-22 19:25:26] [INFO ] After 200013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :450
RANDOM walk for 4000000 steps (576995 resets) in 79294 ms. (50 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3622 resets) in 944 ms. (42 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3653 resets) in 1135 ms. (35 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3606 resets) in 1028 ms. (38 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3609 resets) in 1215 ms. (32 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3661 resets) in 1223 ms. (32 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3626 resets) in 1154 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3662 resets) in 1261 ms. (31 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 1212 ms. (32 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3678 resets) in 1063 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3620 resets) in 1310 ms. (30 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3559 resets) in 1064 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3660 resets) in 1232 ms. (32 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3679 resets) in 1149 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 1263 ms. (31 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 1087 ms. (36 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3643 resets) in 984 ms. (40 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3619 resets) in 1120 ms. (35 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 1108 ms. (36 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 1200 ms. (33 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3619 resets) in 1208 ms. (33 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3696 resets) in 1032 ms. (38 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 1066 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3627 resets) in 1052 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 1028 ms. (38 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3610 resets) in 1025 ms. (38 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 1161 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3650 resets) in 1124 ms. (35 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3654 resets) in 990 ms. (40 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3655 resets) in 1120 ms. (35 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3696 resets) in 1071 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3612 resets) in 1095 ms. (36 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3703 resets) in 1193 ms. (33 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3678 resets) in 930 ms. (42 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3662 resets) in 1147 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3619 resets) in 1181 ms. (33 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3707 resets) in 1133 ms. (35 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3617 resets) in 1159 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3635 resets) in 1084 ms. (36 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40004 steps (3653 resets) in 1009 ms. (39 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 959 ms. (41 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3672 resets) in 1105 ms. (36 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40000 steps (3669 resets) in 1122 ms. (35 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3670 resets) in 1236 ms. (32 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3607 resets) in 1077 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 1168 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3688 resets) in 1059 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3628 resets) in 1193 ms. (33 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 1071 ms. (37 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40003 steps (3664 resets) in 1143 ms. (34 steps per ms) remains 334/334 properties
BEST_FIRST walk for 40001 steps (3614 resets) in 1080 ms. (37 steps per ms) remains 334/334 properties
Detected timeout of ITS tools.
Probably explored full state space saw : 539301 states, properties seen :0
Probabilistic random walk after 1078629 steps, saw 539301 distinct states, run finished after 42826 ms. (steps per millisecond=25 ) properties seen :0
Interrupted probabilistic random walk after 3235427 steps, run timeout after 114001 ms. (steps per millisecond=28 ) properties seen :0 out of 334
Exhaustive walk after 3235427 steps, saw 1617781 distinct states, run finished after 114002 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:28:42] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:28:42] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 449/900 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 57/957 variables, 26/513 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/957 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/957 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 73/1030 variables, 38/553 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1030 variables, 8/561 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1030 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 10 (OVERLAPS) 18/1048 variables, 17/578 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1048 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 12 (OVERLAPS) 0/1048 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 578 constraints, problems are : Problem set: 0 solved, 334 unsolved in 105025 ms.
Refiners :[State Equation: 532/532 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 449/900 variables, 451/451 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 317/804 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 57/957 variables, 26/830 constraints. Problems are: Problem set: 0 solved, 334 unsolved
SMT process timed out in 210144ms, After SMT, problems are : Problem set: 0 solved, 334 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 451 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 516/516 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 516/516 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 532/532 places, 516/516 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 516/516 transitions.
Applied a total of 0 rules in 10 ms. Remains 532 /532 variables (removed 0) and now considering 516/516 (removed 0) transitions.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:32:12] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:32:12] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:32:12] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 19:32:12] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:32:13] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2024-05-22 19:32:13] [INFO ] Redundant transitions in 4 ms returned []
Running 515 sub problems to find dead transitions.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:32:13] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 19:32:13] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (OVERLAPS) 516/1047 variables, 531/531 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1047 variables, 46/577 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1047 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 515 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31022 ms. Remains : 532/532 places, 516/516 transitions.
RANDOM walk for 400000 steps (57647 resets) in 6490 ms. (61 steps per ms) remains 451/451 properties
Running SMT prover for 451 properties.
// Phase 1: matrix 516 rows 532 cols
[2024-05-22 19:32:45] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:32:48] [INFO ] After 2706ms SMT Verify possible using state equation in real domain returned unsat :0 sat :451
[2024-05-22 19:32:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 19:32:56] [INFO ] After 8331ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :451
TRAPS : Iteration 0
[2024-05-22 19:33:19] [INFO ] After 31334ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:451
[2024-05-22 19:33:19] [INFO ] After 34325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:451
[2024-05-22 19:33:23] [INFO ] After 3498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :451
[2024-05-22 19:33:50] [INFO ] After 26669ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :451
TRAPS : Iteration 0
[2024-05-22 19:33:50] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 4 ms to minimize.
[2024-05-22 19:33:50] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-05-22 19:33:50] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-22 19:33:51] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-22 19:33:51] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 3 ms to minimize.
[2024-05-22 19:33:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1567 ms
[2024-05-22 19:33:53] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-22 19:33:53] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:33:53] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-22 19:33:53] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-22 19:33:53] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-22 19:33:54] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-22 19:33:54] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 19:33:54] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-05-22 19:33:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 878 ms
[2024-05-22 19:33:54] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-22 19:33:54] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:33:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2024-05-22 19:33:55] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-22 19:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-22 19:33:55] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-05-22 19:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-22 19:33:56] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-22 19:33:56] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-22 19:33:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2024-05-22 19:33:58] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-22 19:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-22 19:33:58] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-22 19:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-22 19:33:58] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-22 19:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-22 19:33:59] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-22 19:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-22 19:34:00] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 19:34:00] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2024-05-22 19:34:00] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-22 19:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-05-22 19:34:01] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 19:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-05-22 19:34:01] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-22 19:34:01] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-22 19:34:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2024-05-22 19:34:02] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-22 19:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-22 19:34:02] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-22 19:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-22 19:34:03] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2024-05-22 19:34:03] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:34:03] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-22 19:34:03] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 794 ms
[2024-05-22 19:34:04] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-05-22 19:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-22 19:34:06] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-22 19:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-05-22 19:34:07] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-22 19:34:07] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-05-22 19:34:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2024-05-22 19:34:08] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-22 19:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-22 19:34:09] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:34:09] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:34:09] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:34:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2024-05-22 19:34:10] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:34:10] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-22 19:34:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2024-05-22 19:34:11] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 3 ms to minimize.
[2024-05-22 19:34:11] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-22 19:34:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2024-05-22 19:34:12] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-05-22 19:34:12] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2024-05-22 19:34:12] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2024-05-22 19:34:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2024-05-22 19:34:13] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-22 19:34:14] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:34:14] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:34:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2024-05-22 19:34:14] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-22 19:34:14] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:34:14] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:34:15] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:34:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2024-05-22 19:34:16] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-22 19:34:16] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:34:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2024-05-22 19:34:17] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-22 19:34:17] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2024-05-22 19:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-22 19:34:23] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2024-05-22 19:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1147 ms
[2024-05-22 19:34:26] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-22 19:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
TRAPS : Iteration 1
[2024-05-22 19:34:59] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-22 19:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-22 19:35:06] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-05-22 19:35:07] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-22 19:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-22 19:35:24] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-22 19:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-22 19:35:25] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:35:25] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:35:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-22 19:35:26] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-05-22 19:35:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-22 19:35:32] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-22 19:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-22 19:35:34] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2024-05-22 19:35:35] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-22 19:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:35:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 641 ms
TRAPS : Iteration 2
[2024-05-22 19:35:53] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-22 19:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-05-22 19:35:58] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-22 19:36:03] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-22 19:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-22 19:36:05] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-22 19:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1133 ms
[2024-05-22 19:36:09] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 4 ms to minimize.
[2024-05-22 19:36:09] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 3 ms to minimize.
[2024-05-22 19:36:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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-020"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-020, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r145-tall-171631145000352"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;