fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814800806
Last Updated
Jun 28, 2020

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15736.930 3600000.00 6328041.00 19653.40 ?FFF???????????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814800806.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800806
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 3.1K Mar 31 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 31 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.5M Mar 24 05:37 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-200-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-200-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590139524861

[2020-05-22 09:25:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 09:25:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 09:25:27] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2020-05-22 09:25:27] [INFO ] Transformed 10604 places.
[2020-05-22 09:25:27] [INFO ] Transformed 9998 transitions.
[2020-05-22 09:25:27] [INFO ] Parsed PT model containing 10604 places and 9998 transitions in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 1799 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 334 resets, run finished after 217 ms. (steps per millisecond=46 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 136 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 133 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 142 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 103 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 112 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 95 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 98 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 306852 steps, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 306852 steps, saw 153391 distinct states, run finished after 30001 ms. (steps per millisecond=10 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 9998 rows 10604 cols
[2020-05-22 09:26:01] [INFO ] Invariants computation overflowed in 568 ms
[2020-05-22 09:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:06] [INFO ] [Real]Absence check using state equation in 3994 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s131 (- t9486 t9487))") while checking expression at index 1
[2020-05-22 09:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:16] [INFO ] [Real]Absence check using state equation in 3916 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:21] [INFO ] [Real]Absence check using state equation in 4020 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:26] [INFO ] [Real]Absence check using state equation in 4020 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:31] [INFO ] [Real]Absence check using state equation in 3953 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:36] [INFO ] [Real]Absence check using state equation in 4018 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:41] [INFO ] [Real]Absence check using state equation in 3948 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:46] [INFO ] [Real]Absence check using state equation in 3951 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:51] [INFO ] [Real]Absence check using state equation in 4053 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:56] [INFO ] [Real]Absence check using state equation in 4102 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:27:01] [INFO ] [Real]Absence check using state equation in 3970 ms returned (error "Failed to check-sat")
[2020-05-22 09:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:06] [INFO ] [Real]Absence check using state equation in 4023 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:27:11] [INFO ] [Real]Absence check using state equation in 4094 ms returned (error "Failed to check-sat")
[2020-05-22 09:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:27:16] [INFO ] [Real]Absence check using state equation in 3937 ms returned (error "Failed to check-sat")
[2020-05-22 09:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:27:21] [INFO ] [Real]Absence check using state equation in 4035 ms returned (error "Failed to check-sat")
Support contains 71 out of 10604 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 18196 edges and 10604 vertex of which 10598 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.54 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2355 Post agglomeration using F-continuation condition.Transition count delta: 2355
Iterating post reduction 0 with 2358 rules applied. Total rules applied 2359 place count 10597 transition count 7641
Reduce places removed 2355 places and 0 transitions.
Iterating post reduction 1 with 2355 rules applied. Total rules applied 4714 place count 8242 transition count 7641
Performed 403 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 403 Pre rules applied. Total rules applied 4714 place count 8242 transition count 7238
Deduced a syphon composed of 403 places in 804 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 2 with 806 rules applied. Total rules applied 5520 place count 7839 transition count 7238
Performed 1774 Post agglomeration using F-continuation condition.Transition count delta: 1774
Deduced a syphon composed of 1774 places in 839 ms
Reduce places removed 1774 places and 0 transitions.
Iterating global reduction 2 with 3548 rules applied. Total rules applied 9068 place count 6065 transition count 5464
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 349 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9270 place count 5964 transition count 5464
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 255 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9472 place count 5863 transition count 5464
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 343 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9674 place count 5762 transition count 5464
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 81 places in 340 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 9836 place count 5681 transition count 5464
Free-agglomeration rule (complex) applied 806 times.
Iterating global reduction 2 with 806 rules applied. Total rules applied 10642 place count 5681 transition count 4658
Reduce places removed 806 places and 0 transitions.
Iterating post reduction 2 with 806 rules applied. Total rules applied 11448 place count 4875 transition count 4658
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 3 with 801 rules applied. Total rules applied 12249 place count 4875 transition count 4658
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12250 place count 4874 transition count 4657
Applied a total of 12250 rules in 10568 ms. Remains 4874 /10604 variables (removed 5730) and now considering 4657/9998 (removed 5341) transitions.
Finished structural reductions, in 1 iterations. Remains : 4874/10604 places, 4657/9998 transitions.
Incomplete random walk after 1000000 steps, including 128365 resets, run finished after 15208 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 508721 steps, including 43200 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 515781 steps, including 43607 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 511029 steps, including 43426 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 516399 steps, including 43749 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 517436 steps, including 43583 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 515206 steps, including 43576 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 500804 steps, including 42412 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 489641 steps, including 41392 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 480409 steps, including 40747 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 514217 steps, including 43680 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 478571 steps, including 40723 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 487548 steps, including 41356 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 499817 steps, including 42326 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 487935 steps, including 41167 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 476713 steps, including 40411 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 497811 steps, including 42079 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 717038 steps, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 717038 steps, saw 358242 distinct states, run finished after 30001 ms. (steps per millisecond=23 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4657 rows 4874 cols
[2020-05-22 09:29:38] [INFO ] Invariants computation overflowed in 134 ms
[2020-05-22 09:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:30:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:30:23] [INFO ] [Real]Absence check using state equation in 44533 ms returned (error "Failed to check-sat")
[2020-05-22 09:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:31:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:31:08] [INFO ] [Real]Absence check using state equation in 44555 ms returned (error "Failed to check-sat")
[2020-05-22 09:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:31:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:31:53] [INFO ] [Real]Absence check using state equation in 44499 ms returned (error "Failed to check-sat")
[2020-05-22 09:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:32:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:32:38] [INFO ] [Real]Absence check using state equation in 44515 ms returned (error "Failed to check-sat")
[2020-05-22 09:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:33:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:33:23] [INFO ] [Real]Absence check using state equation in 44575 ms returned unknown
[2020-05-22 09:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:34:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:34:08] [INFO ] [Real]Absence check using state equation in 44643 ms returned (error "Failed to check-sat")
[2020-05-22 09:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:34:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:34:53] [INFO ] [Real]Absence check using state equation in 44550 ms returned unknown
[2020-05-22 09:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:35:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:35:29] [INFO ] [Real]Absence check using state equation in 35337 ms returned unknown
[2020-05-22 09:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:35:43] [INFO ] [Real]Absence check using state equation in 14037 ms returned sat
[2020-05-22 09:35:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:36:01] [INFO ] [Nat]Absence check using state equation in 17340 ms returned sat
[2020-05-22 09:36:01] [INFO ] State equation strengthened by 779 read => feed constraints.
[2020-05-22 09:36:02] [INFO ] [Nat]Added 779 Read/Feed constraints in 315 ms returned sat
[2020-05-22 09:36:08] [INFO ] Deduced a trap composed of 2 places in 5738 ms
[2020-05-22 09:36:13] [INFO ] Deduced a trap composed of 7 places in 5288 ms
[2020-05-22 09:36:19] [INFO ] Deduced a trap composed of 12 places in 5464 ms
[2020-05-22 09:36:24] [INFO ] Deduced a trap composed of 9 places in 5383 ms
[2020-05-22 09:36:30] [INFO ] Deduced a trap composed of 4 places in 5369 ms
[2020-05-22 09:36:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s426 s1495 s2101 s2308) 0)") while checking expression at index 8
[2020-05-22 09:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:37:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:37:15] [INFO ] [Real]Absence check using state equation in 44510 ms returned (error "Failed to check-sat")
[2020-05-22 09:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:38:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:38:00] [INFO ] [Real]Absence check using state equation in 44632 ms returned (error "Failed to check-sat")
[2020-05-22 09:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:38:16] [INFO ] [Real]Absence check using state equation in 15763 ms returned sat
[2020-05-22 09:38:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:38:33] [INFO ] [Nat]Absence check using state equation in 15877 ms returned sat
[2020-05-22 09:38:33] [INFO ] [Nat]Added 779 Read/Feed constraints in 421 ms returned sat
[2020-05-22 09:38:39] [INFO ] Deduced a trap composed of 7 places in 5241 ms
[2020-05-22 09:38:44] [INFO ] Deduced a trap composed of 4 places in 5395 ms
[2020-05-22 09:38:50] [INFO ] Deduced a trap composed of 4 places in 5458 ms
[2020-05-22 09:38:55] [INFO ] Deduced a trap composed of 4 places in 5439 ms
[2020-05-22 09:39:01] [INFO ] Deduced a trap composed of 9 places in 5771 ms
[2020-05-22 09:39:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s326 s448 s476 s508 s528 s537 s548 s580 s2623) 0)") while checking expression at index 11
[2020-05-22 09:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:39:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:39:46] [INFO ] [Real]Absence check using state equation in 44701 ms returned (error "Failed to check-sat")
[2020-05-22 09:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:40:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:40:32] [INFO ] [Real]Absence check using state equation in 44481 ms returned (error "Failed to check-sat")
[2020-05-22 09:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:41:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:41:17] [INFO ] [Real]Absence check using state equation in 44631 ms returned (error "Failed to check-sat")
[2020-05-22 09:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:41:48] [INFO ] [Real]Absence check using state equation in 31099 ms returned sat
[2020-05-22 09:41:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:42:21] [INFO ] [Nat]Absence check using state equation in 32817 ms returned sat
[2020-05-22 09:42:24] [INFO ] [Nat]Added 779 Read/Feed constraints in 2203 ms returned sat
[2020-05-22 09:42:28] [INFO ] Deduced a trap composed of 2 places in 4365 ms
[2020-05-22 09:42:33] [INFO ] Deduced a trap composed of 4 places in 4366 ms
[2020-05-22 09:42:37] [INFO ] Deduced a trap composed of 7 places in 4293 ms
[2020-05-22 09:42:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s52 s580 s2674 s2832 s3851 s4724 s4823) 0)") while checking expression at index 15
Support contains 71 out of 4874 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4874/4874 places, 4657/4657 transitions.
Applied a total of 0 rules in 707 ms. Remains 4874 /4874 variables (removed 0) and now considering 4657/4657 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4874/4874 places, 4657/4657 transitions.
Starting structural reductions, iteration 0 : 4874/4874 places, 4657/4657 transitions.
Applied a total of 0 rules in 619 ms. Remains 4874 /4874 variables (removed 0) and now considering 4657/4657 (removed 0) transitions.
// Phase 1: matrix 4657 rows 4874 cols
[2020-05-22 09:42:39] [INFO ] Invariants computation overflowed in 86 ms
[2020-05-22 09:43:09] [INFO ] Performed 2370/4874 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-22 09:43:39] [INFO ] Performed 4831/4874 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-05-22 09:43:39] [INFO ] Implicit Places using invariants in 60857 ms returned []
// Phase 1: matrix 4657 rows 4874 cols
[2020-05-22 09:43:40] [INFO ] Invariants computation overflowed in 184 ms
[2020-05-22 09:44:11] [INFO ] Performed 1671/4874 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-22 09:44:41] [INFO ] Performed 3145/4874 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-05-22 09:45:11] [INFO ] Performed 4644/4874 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2020-05-22 09:45:14] [INFO ] Implicit Places using invariants and state equation in 95051 ms returned []
Implicit Place search using SMT with State Equation took 155911 ms to find 0 implicit places.
[2020-05-22 09:45:15] [INFO ] Redundant transitions in 643 ms returned []
// Phase 1: matrix 4657 rows 4874 cols
[2020-05-22 09:45:15] [INFO ] Invariants computation overflowed in 130 ms
[2020-05-22 09:45:41] [INFO ] Dead Transitions using invariants and state equation in 25968 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4874/4874 places, 4657/4657 transitions.
Incomplete random walk after 100000 steps, including 12795 resets, run finished after 1663 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4657 rows 4874 cols
[2020-05-22 09:45:43] [INFO ] Invariants computation overflowed in 114 ms
[2020-05-22 09:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:46:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:46:03] [INFO ] [Real]Absence check using state equation in 19624 ms returned (error "Failed to check-sat")
[2020-05-22 09:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:46:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:46:23] [INFO ] [Real]Absence check using state equation in 19536 ms returned unknown
[2020-05-22 09:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:46:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:46:43] [INFO ] [Real]Absence check using state equation in 19599 ms returned unknown
[2020-05-22 09:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:47:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:47:03] [INFO ] [Real]Absence check using state equation in 19470 ms returned (error "Failed to check-sat")
[2020-05-22 09:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:47:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:47:23] [INFO ] [Real]Absence check using state equation in 19479 ms returned (error "Failed to check-sat")
[2020-05-22 09:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:47:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:47:43] [INFO ] [Real]Absence check using state equation in 19564 ms returned (error "Failed to check-sat")
[2020-05-22 09:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:48:03] [INFO ] [Real]Absence check using state equation in 19614 ms returned (error "Failed to check-sat")
[2020-05-22 09:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:23] [INFO ] [Real]Absence check using state equation in 19509 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:39] [INFO ] [Real]Absence check using state equation in 15568 ms returned sat
[2020-05-22 09:48:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:56] [INFO ] [Nat]Absence check using state equation in 15942 ms returned sat
[2020-05-22 09:48:56] [INFO ] State equation strengthened by 779 read => feed constraints.
[2020-05-22 09:48:56] [INFO ] [Nat]Added 779 Read/Feed constraints in 303 ms returned sat
[2020-05-22 09:49:01] [INFO ] Deduced a trap composed of 2 places in 5085 ms
[2020-05-22 09:49:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s3851 s4363) 0)") while checking expression at index 8
[2020-05-22 09:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:49:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:49:21] [INFO ] [Real]Absence check using state equation in 19533 ms returned (error "Failed to check-sat")
[2020-05-22 09:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:49:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:49:41] [INFO ] [Real]Absence check using state equation in 19496 ms returned (error "Failed to check-sat")
[2020-05-22 09:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:50:00] [INFO ] [Real]Absence check using state equation in 17659 ms returned sat
[2020-05-22 09:50:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:50:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:50:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:50:20] [INFO ] [Nat]Absence check using state equation in 19556 ms returned (error "Failed to check-sat")
[2020-05-22 09:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:50:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:50:40] [INFO ] [Real]Absence check using state equation in 19528 ms returned unknown
[2020-05-22 09:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:51:00] [INFO ] [Real]Absence check using state equation in 19603 ms returned unknown
[2020-05-22 09:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:51:20] [INFO ] [Real]Absence check using state equation in 19514 ms returned (error "Failed to check-sat")
[2020-05-22 09:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:51:40] [INFO ] [Real]Absence check using state equation in 19494 ms returned (error "Failed to check-sat")
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 4874 transition count 4651
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 4868 transition count 4651
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 375 Pre rules applied. Total rules applied 12 place count 4868 transition count 4276
Deduced a syphon composed of 375 places in 294 ms
Reduce places removed 375 places and 0 transitions.
Iterating global reduction 2 with 750 rules applied. Total rules applied 762 place count 4493 transition count 4276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 763 place count 4493 transition count 4275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 764 place count 4492 transition count 4275
Applied a total of 764 rules in 1548 ms. Remains 4492 /4874 variables (removed 382) and now considering 4275/4657 (removed 382) transitions.
// Phase 1: matrix 4275 rows 4492 cols
[2020-05-22 09:51:41] [INFO ] Invariants computation overflowed in 80 ms
[2020-05-22 09:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:52:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:52:27] [INFO ] [Real]Absence check using state equation in 44585 ms returned (error "Failed to check-sat")
[2020-05-22 09:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:52:57] [INFO ] [Real]Absence check using state equation in 30207 ms returned unsat
[2020-05-22 09:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:53:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:53:42] [INFO ] [Real]Absence check using state equation in 44589 ms returned unknown
[2020-05-22 09:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:54:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:54:27] [INFO ] [Real]Absence check using state equation in 44638 ms returned (error "Failed to check-sat")
[2020-05-22 09:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:55:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:55:12] [INFO ] [Real]Absence check using state equation in 44683 ms returned (error "Failed to check-sat")
[2020-05-22 09:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:55:22] [INFO ] [Real]Absence check using state equation in 9662 ms returned sat
[2020-05-22 09:55:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:56:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:56:08] [INFO ] [Nat]Absence check using state equation in 44634 ms returned (error "Failed to check-sat")
[2020-05-22 09:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:56:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:56:53] [INFO ] [Real]Absence check using state equation in 44513 ms returned (error "Failed to check-sat")
[2020-05-22 09:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:57:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:57:26] [INFO ] [Real]Absence check using state equation in 33375 ms returned unknown
[2020-05-22 09:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:58:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:58:11] [INFO ] [Real]Absence check using state equation in 44664 ms returned (error "Failed to check-sat")
[2020-05-22 09:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:58:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:58:56] [INFO ] [Real]Absence check using state equation in 44510 ms returned (error "Failed to check-sat")
[2020-05-22 09:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:59:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:59:42] [INFO ] [Real]Absence check using state equation in 44546 ms returned (error "Failed to check-sat")
[2020-05-22 09:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:59:56] [INFO ] [Real]Absence check using state equation in 14025 ms returned sat
[2020-05-22 09:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 10:00:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:00:41] [INFO ] [Nat]Absence check using state equation in 44663 ms returned (error "Failed to check-sat")
[2020-05-22 10:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 10:01:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:01:26] [INFO ] [Real]Absence check using state equation in 44394 ms returned (error "Failed to check-sat")
[2020-05-22 10:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 10:02:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:02:11] [INFO ] [Real]Absence check using state equation in 44605 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 10:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 10:02:44] [INFO ] [Real]Absence check using state equation in 32330 ms returned sat
[2020-05-22 10:02:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 10:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 10:03:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:03:29] [INFO ] [Nat]Absence check using state equation in 44530 ms returned (error "Failed to check-sat")
[2020-05-22 10:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 10:03:59] [INFO ] [Real]Absence check using state equation in 29593 ms returned sat
[2020-05-22 10:03:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 10:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 10:04:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:04:44] [INFO ] [Nat]Absence check using state equation in 44515 ms returned (error "Failed to check-sat")
FORMULA DoubleExponent-PT-200-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2020-05-22 10:04:47] [INFO ] Flatten gal took : 1803 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 10:04:50] [INFO ] Applying decomposition
[2020-05-22 10:04:50] [INFO ] Flatten gal took : 2583 ms
[2020-05-22 10:04:50] [INFO ] Input system was already deterministic with 4657 transitions.
[2020-05-22 10:04:50] [INFO ] Too many transitions (4657) to apply POR reductions. Disabling POR matrices.
[2020-05-22 10:04:52] [INFO ] Input system was already deterministic with 4657 transitions.
[2020-05-22 10:04:52] [INFO ] Flatten gal took : 2237 ms
[2020-05-22 10:04:52] [INFO ] Built C files in 3269ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph18036943242564927600.txt, -o, /tmp/graph18036943242564927600.bin, -w, /tmp/graph18036943242564927600.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph18036943242564927600.bin, -l, -1, -v, -w, /tmp/graph18036943242564927600.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 10:04:54] [INFO ] Decomposing Gal with order
[2020-05-22 10:04:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 10:04:55] [INFO ] Ran tautology test, simplified 0 / 15 in 4840 ms.
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(UNSAT) depth K=0 took 88 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-03(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(UNSAT) depth K=0 took 7 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(UNSAT) depth K=0 took 3 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(UNSAT) depth K=0 took 7 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(UNSAT) depth K=0 took 7 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(UNSAT) depth K=0 took 7 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-11(UNSAT) depth K=0 took 7 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-12(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-13(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-14(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-15(UNSAT) depth K=0 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(UNSAT) depth K=1 took 26 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-03(UNSAT) depth K=1 took 7 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(UNSAT) depth K=1 took 0 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(UNSAT) depth K=1 took 0 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(UNSAT) depth K=1 took 1 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(UNSAT) depth K=1 took 12 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-11(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-12(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-13(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-14(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:04:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-15(UNSAT) depth K=1 took 11 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 4657 rows 4874 cols
[2020-05-22 10:04:59] [INFO ] Invariants computation overflowed in 141 ms
Total of 0 invariants.
[2020-05-22 10:04:59] [INFO ] Computed 0 place invariants in 144 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(UNSAT) depth K=2 took 2186 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(UNSAT) depth K=2 took 15 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-03(UNSAT) depth K=2 took 11 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(UNSAT) depth K=2 took 6 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(UNSAT) depth K=2 took 2 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(UNSAT) depth K=2 took 3 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(UNSAT) depth K=2 took 11 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(UNSAT) depth K=2 took 15 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(UNSAT) depth K=2 took 7 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(UNSAT) depth K=2 took 7 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-11(UNSAT) depth K=2 took 2 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-12(UNSAT) depth K=2 took 2 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-13(UNSAT) depth K=2 took 2 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-14(UNSAT) depth K=2 took 3 ms
[2020-05-22 10:04:59] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-15(UNSAT) depth K=2 took 2 ms
[2020-05-22 10:04:59] [INFO ] Removed a total of 66560 redundant transitions.
[2020-05-22 10:04:59] [INFO ] Flatten gal took : 3131 ms
[2020-05-22 10:05:02] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(UNSAT) depth K=3 took 2474 ms
[2020-05-22 10:05:02] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(UNSAT) depth K=3 took 910 ms
[2020-05-22 10:05:03] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-03(UNSAT) depth K=3 took 880 ms
[2020-05-22 10:05:04] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(UNSAT) depth K=3 took 889 ms
[2020-05-22 10:05:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2089 labels/synchronizations in 4727 ms.
[2020-05-22 10:05:05] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(UNSAT) depth K=3 took 896 ms
[2020-05-22 10:05:06] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(UNSAT) depth K=3 took 991 ms
[2020-05-22 10:05:07] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 138 ms
[2020-05-22 10:05:07] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : DoubleExponent-PT-200-ReachabilityCardinality-00 with value :(gu905.p5370<=gu905.p9349)
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-02 with value :((((gu380.p4117<=gu380.p7092)&&(gi23.gu927.p9560<=gi23.gu927.p8499))&&(gi2.gi1.gi0.gi0.gi0.gu194.p2268>=2))&&(gu844.p4120<=gu844.p8753))
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-03 with value :(gi2.gi0.gi3.gi10.gi4.gu873.p945>=3)
Read [invariant] property : DoubleExponent-PT-200-ReachabilityCardinality-04 with value :((gi3.gu230.p262>=2)||(gu514.p5487<=gu514.p2832))
Read [invariant] property : DoubleExponent-PT-200-ReachabilityCardinality-05 with value :((((gi2.gi1.gi0.gi10.gi0.gu353.p3969>=3)||(gi2.gi2.gi2.gi4.gi1.gu59.p10562>=2))||(gu250.p2849<=gu250.p2730))||((gi20.gu178.p8760<=gi20.gu178.p2129)&&(gi13.gu487.p5277>=1)))
Read [invariant] property : DoubleExponent-PT-200-ReachabilityCardinality-06 with value :((((gi2.gi0.gi3.gi3.gi0.gu165.p2029>=1)||(gi3.gu520.p193<=gi3.gu520.p5531))||((gi2.gi2.gi2.gi15.gu840.p8726>=3)&&(gi2.gi1.gi0.gi22.gi0.gu551.p5870>=3)))||(((gu42.p2470<=gu42.p10369)&&(gu498.p5360<=gu498.p6535))&&(gu312.p345<=gu312.p6786)))
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-07 with value :((((gu591.p6232>gu591.p5424)||(gi2.gi1.gi0.gi15.gi3.gu423.p4605>=2))||(gi2.gi1.gi0.gi0.gu212.p2438>=2))&&((gu534.p5693>gu534.p8356)||(gi10.gu704.p7347>gi10.gu704.p4911)))
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-08 with value :(gi2.gi1.gi0.gi3.gi6.gu306.p3400>=3)
Read [invariant] property : DoubleExponent-PT-200-ReachabilityCardinality-09 with value :(((gi2.gi2.gi2.gi15.gi2.gu845.p8777<1)||(gu30.p3161>gu30.p1026))||(gi2.gi1.gi0.gi18.gi3.gu469.p5051>=1))
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-10 with value :(gi2.gi1.gi4.gu592.p6233>=2)
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-11 with value :((((gi5.gu290.p3726>gi5.gu290.p3215)&&(gi2.gi1.gi4.gu588.p6212<3))&&(gu441.p7666>gu441.p4748))&&(gu641.p6717>gu641.p5282))
Read [invariant] property : DoubleExponent-PT-200-ReachabilityCardinality-12 with value :(gi2.gi1.gi0.gi11.gi1.gu372.p4057<3)
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-13 with value :(((gi11.gu786.p8222>gi11.gu786.p5144)||(gu257.p2892>gu257.p9204))&&((gi13.gu435.p5216>gi13.gu435.p4715)||(gi2.gi1.gi0.gi17.gu455.p4882<2)))
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-14 with value :(gi17.gu219.p6157>gi17.gu219.p2497)
Read [reachable] property : DoubleExponent-PT-200-ReachabilityCardinality-15 with value :(((gi8.gu545.p5794>gi8.gu545.p4686)&&(gi2.gi2.gi2.gi17.gi4.gu866.p8993<3))&&(gi2.gi2.gi2.gi3.gi2.gu38.p10343<3))
[2020-05-22 10:05:09] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(UNSAT) depth K=3 took 2663 ms
[2020-05-22 10:05:11] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(UNSAT) depth K=3 took 1984 ms
[2020-05-22 10:05:12] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(UNSAT) depth K=3 took 915 ms
[2020-05-22 10:05:13] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(UNSAT) depth K=3 took 920 ms
[2020-05-22 10:05:14] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-11(UNSAT) depth K=3 took 1763 ms
[2020-05-22 10:05:15] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-12(UNSAT) depth K=3 took 922 ms
[2020-05-22 10:05:16] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-13(UNSAT) depth K=3 took 941 ms
[2020-05-22 10:05:18] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-14(UNSAT) depth K=3 took 1783 ms
[2020-05-22 10:05:19] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-15(UNSAT) depth K=3 took 936 ms
[2020-05-22 10:05:25] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(UNSAT) depth K=4 took 5537 ms
[2020-05-22 10:07:09] [INFO ] Proved 4874 variables to be positive in 130841 ms
[2020-05-22 10:07:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-00
[2020-05-22 10:07:10] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(SAT) depth K=0 took 1251 ms
Compilation finished in 138718 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 116 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT200ReachabilityCardinality00==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT200ReachabilityCardinality00==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT200ReachabilityCardinality00==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 10:07:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-02
[2020-05-22 10:07:11] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(SAT) depth K=0 took 1078 ms
[2020-05-22 10:07:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-03
[2020-05-22 10:07:12] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-03(SAT) depth K=0 took 950 ms
[2020-05-22 10:07:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-04
[2020-05-22 10:07:13] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(SAT) depth K=0 took 864 ms
[2020-05-22 10:07:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-05
[2020-05-22 10:07:14] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(SAT) depth K=0 took 807 ms
SDD proceeding with computation, new max is 4
[2020-05-22 10:07:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-06
[2020-05-22 10:07:15] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(SAT) depth K=0 took 753 ms
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
[2020-05-22 10:07:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-07
[2020-05-22 10:07:16] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(SAT) depth K=0 took 708 ms
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-22 10:07:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-08
[2020-05-22 10:07:16] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(SAT) depth K=0 took 674 ms
SDD proceeding with computation, new max is 4096
[2020-05-22 10:07:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-09
[2020-05-22 10:07:17] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(SAT) depth K=0 took 647 ms
SDD proceeding with computation, new max is 8192
[2020-05-22 10:07:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-10
[2020-05-22 10:07:18] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(SAT) depth K=0 took 623 ms
[2020-05-22 10:07:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-11
[2020-05-22 10:07:18] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-11(SAT) depth K=0 took 729 ms
SDD proceeding with computation, new max is 16384
[2020-05-22 10:07:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-12
[2020-05-22 10:07:19] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-12(SAT) depth K=0 took 701 ms
[2020-05-22 10:07:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-13
[2020-05-22 10:07:20] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-13(SAT) depth K=0 took 579 ms
[2020-05-22 10:07:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-14
[2020-05-22 10:07:20] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-14(SAT) depth K=0 took 571 ms
[2020-05-22 10:07:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-15
[2020-05-22 10:07:21] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-15(SAT) depth K=0 took 556 ms
SDD proceeding with computation, new max is 32768
[2020-05-22 10:07:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-00
[2020-05-22 10:07:26] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(SAT) depth K=1 took 4973 ms
SDD proceeding with computation, new max is 65536
[2020-05-22 10:07:43] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-200-ReachabilityCardinality-02
[2020-05-22 10:07:43] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-200-ReachabilityCardinality-02
FORMULA DoubleExponent-PT-200-ReachabilityCardinality-02 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2020-05-22 10:07:43] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(FALSE) depth K=1 took 17092 ms
[2020-05-22 10:07:45] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-200-ReachabilityCardinality-03
[2020-05-22 10:07:45] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-200-ReachabilityCardinality-03
FORMULA DoubleExponent-PT-200-ReachabilityCardinality-03 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2020-05-22 10:07:45] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-03(FALSE) depth K=1 took 1544 ms
[2020-05-22 10:07:47] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-02(UNSAT) depth K=4 took 141903 ms
[2020-05-22 10:07:53] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(UNSAT) depth K=4 took 6515 ms
SDD proceeding with computation, new max is 131072
[2020-05-22 10:08:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-04
[2020-05-22 10:08:01] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(SAT) depth K=1 took 16166 ms
[2020-05-22 10:08:03] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(UNSAT) depth K=4 took 10350 ms
[2020-05-22 10:08:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-05
[2020-05-22 10:08:11] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(SAT) depth K=1 took 9996 ms
[2020-05-22 10:08:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-200-ReachabilityCardinality-06
[2020-05-22 10:08:19] [INFO ] KInduction solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(SAT) depth K=1 took 8377 ms
SDD proceeding with computation, new max is 262144
[2020-05-22 10:11:21] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(UNSAT) depth K=4 took 197048 ms
[2020-05-22 10:11:30] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(UNSAT) depth K=4 took 9203 ms
[2020-05-22 10:12:20] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(UNSAT) depth K=4 took 50550 ms
[2020-05-22 10:12:29] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(UNSAT) depth K=4 took 8603 ms
[2020-05-22 10:12:44] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(UNSAT) depth K=4 took 14830 ms
SDD proceeding with computation, new max is 524288
[2020-05-22 10:12:50] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-11(UNSAT) depth K=4 took 6034 ms
[2020-05-22 10:13:02] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-12(UNSAT) depth K=4 took 11753 ms
[2020-05-22 10:13:15] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-13(UNSAT) depth K=4 took 13499 ms
[2020-05-22 10:13:25] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-14(UNSAT) depth K=4 took 9566 ms
[2020-05-22 10:13:34] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-15(UNSAT) depth K=4 took 9706 ms
[2020-05-22 10:13:54] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-00(UNSAT) depth K=5 took 19778 ms
[2020-05-22 10:17:28] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-04(UNSAT) depth K=5 took 214102 ms
[2020-05-22 10:19:23] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-05(UNSAT) depth K=5 took 114427 ms
[2020-05-22 10:20:28] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-06(UNSAT) depth K=5 took 64758 ms
[2020-05-22 10:22:32] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-07(UNSAT) depth K=5 took 124544 ms
[2020-05-22 10:22:56] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-08(UNSAT) depth K=5 took 23835 ms
[2020-05-22 10:23:33] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-09(UNSAT) depth K=5 took 36532 ms
SDD proceeding with computation, new max is 1048576
[2020-05-22 10:25:15] [INFO ] BMC solution for property DoubleExponent-PT-200-ReachabilityCardinality-10(UNSAT) depth K=5 took 102808 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-200"
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"

# 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-200, 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 r066-tajo-158922814800806"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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