Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110000206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654186263836

Running Version 202205111006
[2022-06-02 16:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:11:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:11:05] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2022-06-02 16:11:05] [INFO ] Transformed 1064 places.
[2022-06-02 16:11:05] [INFO ] Transformed 998 transitions.
[2022-06-02 16:11:05] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 330 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 115459 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{2=1, 4=1}
Probabilistic random walk after 115459 steps, saw 57743 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :2
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
// Phase 1: matrix 998 rows 1064 cols
[2022-06-02 16:11:09] [INFO ] Invariants computation overflowed in 128 ms
[2022-06-02 16:11:10] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-02 16:11:24] [INFO ] After 13307ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :7
[2022-06-02 16:11:25] [INFO ] Deduced a trap composed of 423 places in 336 ms of which 8 ms to minimize.
[2022-06-02 16:11:25] [INFO ] Deduced a trap composed of 406 places in 321 ms of which 1 ms to minimize.
[2022-06-02 16:11:25] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 1 ms to minimize.
[2022-06-02 16:11:26] [INFO ] Deduced a trap composed of 48 places in 328 ms of which 1 ms to minimize.
[2022-06-02 16:11:26] [INFO ] Deduced a trap composed of 403 places in 310 ms of which 1 ms to minimize.
[2022-06-02 16:11:26] [INFO ] Deduced a trap composed of 400 places in 302 ms of which 1 ms to minimize.
[2022-06-02 16:11:27] [INFO ] Deduced a trap composed of 89 places in 286 ms of which 1 ms to minimize.
[2022-06-02 16:11:27] [INFO ] Deduced a trap composed of 420 places in 288 ms of which 1 ms to minimize.
[2022-06-02 16:11:27] [INFO ] Deduced a trap composed of 414 places in 315 ms of which 1 ms to minimize.
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 431 places in 281 ms of which 1 ms to minimize.
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 412 places in 285 ms of which 1 ms to minimize.
[2022-06-02 16:11:28] [INFO ] Deduced a trap composed of 442 places in 283 ms of which 1 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 397 places in 277 ms of which 1 ms to minimize.
[2022-06-02 16:11:29] [INFO ] Deduced a trap composed of 410 places in 282 ms of which 1 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 0 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 113 places in 282 ms of which 1 ms to minimize.
[2022-06-02 16:11:30] [INFO ] Deduced a trap composed of 422 places in 272 ms of which 1 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 103 places in 273 ms of which 1 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 91 places in 283 ms of which 1 ms to minimize.
[2022-06-02 16:11:31] [INFO ] Deduced a trap composed of 77 places in 289 ms of which 0 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 455 places in 283 ms of which 0 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 0 ms to minimize.
[2022-06-02 16:11:32] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 1 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 421 places in 284 ms of which 0 ms to minimize.
[2022-06-02 16:11:33] [INFO ] Deduced a trap composed of 139 places in 273 ms of which 1 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 376 places in 269 ms of which 2 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 410 places in 268 ms of which 1 ms to minimize.
[2022-06-02 16:11:34] [INFO ] Deduced a trap composed of 151 places in 286 ms of which 1 ms to minimize.
[2022-06-02 16:11:35] [INFO ] Deduced a trap composed of 125 places in 298 ms of which 1 ms to minimize.
[2022-06-02 16:11:35] [INFO ] Deduced a trap composed of 438 places in 304 ms of which 1 ms to minimize.
[2022-06-02 16:11:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 16:11:35] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 123599 ms.
Support contains 56 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1059 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.17 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 1058 transition count 805
Reduce places removed 192 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 211 rules applied. Total rules applied 406 place count 866 transition count 786
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 425 place count 847 transition count 786
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 425 place count 847 transition count 749
Deduced a syphon composed of 37 places in 7 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 499 place count 810 transition count 749
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 4 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 803 place count 658 transition count 597
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 12 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 857 place count 631 transition count 597
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 860 place count 631 transition count 594
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 863 place count 628 transition count 594
Free-agglomeration rule (complex) applied 86 times.
Iterating global reduction 4 with 86 rules applied. Total rules applied 949 place count 628 transition count 508
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 4 with 86 rules applied. Total rules applied 1035 place count 542 transition count 508
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 1116 place count 542 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1117 place count 541 transition count 507
Applied a total of 1117 rules in 373 ms. Remains 541 /1064 variables (removed 523) and now considering 507/998 (removed 491) transitions.
Finished structural reductions, in 1 iterations. Remains : 541/1064 places, 507/998 transitions.
Incomplete random walk after 1000000 steps, including 100008 resets, run finished after 16394 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 450871 steps, including 32114 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 464698 steps, including 33041 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 421728 steps, including 30196 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted Best-First random walk after 379022 steps, including 26986 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen 0
Interrupted Best-First random walk after 417648 steps, including 29781 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 413135 steps, including 29732 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 423944 steps, including 30362 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted probabilistic random walk after 7818116 steps, run timeout after 153001 ms. (steps per millisecond=51 ) properties seen :{3=1}
Probabilistic random walk after 7818116 steps, saw 3908443 distinct states, run finished after 153002 ms. (steps per millisecond=51 ) properties seen :1
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 507 rows 541 cols
[2022-06-02 16:17:04] [INFO ] Invariants computation overflowed in 104 ms
[2022-06-02 16:17:04] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:17:07] [INFO ] After 2907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-02 16:17:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:17:13] [INFO ] After 5711ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:17:13] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2022-06-02 16:17:13] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2022-06-02 16:17:13] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 0 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:17:14] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:17:15] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 0 ms to minimize.
[2022-06-02 16:17:16] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:17:16] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2022-06-02 16:17:16] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:17:16] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2706 ms
[2022-06-02 16:17:16] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:17:17] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 0 ms to minimize.
[2022-06-02 16:17:17] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:17:17] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2022-06-02 16:17:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 396 ms
[2022-06-02 16:17:17] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 0 ms to minimize.
[2022-06-02 16:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-06-02 16:17:21] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-06-02 16:17:21] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2022-06-02 16:17:21] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:17:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2022-06-02 16:17:22] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:17:22] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:17:22] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:17:22] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:17:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 534 ms
[2022-06-02 16:17:28] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2022-06-02 16:17:28] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2022-06-02 16:17:29] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2022-06-02 16:17:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2022-06-02 16:17:29] [INFO ] After 21794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8141 ms.
[2022-06-02 16:17:37] [INFO ] After 32994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 120003 ms.
Support contains 55 out of 541 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 541/541 places, 507/507 transitions.
Drop transitions 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 541 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 540 transition count 506
Applied a total of 2 rules in 56 ms. Remains 540 /541 variables (removed 1) and now considering 506/507 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/541 places, 506/507 transitions.
Incomplete random walk after 1000000 steps, including 100044 resets, run finished after 14177 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 475534 steps, including 33902 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 477845 steps, including 33976 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 338073 steps, including 24268 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen 0
Interrupted Best-First random walk after 307715 steps, including 22120 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 0
Interrupted Best-First random walk after 215695 steps, including 15360 resets, run timeout after 5001 ms. (steps per millisecond=43 ) properties seen 0
Interrupted Best-First random walk after 215774 steps, including 15366 resets, run timeout after 5001 ms. (steps per millisecond=43 ) properties seen 0
Probably explored full state space saw : 252894 states, properties seen :0
Probabilistic random walk after 505793 steps, saw 252894 distinct states, run finished after 7174 ms. (steps per millisecond=70 ) properties seen :0
Interrupted probabilistic random walk after 7981700 steps, run timeout after 132001 ms. (steps per millisecond=60 ) properties seen :{}
Exhaustive walk after 7981700 steps, saw 3991116 distinct states, run finished after 132003 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 506 rows 540 cols
[2022-06-02 16:22:40] [INFO ] Invariants computation overflowed in 51 ms
[2022-06-02 16:22:40] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:22:45] [INFO ] After 4718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-02 16:22:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:22:52] [INFO ] After 6654ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:22:52] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2022-06-02 16:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-02 16:22:59] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2022-06-02 16:22:59] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-06-02 16:23:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2022-06-02 16:23:00] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-06-02 16:23:00] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2022-06-02 16:23:00] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2022-06-02 16:23:00] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2022-06-02 16:23:00] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2022-06-02 16:23:00] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2022-06-02 16:23:01] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 1 ms to minimize.
[2022-06-02 16:23:01] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:23:01] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2022-06-02 16:23:01] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2022-06-02 16:23:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1429 ms
[2022-06-02 16:23:03] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-06-02 16:23:03] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:23:03] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:23:03] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:23:03] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2022-06-02 16:23:03] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:23:04] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 0 ms to minimize.
[2022-06-02 16:23:04] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:23:04] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:23:04] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:23:04] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:23:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1709 ms
[2022-06-02 16:23:04] [INFO ] After 19002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7700 ms.
[2022-06-02 16:23:12] [INFO ] After 31581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 123501 ms.
Support contains 55 out of 540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 506/506 transitions.
Applied a total of 0 rules in 24 ms. Remains 540 /540 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 506/506 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 506/506 transitions.
Applied a total of 0 rules in 18 ms. Remains 540 /540 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 540 cols
[2022-06-02 16:25:16] [INFO ] Invariants computation overflowed in 48 ms
[2022-06-02 16:25:16] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 506 rows 540 cols
[2022-06-02 16:25:16] [INFO ] Invariants computation overflowed in 47 ms
[2022-06-02 16:25:16] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:25:41] [INFO ] Implicit Places using invariants and state equation in 24507 ms returned [21, 386, 394, 416, 424, 446, 448, 453, 476, 482, 504, 509, 513]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 25023 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 527/540 places, 506/506 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 527 transition count 502
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 523 transition count 502
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 523 transition count 502
Applied a total of 9 rules in 51 ms. Remains 523 /527 variables (removed 4) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 523 cols
[2022-06-02 16:25:41] [INFO ] Computed 87 place invariants in 61 ms
[2022-06-02 16:25:41] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 502 rows 523 cols
[2022-06-02 16:25:41] [INFO ] Computed 87 place invariants in 66 ms
[2022-06-02 16:25:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:26:05] [INFO ] Implicit Places using invariants and state equation in 23499 ms returned [169, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23960 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 521/540 places, 502/506 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 502
Applied a total of 2 rules in 42 ms. Remains 521 /521 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 521 cols
[2022-06-02 16:26:05] [INFO ] Invariants computation overflowed in 35 ms
[2022-06-02 16:26:05] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 502 rows 521 cols
[2022-06-02 16:26:05] [INFO ] Invariants computation overflowed in 26 ms
[2022-06-02 16:26:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:26:35] [INFO ] Performed 488/521 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2022-06-02 16:26:38] [INFO ] Implicit Places using invariants and state equation in 32974 ms returned [355]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 33366 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 520/540 places, 502/506 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 520 transition count 502
Applied a total of 1 rules in 34 ms. Remains 520 /520 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 520 cols
[2022-06-02 16:26:38] [INFO ] Invariants computation overflowed in 45 ms
[2022-06-02 16:26:38] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 502 rows 520 cols
[2022-06-02 16:26:38] [INFO ] Invariants computation overflowed in 31 ms
[2022-06-02 16:26:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:26:57] [INFO ] Implicit Places using invariants and state equation in 18900 ms returned [315, 321, 350]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 19295 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 4 : 517/540 places, 502/506 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 516 transition count 501
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 516 transition count 501
Applied a total of 3 rules in 43 ms. Remains 516 /517 variables (removed 1) and now considering 501/502 (removed 1) transitions.
// Phase 1: matrix 501 rows 516 cols
[2022-06-02 16:26:57] [INFO ] Invariants computation overflowed in 44 ms
[2022-06-02 16:26:58] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 501 rows 516 cols
[2022-06-02 16:26:58] [INFO ] Invariants computation overflowed in 42 ms
[2022-06-02 16:26:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:27:28] [INFO ] Performed 502/516 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2022-06-02 16:27:29] [INFO ] Implicit Places using invariants and state equation in 30919 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31301 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 5 : 515/540 places, 501/506 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 501
Applied a total of 1 rules in 30 ms. Remains 515 /515 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 515 cols
[2022-06-02 16:27:29] [INFO ] Invariants computation overflowed in 37 ms
[2022-06-02 16:27:29] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 501 rows 515 cols
[2022-06-02 16:27:29] [INFO ] Invariants computation overflowed in 40 ms
[2022-06-02 16:27:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:27:57] [INFO ] Implicit Places using invariants and state equation in 28367 ms returned []
Implicit Place search using SMT with State Equation took 28747 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 6 : 515/540 places, 501/506 transitions.
Finished structural reductions, in 6 iterations. Remains : 515/540 places, 501/506 transitions.
Incomplete random walk after 1000000 steps, including 108872 resets, run finished after 14684 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 480949 steps, including 36593 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
Interrupted Best-First random walk after 478731 steps, including 36124 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 477570 steps, including 36143 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 434705 steps, including 33021 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 0
Interrupted Best-First random walk after 424913 steps, including 32160 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted Best-First random walk after 420839 steps, including 31853 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted probabilistic random walk after 8160994 steps, run timeout after 132001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 8160994 steps, saw 4079714 distinct states, run finished after 132002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 501 rows 515 cols
[2022-06-02 16:30:54] [INFO ] Invariants computation overflowed in 39 ms
[2022-06-02 16:30:54] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:30:58] [INFO ] After 4018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-02 16:30:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:31:09] [INFO ] After 10372ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:31:09] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:31:09] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2022-06-02 16:31:09] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:31:09] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 0 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2022-06-02 16:31:10] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2022-06-02 16:31:11] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 0 ms to minimize.
[2022-06-02 16:31:11] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:31:11] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2022-06-02 16:31:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1934 ms
[2022-06-02 16:31:11] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:31:12] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2022-06-02 16:31:12] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2022-06-02 16:31:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2022-06-02 16:31:17] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2022-06-02 16:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-06-02 16:31:19] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2022-06-02 16:31:19] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:31:19] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2022-06-02 16:31:20] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:31:20] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:31:20] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:31:20] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2022-06-02 16:31:20] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2022-06-02 16:31:21] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2022-06-02 16:31:21] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:31:21] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-06-02 16:31:21] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2022-06-02 16:31:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2315 ms
[2022-06-02 16:31:23] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:31:23] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-06-02 16:31:23] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:31:23] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2022-06-02 16:31:24] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2022-06-02 16:31:24] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2022-06-02 16:31:24] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:31:24] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:31:24] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:31:25] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 0 ms to minimize.
[2022-06-02 16:31:26] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 0 ms to minimize.
[2022-06-02 16:31:26] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2022-06-02 16:31:26] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2022-06-02 16:31:26] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2022-06-02 16:31:26] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3636 ms
[2022-06-02 16:31:26] [INFO ] After 27640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6540 ms.
[2022-06-02 16:31:33] [INFO ] After 38350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 120002 ms.
Support contains 55 out of 515 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 515/515 places, 501/501 transitions.
Applied a total of 0 rules in 17 ms. Remains 515 /515 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 515/515 places, 501/501 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 515/515 places, 501/501 transitions.
Applied a total of 0 rules in 12 ms. Remains 515 /515 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 515 cols
[2022-06-02 16:33:33] [INFO ] Invariants computation overflowed in 50 ms
[2022-06-02 16:33:33] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 501 rows 515 cols
[2022-06-02 16:33:33] [INFO ] Invariants computation overflowed in 36 ms
[2022-06-02 16:33:33] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:34:03] [INFO ] Implicit Places using invariants and state equation in 29490 ms returned [50, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 29863 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 513/515 places, 501/501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 512 transition count 500
Applied a total of 2 rules in 24 ms. Remains 512 /513 variables (removed 1) and now considering 500/501 (removed 1) transitions.
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:34:03] [INFO ] Invariants computation overflowed in 27 ms
[2022-06-02 16:34:03] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:34:03] [INFO ] Invariants computation overflowed in 27 ms
[2022-06-02 16:34:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:34:33] [INFO ] Performed 489/512 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-06-02 16:34:34] [INFO ] Implicit Places using invariants and state equation in 31547 ms returned []
Implicit Place search using SMT with State Equation took 31895 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 512/515 places, 500/501 transitions.
Finished structural reductions, in 2 iterations. Remains : 512/515 places, 500/501 transitions.
Incomplete random walk after 1000000 steps, including 108518 resets, run finished after 17564 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 348479 steps, including 26359 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 496613 steps, including 37505 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
Interrupted Best-First random walk after 440975 steps, including 33218 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 427260 steps, including 32307 resets, run timeout after 5001 ms. (steps per millisecond=85 ) properties seen 0
Interrupted Best-First random walk after 406948 steps, including 30887 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted Best-First random walk after 446222 steps, including 33694 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted probabilistic random walk after 7976663 steps, run timeout after 141001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 7976663 steps, saw 3987595 distinct states, run finished after 141001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:37:43] [INFO ] Invariants computation overflowed in 26 ms
[2022-06-02 16:37:43] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:37:48] [INFO ] After 4235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-02 16:37:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:37:56] [INFO ] After 8864ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-06-02 16:37:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 556 ms
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:37:57] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:37:58] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 0 ms to minimize.
[2022-06-02 16:37:59] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:37:59] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:37:59] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2022-06-02 16:37:59] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:37:59] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2022-06-02 16:38:00] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2022-06-02 16:38:00] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-06-02 16:38:00] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:38:00] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-06-02 16:38:01] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2022-06-02 16:38:01] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2022-06-02 16:38:01] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2022-06-02 16:38:01] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:38:01] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2022-06-02 16:38:01] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2022-06-02 16:38:02] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 0 ms to minimize.
[2022-06-02 16:38:02] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:38:02] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:38:03] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:38:03] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:38:03] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5927 ms
[2022-06-02 16:38:10] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2022-06-02 16:38:11] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2022-06-02 16:38:11] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:38:11] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2022-06-02 16:38:11] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2022-06-02 16:38:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 871 ms
[2022-06-02 16:38:13] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:38:13] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:38:13] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:38:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 370 ms
[2022-06-02 16:38:13] [INFO ] After 25461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8802 ms.
[2022-06-02 16:38:22] [INFO ] After 38644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 120000 ms.
Support contains 55 out of 512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 512 /512 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 500/500 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 512 /512 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:40:22] [INFO ] Invariants computation overflowed in 33 ms
[2022-06-02 16:40:22] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:40:22] [INFO ] Invariants computation overflowed in 26 ms
[2022-06-02 16:40:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:40:44] [INFO ] Implicit Places using invariants and state equation in 22021 ms returned []
Implicit Place search using SMT with State Equation took 22377 ms to find 0 implicit places.
[2022-06-02 16:40:44] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:40:44] [INFO ] Invariants computation overflowed in 27 ms
[2022-06-02 16:40:45] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 500/500 transitions.
Incomplete random walk after 1000000 steps, including 108367 resets, run finished after 18152 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 424429 steps, including 31961 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted Best-First random walk after 506977 steps, including 38549 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 459446 steps, including 34868 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 0
Interrupted Best-First random walk after 457903 steps, including 34611 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 0
Interrupted Best-First random walk after 452654 steps, including 34163 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 407994 steps, including 30797 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted probabilistic random walk after 9268609 steps, run timeout after 144001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 9268609 steps, saw 4633240 distinct states, run finished after 144001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:43:57] [INFO ] Invariants computation overflowed in 30 ms
[2022-06-02 16:43:57] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:44:01] [INFO ] After 4220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-02 16:44:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:44:10] [INFO ] After 8863ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:44:10] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2022-06-02 16:44:10] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 529 ms
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:44:11] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 0 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:44:12] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:44:13] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:44:13] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:44:13] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2022-06-02 16:44:13] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 0 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2022-06-02 16:44:14] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 0 ms to minimize.
[2022-06-02 16:44:15] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:44:15] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2022-06-02 16:44:15] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2022-06-02 16:44:15] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-06-02 16:44:16] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2022-06-02 16:44:16] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-06-02 16:44:16] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-06-02 16:44:17] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5833 ms
[2022-06-02 16:44:24] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:44:24] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 0 ms to minimize.
[2022-06-02 16:44:25] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-06-02 16:44:25] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2022-06-02 16:44:25] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2022-06-02 16:44:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 925 ms
[2022-06-02 16:44:27] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2022-06-02 16:44:27] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:44:27] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 0 ms to minimize.
[2022-06-02 16:44:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 368 ms
[2022-06-02 16:44:27] [INFO ] After 25784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9093 ms.
[2022-06-02 16:44:36] [INFO ] After 39240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 120000 ms.
Support contains 55 out of 512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 500/500 transitions.
Applied a total of 0 rules in 23 ms. Remains 512 /512 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 500/500 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 512 /512 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:46:36] [INFO ] Invariants computation overflowed in 32 ms
[2022-06-02 16:46:36] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:46:37] [INFO ] Invariants computation overflowed in 37 ms
[2022-06-02 16:46:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-02 16:47:05] [INFO ] Implicit Places using invariants and state equation in 28641 ms returned []
Implicit Place search using SMT with State Equation took 28985 ms to find 0 implicit places.
[2022-06-02 16:47:05] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:47:05] [INFO ] Invariants computation overflowed in 27 ms
[2022-06-02 16:47:05] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 512/512 places, 500/500 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 512 transition count 494
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 506 transition count 494
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 12 place count 506 transition count 470
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 60 place count 482 transition count 470
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 478 transition count 466
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 478 transition count 466
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 478 transition count 463
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 475 transition count 463
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 475 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 474 transition count 462
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 474 transition count 462
Applied a total of 77 rules in 85 ms. Remains 474 /512 variables (removed 38) and now considering 462/500 (removed 38) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 462 rows 474 cols
[2022-06-02 16:47:05] [INFO ] Computed 78 place invariants in 48 ms
[2022-06-02 16:47:06] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:47:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-02 16:47:06] [INFO ] [Nat]Absence check using 2 positive and 76 generalized place invariants in 31 ms returned sat
[2022-06-02 16:47:08] [INFO ] After 2420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-02 16:47:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:47:10] [INFO ] After 2236ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2022-06-02 16:47:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 925 ms
[2022-06-02 16:47:11] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2022-06-02 16:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-06-02 16:47:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2022-06-02 16:47:13] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-06-02 16:47:14] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2022-06-02 16:47:14] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2022-06-02 16:47:14] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2022-06-02 16:47:14] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-06-02 16:47:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 851 ms
[2022-06-02 16:47:14] [INFO ] Deduced a trap composed of 107 places in 60 ms of which 0 ms to minimize.
[2022-06-02 16:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-06-02 16:47:15] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2022-06-02 16:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-06-02 16:47:15] [INFO ] After 7147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2854 ms.
[2022-06-02 16:47:18] [INFO ] After 12598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-06-02 16:47:18] [INFO ] Flatten gal took : 122 ms
[2022-06-02 16:47:19] [INFO ] Flatten gal took : 64 ms
[2022-06-02 16:47:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17025117076281680348.gal : 17 ms
[2022-06-02 16:47:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15366630686091093584.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17025117076281680348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15366630686091093584.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15366630686091093584.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 14
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :14 after 23
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :23 after 34
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :34 after 49
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :49 after 260
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :260 after 518
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :518 after 1487
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1487 after 3829
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :3829 after 14401
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :14401 after 243608
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :243608 after 979151
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :979151 after 2.57149e+06
Detected timeout of ITS tools.
[2022-06-02 16:47:34] [INFO ] Flatten gal took : 55 ms
[2022-06-02 16:47:34] [INFO ] Applying decomposition
[2022-06-02 16:47:34] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12193184660719858149.txt' '-o' '/tmp/graph12193184660719858149.bin' '-w' '/tmp/graph12193184660719858149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12193184660719858149.bin' '-l' '-1' '-v' '-w' '/tmp/graph12193184660719858149.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:47:34] [INFO ] Decomposing Gal with order
[2022-06-02 16:47:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:47:34] [INFO ] Removed a total of 400 redundant transitions.
[2022-06-02 16:47:34] [INFO ] Flatten gal took : 121 ms
[2022-06-02 16:47:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 31 ms.
[2022-06-02 16:47:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17366471231001291063.gal : 12 ms
[2022-06-02 16:47:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2326168878515996725.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17366471231001291063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2326168878515996725.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2326168878515996725.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :14 after 23
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :23 after 34
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :34 after 43
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 77
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :77 after 358
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :358 after 587
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :587 after 1669
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1669 after 4578
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :4578 after 124615
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :124615 after 857649
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :857649 after 2.397e+06
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :2.397e+06 after 6.42346e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4555860413558319987
[2022-06-02 16:47:49] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4555860413558319987
Running compilation step : cd /tmp/ltsmin4555860413558319987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1032 ms.
Running link step : cd /tmp/ltsmin4555860413558319987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4555860413558319987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'DoubleExponentPT020ReachabilityCardinality01==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 16:48:04] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2079744330061650745
[2022-06-02 16:48:05] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-06-02 16:48:05] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:48:05] [INFO ] Applying decomposition
[2022-06-02 16:48:05] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-06-02 16:48:05] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:48:05] [INFO ] Flatten gal took : 38 ms
[2022-06-02 16:48:05] [INFO ] Flatten gal took : 92 ms
[2022-06-02 16:48:05] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4175038315410139789.txt' '-o' '/tmp/graph4175038315410139789.bin' '-w' '/tmp/graph4175038315410139789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4175038315410139789.bin' '-l' '-1' '-v' '-w' '/tmp/graph4175038315410139789.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:48:05] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:48:05] [INFO ] Decomposing Gal with order
[2022-06-02 16:48:05] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2079744330061650745
Running compilation step : cd /tmp/ltsmin2079744330061650745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 16:48:05] [INFO ] Input system was already deterministic with 500 transitions.
[2022-06-02 16:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:48:05] [INFO ] Removed a total of 702 redundant transitions.
[2022-06-02 16:48:05] [INFO ] Flatten gal took : 180 ms
[2022-06-02 16:48:05] [INFO ] Ran tautology test, simplified 0 / 6 in 427 ms.
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=0 took 17 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=0 took 0 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=1 took 11 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=1 took 0 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=1 took 2 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=1 took 1 ms
[2022-06-02 16:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 162 ms.
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=2 took 93 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=2 took 2 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=2 took 0 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=2 took 2 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=2 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=3 took 125 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=3 took 0 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=3 took 2 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:48:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=3 took 1 ms
[2022-06-02 16:48:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17383797995454646309.gal : 23 ms
[2022-06-02 16:48:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18133604955313822986.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17383797995454646309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18133604955313822986.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 500 rows 512 cols
[2022-06-02 16:48:05] [INFO ] Invariants computation overflowed in 26 ms
[2022-06-02 16:48:05] [INFO ] Computed 0 place invariants in 27 ms
Loading property file /tmp/ReachabilityCardinality18133604955313822986.prop.
[2022-06-02 16:48:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=4 took 222 ms
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 25
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :25 after 42
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :42 after 55
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :55 after 235
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :235 after 353
[2022-06-02 16:48:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=4 took 282 ms
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :353 after 926
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :926 after 5404
[2022-06-02 16:48:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=4 took 261 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5404 after 35167
[2022-06-02 16:48:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=4 took 277 ms
Compilation finished in 1975 ms.
Running link step : cd /tmp/ltsmin2079744330061650745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :35167 after 81628
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2079744330061650745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT020ReachabilityCardinality01==true'
[2022-06-02 16:48:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=4 took 341 ms
[2022-06-02 16:48:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=4 took 307 ms
[2022-06-02 16:48:07] [INFO ] Proved 512 variables to be positive in 1886 ms
[2022-06-02 16:48:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-02 16:48:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=0 took 11 ms
[2022-06-02 16:48:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-02 16:48:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=0 took 2 ms
[2022-06-02 16:48:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-02 16:48:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=0 took 5 ms
[2022-06-02 16:48:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-02 16:48:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=0 took 10 ms
[2022-06-02 16:48:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-14
[2022-06-02 16:48:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(SAT) depth K=0 took 11 ms
[2022-06-02 16:48:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2022-06-02 16:48:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=0 took 2 ms
[2022-06-02 16:48:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-02 16:48:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=1 took 354 ms
[2022-06-02 16:48:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-02 16:48:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=1 took 452 ms
[2022-06-02 16:48:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-02 16:48:09] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=1 took 272 ms
[2022-06-02 16:48:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=5 took 1740 ms
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :81628 after 182448
[2022-06-02 16:48:10] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=5 took 890 ms
[2022-06-02 16:48:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=5 took 1080 ms
[2022-06-02 16:48:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-02 16:48:12] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=1 took 3376 ms
[2022-06-02 16:48:13] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=5 took 2152 ms
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :182448 after 382467
[2022-06-02 16:48:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-14
[2022-06-02 16:48:15] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(SAT) depth K=1 took 3437 ms
[2022-06-02 16:48:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2022-06-02 16:48:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=1 took 1316 ms
[2022-06-02 16:48:23] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=5 took 9538 ms
[2022-06-02 16:48:25] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=5 took 2149 ms
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :382467 after 811721
[2022-06-02 16:48:31] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=6 took 6707 ms
[2022-06-02 16:48:35] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=6 took 3448 ms
[2022-06-02 16:48:39] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=6 took 3730 ms
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :811721 after 1.25091e+06
[2022-06-02 16:49:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=6 took 32470 ms
[2022-06-02 16:49:25] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=6 took 14011 ms
[2022-06-02 16:49:30] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=6 took 4630 ms
[2022-06-02 16:50:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=7 took 36405 ms
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :1.25091e+06 after 2.52454e+06
[2022-06-02 16:50:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-02 16:50:42] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=2 took 144873 ms
[2022-06-02 16:51:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=7 took 55550 ms
[2022-06-02 16:51:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=7 took 9463 ms
[2022-06-02 16:51:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-02 16:51:46] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=2 took 64486 ms
SDD proceeding with computation,6 properties remain. new max is 1048576
SDD size :2.52454e+06 after 4.71537e+06
[2022-06-02 16:52:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-02 16:52:02] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=2 took 15941 ms
[2022-06-02 16:53:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=7 took 113967 ms
[2022-06-02 16:53:23] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=7 took 17490 ms
[2022-06-02 16:53:32] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=7 took 9084 ms
[2022-06-02 16:53:45] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=8 took 12799 ms
[2022-06-02 16:54:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=8 took 26679 ms
SDD proceeding with computation,6 properties remain. new max is 2097152
[2022-06-02 16:55:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-02 16:55:51] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=2 took 228518 ms
SDD size :4.71537e+06 after 2.55957e+07
[2022-06-02 16:55:55] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=8 took 103366 ms
[2022-06-02 16:57:21] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=8 took 86335 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Initializing POR dependencies: labels 506, guards 500
pins2lts-mc-linux64( 4/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.052: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.055: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.055: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.060: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.379: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 1.568: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 1.568: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 1.567: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 1.569: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.569: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 1.568: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.570: There are 506 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.570: State length is 512, there are 500 groups
pins2lts-mc-linux64( 0/ 8), 1.570: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.570: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.570: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 1.570: Visible groups: 0 / 500, labels: 1 / 506
pins2lts-mc-linux64( 0/ 8), 1.570: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 1.570: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 1.568: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 1.568: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.627: ~59 levels ~960 states ~1040 transitions
pins2lts-mc-linux64( 0/ 8), 1.644: ~75 levels ~1920 states ~1984 transitions
pins2lts-mc-linux64( 0/ 8), 1.836: ~161 levels ~3840 states ~3912 transitions
pins2lts-mc-linux64( 0/ 8), 1.976: ~219 levels ~7680 states ~8176 transitions
pins2lts-mc-linux64( 0/ 8), 2.254: ~240 levels ~15360 states ~16952 transitions
pins2lts-mc-linux64( 0/ 8), 2.590: ~260 levels ~30720 states ~33864 transitions
pins2lts-mc-linux64( 0/ 8), 3.376: ~377 levels ~61440 states ~64520 transitions
pins2lts-mc-linux64( 2/ 8), 4.881: ~1656 levels ~122880 states ~124808 transitions
pins2lts-mc-linux64( 5/ 8), 7.549: ~3754 levels ~245760 states ~245000 transitions
pins2lts-mc-linux64( 1/ 8), 12.424: ~6413 levels ~491520 states ~493368 transitions
pins2lts-mc-linux64( 1/ 8), 21.087: ~13081 levels ~983040 states ~984944 transitions
pins2lts-mc-linux64( 1/ 8), 36.180: ~14212 levels ~1966080 states ~1979424 transitions
pins2lts-mc-linux64( 1/ 8), 65.903: ~15237 levels ~3932160 states ~3941920 transitions
pins2lts-mc-linux64( 6/ 8), 124.122: ~13085 levels ~7864320 states ~8005656 transitions
pins2lts-mc-linux64( 0/ 8), 241.908: ~19365 levels ~15728640 states ~15683768 transitions
pins2lts-mc-linux64( 1/ 8), 476.658: ~28134 levels ~31457280 states ~31375528 transitions
pins2lts-mc-linux64( 5/ 8), 583.002: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 583.069:
pins2lts-mc-linux64( 0/ 8), 583.069: mean standard work distribution: 0.4% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 583.069:
pins2lts-mc-linux64( 0/ 8), 583.069: Explored 37924305 states 38041783 transitions, fanout: 1.003
pins2lts-mc-linux64( 0/ 8), 583.069: Total exploration time 581.490 sec (581.440 sec minimum, 581.461 sec on average)
pins2lts-mc-linux64( 0/ 8), 583.069: States per second: 65219, Transitions per second: 65421
pins2lts-mc-linux64( 0/ 8), 583.069: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 583.069:
pins2lts-mc-linux64( 0/ 8), 583.069: Queue width: 8B, total height: 169240, memory: 1.29MB
pins2lts-mc-linux64( 0/ 8), 583.069: Tree memory: 546.2MB, 15.1 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 583.069: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 583.069: Stored 503 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 583.069: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 583.069: Est. total memory use: 547.5MB (~1025.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2079744330061650745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT020ReachabilityCardinality01==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2079744330061650745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DoubleExponentPT020ReachabilityCardinality01==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 16:57:57] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=8 took 36505 ms
[2022-06-02 16:58:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=8 took 49883 ms
[2022-06-02 16:59:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-14
[2022-06-02 16:59:12] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(SAT) depth K=2 took 201541 ms
[2022-06-02 16:59:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2022-06-02 16:59:19] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=2 took 7349 ms
[2022-06-02 17:00:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=9 took 74396 ms
SDD proceeding with computation,6 properties remain. new max is 4194304
SDD size :2.55957e+07 after 8.20269e+07
[2022-06-02 17:00:56] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=9 took 53978 ms
[2022-06-02 17:03:12] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=9 took 136167 ms
SDD proceeding with computation,6 properties remain. new max is 8388608
SDD size :8.20269e+07 after 2.12644e+08
[2022-06-02 17:07:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-02 17:07:09] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=3 took 469757 ms
[2022-06-02 17:07:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=9 took 274739 ms
[2022-06-02 17:09:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-02 17:09:56] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=3 took 166764 ms
[2022-06-02 17:10:15] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=9 took 148267 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110000206"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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