About the Execution of ITS-Tools for DoubleExponent-PT-100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16244.123 | 3600000.00 | 7352052.00 | 59166.20 | F???F?FF???????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875400446.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875400446
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.8M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620597017238
Running Version 0
[2021-05-09 21:50:18] [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]
[2021-05-09 21:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 21:50:18] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2021-05-09 21:50:18] [INFO ] Transformed 5304 places.
[2021-05-09 21:50:18] [INFO ] Transformed 4998 transitions.
[2021-05-09 21:50:18] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 338 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 766360 steps, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 766360 steps, saw 383240 distinct states, run finished after 30003 ms. (steps per millisecond=25 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 4998 rows 5304 cols
[2021-05-09 21:50:50] [INFO ] Invariants computation overflowed in 258 ms
[2021-05-09 21:50:52] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:16
[2021-05-09 21:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:51:17] [INFO ] [Nat]Absence check using state equation in 22669 ms returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 21:51:17] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 1 different solutions.
Support contains 75 out of 5304 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1129 transitions
Trivial Post-agglo rules discarded 1129 transitions
Performed 1129 trivial Post agglomeration. Transition count delta: 1129
Iterating post reduction 0 with 1132 rules applied. Total rules applied 1133 place count 5297 transition count 3867
Reduce places removed 1129 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 1159 rules applied. Total rules applied 2292 place count 4168 transition count 3837
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 2322 place count 4138 transition count 3837
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 2322 place count 4138 transition count 3639
Deduced a syphon composed of 198 places in 283 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 2718 place count 3940 transition count 3639
Performed 864 Post agglomeration using F-continuation condition.Transition count delta: 864
Deduced a syphon composed of 864 places in 79 ms
Reduce places removed 864 places and 0 transitions.
Iterating global reduction 3 with 1728 rules applied. Total rules applied 4446 place count 3076 transition count 2775
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 135 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4648 place count 2975 transition count 2775
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 63 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 4808 place count 2895 transition count 2775
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4812 place count 2895 transition count 2771
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4816 place count 2891 transition count 2771
Free-agglomeration rule (complex) applied 422 times.
Iterating global reduction 4 with 422 rules applied. Total rules applied 5238 place count 2891 transition count 2349
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 4 with 422 rules applied. Total rules applied 5660 place count 2469 transition count 2349
Partial Free-agglomeration rule applied 393 times.
Drop transitions removed 393 transitions
Iterating global reduction 5 with 393 rules applied. Total rules applied 6053 place count 2469 transition count 2349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6054 place count 2468 transition count 2348
Applied a total of 6054 rules in 2536 ms. Remains 2468 /5304 variables (removed 2836) and now considering 2348/4998 (removed 2650) transitions.
Finished structural reductions, in 1 iterations. Remains : 2468/5304 places, 2348/4998 transitions.
[2021-05-09 21:51:20] [INFO ] Flatten gal took : 530 ms
[2021-05-09 21:51:20] [INFO ] Flatten gal took : 349 ms
[2021-05-09 21:51:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11814887315283961230.gal : 74 ms
[2021-05-09 21:51:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1963729446511071406.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11814887315283961230.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1963729446511071406.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11814887315283961230.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1963729446511071406.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1963729446511071406.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :13 after 31
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :31 after 53
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :53 after 102
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :102 after 234
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :234 after 495
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :495 after 1081
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1081 after 5848
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :5848 after 36601
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :36601 after 110473
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :110473 after 257056
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :257056 after 560478
Detected timeout of ITS tools.
[2021-05-09 21:51:36] [INFO ] Flatten gal took : 335 ms
[2021-05-09 21:51:36] [INFO ] Applying decomposition
[2021-05-09 21:51:36] [INFO ] Flatten gal took : 309 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5175056362816835472.txt, -o, /tmp/graph5175056362816835472.bin, -w, /tmp/graph5175056362816835472.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5175056362816835472.bin, -l, -1, -v, -w, /tmp/graph5175056362816835472.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 21:51:37] [INFO ] Decomposing Gal with order
[2021-05-09 21:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 21:51:38] [INFO ] Removed a total of 15419 redundant transitions.
[2021-05-09 21:51:38] [INFO ] Flatten gal took : 653 ms
[2021-05-09 21:51:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1264 labels/synchronizations in 2911 ms.
[2021-05-09 21:51:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6636034327205270403.gal : 73 ms
[2021-05-09 21:51:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6322277331829074673.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6636034327205270403.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6322277331829074673.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6636034327205270403.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6322277331829074673.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6322277331829074673.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :13 after 31
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :31 after 53
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :53 after 102
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :102 after 234
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :234 after 495
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :495 after 1081
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1081 after 5848
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :5848 after 36601
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13450171537461130509
[2021-05-09 21:51:58] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13450171537461130509
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13450171537461130509]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13450171537461130509] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13450171537461130509] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 126095 resets, run finished after 3994 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8350 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8426 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 8382 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8364 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 8453 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8456 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8444 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8369 resets, run finished after 301 ms. (steps per millisecond=332 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8464 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8410 resets, run finished after 258 ms. (steps per millisecond=387 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8369 resets, run finished after 267 ms. (steps per millisecond=374 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8485 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8361 resets, run finished after 277 ms. (steps per millisecond=361 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 8444 resets, run finished after 251 ms. (steps per millisecond=398 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 8327 resets, run finished after 313 ms. (steps per millisecond=319 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 8367 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 16) seen :0
Probably explored full state space saw : 610297 states, properties seen :{}
Probabilistic random walk after 1220632 steps, saw 610297 distinct states, run finished after 26153 ms. (steps per millisecond=46 ) properties seen :{}
Interrupted probabilistic random walk after 1387015 steps, run timeout after 30001 ms. (steps per millisecond=46 ) properties seen :{}
Exhaustive walk after 1387015 steps, saw 693560 distinct states, run finished after 30001 ms. (steps per millisecond=46 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 2348 rows 2468 cols
[2021-05-09 21:53:03] [INFO ] Invariants computation overflowed in 79 ms
[2021-05-09 21:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:53:09] [INFO ] [Real]Absence check using state equation in 5346 ms returned sat
[2021-05-09 21:53:09] [INFO ] State equation strengthened by 379 read => feed constraints.
[2021-05-09 21:53:10] [INFO ] [Real]Added 379 Read/Feed constraints in 1488 ms returned sat
[2021-05-09 21:53:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:53:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:53:16] [INFO ] [Nat]Absence check using state equation in 5334 ms returned sat
[2021-05-09 21:53:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 21:53:19] [INFO ] [Nat]Added 379 Read/Feed constraints in 3238 ms returned sat
[2021-05-09 21:53:21] [INFO ] Deduced a trap composed of 2 places in 1332 ms of which 4 ms to minimize.
[2021-05-09 21:53:22] [INFO ] Deduced a trap composed of 10 places in 1246 ms of which 2 ms to minimize.
[2021-05-09 21:53:23] [INFO ] Deduced a trap composed of 4 places in 1218 ms of which 2 ms to minimize.
[2021-05-09 21:53:25] [INFO ] Deduced a trap composed of 6 places in 1189 ms of which 2 ms to minimize.
[2021-05-09 21:53:26] [INFO ] Deduced a trap composed of 4 places in 1210 ms of which 2 ms to minimize.
[2021-05-09 21:53:27] [INFO ] Deduced a trap composed of 4 places in 1200 ms of which 1 ms to minimize.
[2021-05-09 21:53:28] [INFO ] Deduced a trap composed of 20 places in 1180 ms of which 2 ms to minimize.
[2021-05-09 21:53:30] [INFO ] Deduced a trap composed of 19 places in 1176 ms of which 2 ms to minimize.
[2021-05-09 21:53:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10534 ms
[2021-05-09 21:53:30] [INFO ] Computed and/alt/rep : 1908/11186/1908 causal constraints (skipped 439 transitions) in 217 ms.
[2021-05-09 21:53:36] [INFO ] Added : 5 causal constraints over 1 iterations in 6380 ms. Result :unknown
[2021-05-09 21:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:53:45] [INFO ] [Real]Absence check using state equation in 8470 ms returned unknown
[2021-05-09 21:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:54:30] [INFO ] [Real]Absence check using state equation in 44844 ms returned unknown
[2021-05-09 21:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:54:37] [INFO ] [Real]Absence check using state equation in 6548 ms returned unknown
[2021-05-09 21:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:55:10] [INFO ] [Real]Absence check using state equation in 32806 ms returned sat
[2021-05-09 21:55:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:55:43] [INFO ] [Nat]Absence check using state equation in 32929 ms returned sat
[2021-05-09 21:55:43] [INFO ] [Nat]Added 379 Read/Feed constraints in 577 ms returned sat
[2021-05-09 21:55:45] [INFO ] Deduced a trap composed of 10 places in 1594 ms of which 2 ms to minimize.
[2021-05-09 21:55:47] [INFO ] Deduced a trap composed of 4 places in 1627 ms of which 3 ms to minimize.
[2021-05-09 21:55:48] [INFO ] Deduced a trap composed of 2 places in 1565 ms of which 2 ms to minimize.
[2021-05-09 21:55:50] [INFO ] Deduced a trap composed of 8 places in 1592 ms of which 2 ms to minimize.
[2021-05-09 21:55:52] [INFO ] Deduced a trap composed of 4 places in 1513 ms of which 2 ms to minimize.
[2021-05-09 21:55:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8334 ms
[2021-05-09 21:55:52] [INFO ] Computed and/alt/rep : 1908/11186/1908 causal constraints (skipped 439 transitions) in 181 ms.
[2021-05-09 21:55:55] [INFO ] Added : 5 causal constraints over 1 iterations in 2950 ms. Result :unknown
[2021-05-09 21:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:56:40] [INFO ] [Real]Absence check using state equation in 44788 ms returned unknown
[2021-05-09 21:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:57:06] [INFO ] [Real]Absence check using state equation in 26226 ms returned sat
[2021-05-09 21:57:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:57:36] [INFO ] [Nat]Absence check using state equation in 29548 ms returned unknown
[2021-05-09 21:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:58:21] [INFO ] [Real]Absence check using state equation in 44838 ms returned unknown
[2021-05-09 21:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:59:06] [INFO ] [Real]Absence check using state equation in 44788 ms returned unknown
[2021-05-09 21:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:59:43] [INFO ] [Real]Absence check using state equation in 36800 ms returned sat
[2021-05-09 21:59:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:00:28] [INFO ] [Nat]Absence check using state equation in 44849 ms returned unknown
[2021-05-09 22:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:01:13] [INFO ] [Real]Absence check using state equation in 44797 ms returned unknown
[2021-05-09 22:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:01:58] [INFO ] [Real]Absence check using state equation in 44791 ms returned unknown
[2021-05-09 22:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:02:43] [INFO ] [Real]Absence check using state equation in 44779 ms returned unknown
[2021-05-09 22:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:02:47] [INFO ] [Real]Absence check using state equation in 3702 ms returned sat
[2021-05-09 22:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:02:51] [INFO ] [Nat]Absence check using state equation in 3386 ms returned sat
[2021-05-09 22:02:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:02:55] [INFO ] [Nat]Added 379 Read/Feed constraints in 3834 ms returned sat
[2021-05-09 22:02:56] [INFO ] Deduced a trap composed of 113 places in 747 ms of which 1 ms to minimize.
[2021-05-09 22:02:56] [INFO ] Deduced a trap composed of 115 places in 672 ms of which 2 ms to minimize.
[2021-05-09 22:02:57] [INFO ] Deduced a trap composed of 125 places in 655 ms of which 1 ms to minimize.
[2021-05-09 22:02:58] [INFO ] Deduced a trap composed of 127 places in 674 ms of which 1 ms to minimize.
[2021-05-09 22:02:59] [INFO ] Deduced a trap composed of 122 places in 637 ms of which 1 ms to minimize.
[2021-05-09 22:02:59] [INFO ] Deduced a trap composed of 140 places in 656 ms of which 1 ms to minimize.
[2021-05-09 22:03:00] [INFO ] Deduced a trap composed of 133 places in 771 ms of which 1 ms to minimize.
[2021-05-09 22:03:01] [INFO ] Deduced a trap composed of 129 places in 646 ms of which 1 ms to minimize.
[2021-05-09 22:03:02] [INFO ] Deduced a trap composed of 130 places in 630 ms of which 1 ms to minimize.
[2021-05-09 22:03:02] [INFO ] Deduced a trap composed of 134 places in 649 ms of which 1 ms to minimize.
[2021-05-09 22:03:03] [INFO ] Deduced a trap composed of 140 places in 626 ms of which 1 ms to minimize.
[2021-05-09 22:03:04] [INFO ] Deduced a trap composed of 137 places in 631 ms of which 1 ms to minimize.
[2021-05-09 22:03:05] [INFO ] Deduced a trap composed of 140 places in 694 ms of which 2 ms to minimize.
[2021-05-09 22:03:05] [INFO ] Deduced a trap composed of 142 places in 647 ms of which 1 ms to minimize.
[2021-05-09 22:03:06] [INFO ] Deduced a trap composed of 141 places in 630 ms of which 1 ms to minimize.
[2021-05-09 22:03:07] [INFO ] Deduced a trap composed of 136 places in 623 ms of which 1 ms to minimize.
[2021-05-09 22:03:08] [INFO ] Deduced a trap composed of 146 places in 611 ms of which 1 ms to minimize.
[2021-05-09 22:03:08] [INFO ] Deduced a trap composed of 152 places in 721 ms of which 1 ms to minimize.
[2021-05-09 22:03:09] [INFO ] Deduced a trap composed of 143 places in 638 ms of which 1 ms to minimize.
[2021-05-09 22:03:10] [INFO ] Deduced a trap composed of 150 places in 641 ms of which 1 ms to minimize.
[2021-05-09 22:03:11] [INFO ] Deduced a trap composed of 150 places in 634 ms of which 1 ms to minimize.
[2021-05-09 22:03:11] [INFO ] Deduced a trap composed of 145 places in 610 ms of which 1 ms to minimize.
[2021-05-09 22:03:12] [INFO ] Deduced a trap composed of 168 places in 623 ms of which 1 ms to minimize.
[2021-05-09 22:03:13] [INFO ] Deduced a trap composed of 131 places in 734 ms of which 1 ms to minimize.
[2021-05-09 22:03:14] [INFO ] Deduced a trap composed of 174 places in 554 ms of which 1 ms to minimize.
[2021-05-09 22:03:14] [INFO ] Deduced a trap composed of 207 places in 521 ms of which 1 ms to minimize.
[2021-05-09 22:03:15] [INFO ] Deduced a trap composed of 219 places in 514 ms of which 1 ms to minimize.
[2021-05-09 22:03:15] [INFO ] Deduced a trap composed of 256 places in 455 ms of which 1 ms to minimize.
[2021-05-09 22:03:16] [INFO ] Deduced a trap composed of 286 places in 515 ms of which 1 ms to minimize.
[2021-05-09 22:03:16] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 21486 ms
[2021-05-09 22:03:16] [INFO ] Computed and/alt/rep : 1908/11186/1908 causal constraints (skipped 439 transitions) in 212 ms.
[2021-05-09 22:03:23] [INFO ] Added : 5 causal constraints over 1 iterations in 6844 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-09 22:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:03:33] [INFO ] [Real]Absence check using state equation in 9112 ms returned sat
[2021-05-09 22:03:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:03:46] [INFO ] [Nat]Absence check using state equation in 12646 ms returned sat
[2021-05-09 22:03:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:03:52] [INFO ] [Nat]Added 379 Read/Feed constraints in 6153 ms returned unknown
[2021-05-09 22:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:04:13] [INFO ] [Real]Absence check using state equation in 20776 ms returned unknown
Fused 16 Parikh solutions to 4 different solutions.
Interrupted Parikh walk after 1004608 steps, including 144481 resets, run timeout after 5001 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
This parikh vector is obviously unfeasible : no match in initial state.
Interrupted Parikh walk after 1125610 steps, including 161549 resets, run timeout after 5001 ms. (steps per millisecond=225 ) properties (out of 16) seen :0
Support contains 75 out of 2468 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2468/2468 places, 2348/2348 transitions.
Applied a total of 0 rules in 137 ms. Remains 2468 /2468 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2468/2468 places, 2348/2348 transitions.
Starting structural reductions, iteration 0 : 2468/2468 places, 2348/2348 transitions.
Applied a total of 0 rules in 137 ms. Remains 2468 /2468 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
// Phase 1: matrix 2348 rows 2468 cols
[2021-05-09 22:04:23] [INFO ] Invariants computation overflowed in 79 ms
[2021-05-09 22:04:27] [INFO ] Implicit Places using invariants in 4378 ms returned []
// Phase 1: matrix 2348 rows 2468 cols
[2021-05-09 22:04:27] [INFO ] Invariants computation overflowed in 53 ms
[2021-05-09 22:04:32] [INFO ] Implicit Places using invariants and state equation in 4825 ms returned []
Implicit Place search using SMT with State Equation took 9203 ms to find 0 implicit places.
[2021-05-09 22:04:32] [INFO ] Redundant transitions in 157 ms returned []
// Phase 1: matrix 2348 rows 2468 cols
[2021-05-09 22:04:32] [INFO ] Invariants computation overflowed in 50 ms
[2021-05-09 22:04:34] [INFO ] Dead Transitions using invariants and state equation in 1305 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2468/2468 places, 2348/2348 transitions.
Incomplete random walk after 100000 steps, including 12616 resets, run finished after 502 ms. (steps per millisecond=199 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 2348 rows 2468 cols
[2021-05-09 22:04:34] [INFO ] Invariants computation overflowed in 50 ms
[2021-05-09 22:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:04:40] [INFO ] [Real]Absence check using state equation in 5373 ms returned sat
[2021-05-09 22:04:40] [INFO ] State equation strengthened by 379 read => feed constraints.
[2021-05-09 22:04:41] [INFO ] [Real]Added 379 Read/Feed constraints in 1510 ms returned sat
[2021-05-09 22:04:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:04:47] [INFO ] [Nat]Absence check using state equation in 5330 ms returned sat
[2021-05-09 22:04:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:04:50] [INFO ] [Nat]Added 379 Read/Feed constraints in 3264 ms returned sat
[2021-05-09 22:04:52] [INFO ] Deduced a trap composed of 2 places in 1271 ms of which 1 ms to minimize.
[2021-05-09 22:04:53] [INFO ] Deduced a trap composed of 10 places in 1239 ms of which 2 ms to minimize.
[2021-05-09 22:04:54] [INFO ] Deduced a trap composed of 4 places in 1266 ms of which 2 ms to minimize.
[2021-05-09 22:04:56] [INFO ] Deduced a trap composed of 6 places in 1248 ms of which 2 ms to minimize.
[2021-05-09 22:04:57] [INFO ] Deduced a trap composed of 4 places in 1232 ms of which 2 ms to minimize.
[2021-05-09 22:04:58] [INFO ] Deduced a trap composed of 4 places in 1236 ms of which 2 ms to minimize.
[2021-05-09 22:05:00] [INFO ] Deduced a trap composed of 20 places in 1167 ms of which 2 ms to minimize.
[2021-05-09 22:05:01] [INFO ] Deduced a trap composed of 19 places in 1182 ms of which 2 ms to minimize.
[2021-05-09 22:05:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10598 ms
[2021-05-09 22:05:01] [INFO ] Computed and/alt/rep : 1908/11186/1908 causal constraints (skipped 439 transitions) in 205 ms.
[2021-05-09 22:05:02] [INFO ] Added : 5 causal constraints over 1 iterations in 598 ms. Result :unknown
[2021-05-09 22:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:05:10] [INFO ] [Real]Absence check using state equation in 8365 ms returned unknown
[2021-05-09 22:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:05:30] [INFO ] [Real]Absence check using state equation in 19795 ms returned unknown
[2021-05-09 22:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:05:37] [INFO ] [Real]Absence check using state equation in 6551 ms returned unknown
[2021-05-09 22:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:05:57] [INFO ] [Real]Absence check using state equation in 19805 ms returned unknown
[2021-05-09 22:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:06:17] [INFO ] [Real]Absence check using state equation in 19781 ms returned unknown
[2021-05-09 22:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:06:37] [INFO ] [Real]Absence check using state equation in 19786 ms returned unknown
[2021-05-09 22:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:06:57] [INFO ] [Real]Absence check using state equation in 19789 ms returned unknown
[2021-05-09 22:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:07:17] [INFO ] [Real]Absence check using state equation in 19838 ms returned unknown
[2021-05-09 22:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:07:37] [INFO ] [Real]Absence check using state equation in 19792 ms returned unknown
[2021-05-09 22:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:07:57] [INFO ] [Real]Absence check using state equation in 19837 ms returned unknown
[2021-05-09 22:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:08:17] [INFO ] [Real]Absence check using state equation in 19789 ms returned unknown
[2021-05-09 22:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:08:37] [INFO ] [Real]Absence check using state equation in 19771 ms returned unknown
[2021-05-09 22:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:08:41] [INFO ] [Real]Absence check using state equation in 3724 ms returned sat
[2021-05-09 22:08:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:08:45] [INFO ] [Nat]Absence check using state equation in 3389 ms returned sat
[2021-05-09 22:08:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:08:49] [INFO ] [Nat]Added 379 Read/Feed constraints in 3819 ms returned sat
[2021-05-09 22:08:49] [INFO ] Deduced a trap composed of 113 places in 672 ms of which 1 ms to minimize.
[2021-05-09 22:08:50] [INFO ] Deduced a trap composed of 115 places in 715 ms of which 1 ms to minimize.
[2021-05-09 22:08:51] [INFO ] Deduced a trap composed of 125 places in 654 ms of which 1 ms to minimize.
[2021-05-09 22:08:52] [INFO ] Deduced a trap composed of 127 places in 640 ms of which 1 ms to minimize.
[2021-05-09 22:08:52] [INFO ] Deduced a trap composed of 122 places in 638 ms of which 1 ms to minimize.
[2021-05-09 22:08:53] [INFO ] Deduced a trap composed of 140 places in 635 ms of which 1 ms to minimize.
[2021-05-09 22:08:54] [INFO ] Deduced a trap composed of 133 places in 640 ms of which 1 ms to minimize.
[2021-05-09 22:08:55] [INFO ] Deduced a trap composed of 129 places in 672 ms of which 1 ms to minimize.
[2021-05-09 22:08:55] [INFO ] Deduced a trap composed of 130 places in 635 ms of which 1 ms to minimize.
[2021-05-09 22:08:56] [INFO ] Deduced a trap composed of 134 places in 634 ms of which 1 ms to minimize.
[2021-05-09 22:08:57] [INFO ] Deduced a trap composed of 140 places in 635 ms of which 1 ms to minimize.
[2021-05-09 22:08:57] [INFO ] Deduced a trap composed of 137 places in 629 ms of which 1 ms to minimize.
[2021-05-09 22:08:58] [INFO ] Deduced a trap composed of 140 places in 626 ms of which 1 ms to minimize.
[2021-05-09 22:08:59] [INFO ] Deduced a trap composed of 142 places in 667 ms of which 1 ms to minimize.
[2021-05-09 22:09:00] [INFO ] Deduced a trap composed of 141 places in 616 ms of which 1 ms to minimize.
[2021-05-09 22:09:00] [INFO ] Deduced a trap composed of 136 places in 632 ms of which 2 ms to minimize.
[2021-05-09 22:09:01] [INFO ] Deduced a trap composed of 146 places in 615 ms of which 4 ms to minimize.
[2021-05-09 22:09:03] [INFO ] Deduced a trap composed of 2 places in 2380 ms of which 2 ms to minimize.
[2021-05-09 22:09:03] [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 close... while checking expression at index 13
[2021-05-09 22:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:09:13] [INFO ] [Real]Absence check using state equation in 9146 ms returned sat
[2021-05-09 22:09:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:09:26] [INFO ] [Nat]Absence check using state equation in 12660 ms returned sat
[2021-05-09 22:09:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:09:32] [INFO ] [Nat]Added 379 Read/Feed constraints in 6175 ms returned unknown
[2021-05-09 22:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:09:52] [INFO ] [Real]Absence check using state equation in 19779 ms returned unknown
[2021-05-09 22:09:52] [INFO ] Flatten gal took : 288 ms
[2021-05-09 22:09:53] [INFO ] Flatten gal took : 292 ms
[2021-05-09 22:09:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1477944479372651162.gal : 34 ms
[2021-05-09 22:09:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10624618162751021250.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1477944479372651162.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10624618162751021250.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1477944479372651162.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10624618162751021250.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10624618162751021250.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :13 after 31
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :31 after 53
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :53 after 102
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :102 after 234
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :234 after 495
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :495 after 1081
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1081 after 5848
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :5848 after 36601
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :36601 after 110473
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :110473 after 257056
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :257056 after 560478
Detected timeout of ITS tools.
[2021-05-09 22:10:08] [INFO ] Flatten gal took : 285 ms
[2021-05-09 22:10:08] [INFO ] Applying decomposition
[2021-05-09 22:10:08] [INFO ] Flatten gal took : 285 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7413085951255332209.txt, -o, /tmp/graph7413085951255332209.bin, -w, /tmp/graph7413085951255332209.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7413085951255332209.bin, -l, -1, -v, -w, /tmp/graph7413085951255332209.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:10:09] [INFO ] Decomposing Gal with order
[2021-05-09 22:10:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:10:09] [INFO ] Removed a total of 11080 redundant transitions.
[2021-05-09 22:10:10] [INFO ] Flatten gal took : 416 ms
[2021-05-09 22:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 734 labels/synchronizations in 1406 ms.
[2021-05-09 22:10:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14634211352521710714.gal : 49 ms
[2021-05-09 22:10:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15965759357588099669.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14634211352521710714.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15965759357588099669.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14634211352521710714.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15965759357588099669.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15965759357588099669.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :17 after 35
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :35 after 39
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :39 after 41
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :41 after 51
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :51 after 258
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :258 after 407
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :407 after 886
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :886 after 1589
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1589 after 49310
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5340532021405344499
[2021-05-09 22:10:27] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5340532021405344499
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5340532021405344499]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5340532021405344499] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5340532021405344499] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 2468 transition count 2339
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 2459 transition count 2339
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 178 Pre rules applied. Total rules applied 18 place count 2459 transition count 2161
Deduced a syphon composed of 178 places in 44 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 374 place count 2281 transition count 2161
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 378 place count 2281 transition count 2157
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 382 place count 2277 transition count 2157
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 2277 transition count 2156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 384 place count 2276 transition count 2156
Applied a total of 384 rules in 519 ms. Remains 2276 /2468 variables (removed 192) and now considering 2156/2348 (removed 192) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 2156 rows 2276 cols
[2021-05-09 22:10:28] [INFO ] Invariants computation overflowed in 52 ms
[2021-05-09 22:10:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:10:40] [INFO ] [Real]Absence check using state equation in 11188 ms returned sat
[2021-05-09 22:10:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 22:10:43] [INFO ] [Real]Added 2 Read/Feed constraints in 2832 ms returned sat
[2021-05-09 22:10:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:10:54] [INFO ] [Nat]Absence check using state equation in 11174 ms returned sat
[2021-05-09 22:10:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:11:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 6426 ms returned unknown
[2021-05-09 22:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:11:07] [INFO ] [Real]Absence check using state equation in 6707 ms returned sat
[2021-05-09 22:11:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:11:11] [INFO ] [Nat]Absence check using state equation in 3612 ms returned sat
[2021-05-09 22:11:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-05-09 22:11:12] [INFO ] Deduced a trap composed of 38 places in 954 ms of which 2 ms to minimize.
[2021-05-09 22:11:13] [INFO ] Deduced a trap composed of 35 places in 988 ms of which 1 ms to minimize.
[2021-05-09 22:11:14] [INFO ] Deduced a trap composed of 39 places in 969 ms of which 2 ms to minimize.
[2021-05-09 22:11:16] [INFO ] Deduced a trap composed of 44 places in 953 ms of which 1 ms to minimize.
[2021-05-09 22:11:17] [INFO ] Deduced a trap composed of 52 places in 972 ms of which 1 ms to minimize.
[2021-05-09 22:11:18] [INFO ] Deduced a trap composed of 61 places in 933 ms of which 1 ms to minimize.
[2021-05-09 22:11:19] [INFO ] Deduced a trap composed of 53 places in 951 ms of which 1 ms to minimize.
[2021-05-09 22:11:20] [INFO ] Deduced a trap composed of 56 places in 939 ms of which 1 ms to minimize.
[2021-05-09 22:11:21] [INFO ] Deduced a trap composed of 59 places in 987 ms of which 1 ms to minimize.
[2021-05-09 22:11:22] [INFO ] Deduced a trap composed of 68 places in 960 ms of which 1 ms to minimize.
[2021-05-09 22:11:23] [INFO ] Deduced a trap composed of 47 places in 932 ms of which 2 ms to minimize.
[2021-05-09 22:11:24] [INFO ] Deduced a trap composed of 65 places in 950 ms of which 1 ms to minimize.
[2021-05-09 22:11:25] [INFO ] Deduced a trap composed of 62 places in 944 ms of which 1 ms to minimize.
[2021-05-09 22:11:26] [INFO ] Deduced a trap composed of 72 places in 993 ms of which 2 ms to minimize.
[2021-05-09 22:11:27] [INFO ] Deduced a trap composed of 82 places in 918 ms of which 1 ms to minimize.
[2021-05-09 22:11:28] [INFO ] Deduced a trap composed of 79 places in 972 ms of which 1 ms to minimize.
[2021-05-09 22:11:29] [INFO ] Deduced a trap composed of 85 places in 912 ms of which 1 ms to minimize.
[2021-05-09 22:11:30] [INFO ] Deduced a trap composed of 75 places in 977 ms of which 1 ms to minimize.
[2021-05-09 22:11:31] [INFO ] Deduced a trap composed of 73 places in 986 ms of which 1 ms to minimize.
[2021-05-09 22:11:32] [INFO ] Deduced a trap composed of 88 places in 911 ms of which 2 ms to minimize.
[2021-05-09 22:11:33] [INFO ] Deduced a trap composed of 91 places in 896 ms of which 1 ms to minimize.
[2021-05-09 22:11:34] [INFO ] Deduced a trap composed of 131 places in 879 ms of which 1 ms to minimize.
[2021-05-09 22:11:35] [INFO ] Deduced a trap composed of 132 places in 868 ms of which 1 ms to minimize.
[2021-05-09 22:11:36] [INFO ] Deduced a trap composed of 135 places in 897 ms of which 1 ms to minimize.
[2021-05-09 22:11:37] [INFO ] Deduced a trap composed of 144 places in 914 ms of which 2 ms to minimize.
[2021-05-09 22:11:38] [INFO ] Deduced a trap composed of 141 places in 861 ms of which 1 ms to minimize.
[2021-05-09 22:11:39] [INFO ] Deduced a trap composed of 147 places in 862 ms of which 1 ms to minimize.
[2021-05-09 22:11:40] [INFO ] Deduced a trap composed of 150 places in 907 ms of which 1 ms to minimize.
[2021-05-09 22:11:41] [INFO ] Deduced a trap composed of 160 places in 875 ms of which 1 ms to minimize.
[2021-05-09 22:11:42] [INFO ] Deduced a trap composed of 168 places in 869 ms of which 1 ms to minimize.
[2021-05-09 22:11:43] [INFO ] Deduced a trap composed of 164 places in 865 ms of which 1 ms to minimize.
[2021-05-09 22:11:44] [INFO ] Deduced a trap composed of 157 places in 841 ms of which 1 ms to minimize.
[2021-05-09 22:11:44] [INFO ] Deduced a trap composed of 174 places in 838 ms of which 1 ms to minimize.
[2021-05-09 22:11:45] [INFO ] Deduced a trap composed of 178 places in 872 ms of which 1 ms to minimize.
[2021-05-09 22:11:46] [INFO ] Deduced a trap composed of 154 places in 833 ms of which 1 ms to minimize.
[2021-05-09 22:11:47] [INFO ] Deduced a trap composed of 123 places in 846 ms of which 1 ms to minimize.
[2021-05-09 22:11:48] [INFO ] Deduced a trap composed of 126 places in 836 ms of which 1 ms to minimize.
[2021-05-09 22:11:49] [INFO ] Deduced a trap composed of 138 places in 831 ms of which 1 ms to minimize.
[2021-05-09 22:11:50] [INFO ] Deduced a trap composed of 187 places in 832 ms of which 1 ms to minimize.
[2021-05-09 22:11:51] [INFO ] Deduced a trap composed of 205 places in 779 ms of which 1 ms to minimize.
[2021-05-09 22:11:52] [INFO ] Deduced a trap composed of 223 places in 761 ms of which 1 ms to minimize.
[2021-05-09 22:11:52] [INFO ] Deduced a trap composed of 233 places in 751 ms of which 0 ms to minimize.
[2021-05-09 22:11:55] [INFO ] Deduced a trap composed of 2 places in 2204 ms of which 2 ms to minimize.
[2021-05-09 22:11:55] [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 close... while checking expression at index 1
[2021-05-09 22:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:12:06] [INFO ] [Real]Absence check using state equation in 11446 ms returned sat
[2021-05-09 22:12:06] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-05-09 22:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:12:16] [INFO ] [Nat]Absence check using state equation in 8802 ms returned unknown
[2021-05-09 22:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:12:22] [INFO ] [Real]Absence check using state equation in 6432 ms returned unknown
[2021-05-09 22:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:12:27] [INFO ] [Real]Absence check using state equation in 4886 ms returned sat
[2021-05-09 22:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:12:33] [INFO ] [Nat]Absence check using state equation in 5030 ms returned sat
[2021-05-09 22:12:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-05-09 22:12:35] [INFO ] Deduced a trap composed of 2 places in 2106 ms of which 1 ms to minimize.
[2021-05-09 22:12:37] [INFO ] Deduced a trap composed of 12 places in 2080 ms of which 2 ms to minimize.
[2021-05-09 22:12:39] [INFO ] Deduced a trap composed of 8 places in 2106 ms of which 2 ms to minimize.
[2021-05-09 22:12:41] [INFO ] Deduced a trap composed of 14 places in 2095 ms of which 2 ms to minimize.
[2021-05-09 22:12:43] [INFO ] Deduced a trap composed of 15 places in 2072 ms of which 1 ms to minimize.
[2021-05-09 22:12:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 10820 ms
[2021-05-09 22:12:44] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 172 ms.
[2021-05-09 22:12:50] [INFO ] Added : 5 causal constraints over 1 iterations in 6302 ms. Result :unknown
[2021-05-09 22:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:13:35] [INFO ] [Real]Absence check using state equation in 44847 ms returned unknown
[2021-05-09 22:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:13:40] [INFO ] [Real]Absence check using state equation in 5407 ms returned sat
[2021-05-09 22:13:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:13:46] [INFO ] [Nat]Absence check using state equation in 5501 ms returned sat
[2021-05-09 22:13:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 1887 ms returned sat
[2021-05-09 22:13:49] [INFO ] Deduced a trap composed of 2 places in 1385 ms of which 1 ms to minimize.
[2021-05-09 22:13:51] [INFO ] Deduced a trap composed of 8 places in 1364 ms of which 2 ms to minimize.
[2021-05-09 22:13:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2962 ms
[2021-05-09 22:13:51] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 167 ms.
[2021-05-09 22:14:02] [INFO ] Added : 20 causal constraints over 4 iterations in 11076 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-09 22:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:14:14] [INFO ] [Real]Absence check using state equation in 12042 ms returned sat
[2021-05-09 22:14:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:14:27] [INFO ] [Nat]Absence check using state equation in 12494 ms returned sat
[2021-05-09 22:14:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2021-05-09 22:14:29] [INFO ] Deduced a trap composed of 2 places in 2036 ms of which 2 ms to minimize.
[2021-05-09 22:14:31] [INFO ] Deduced a trap composed of 11 places in 1980 ms of which 2 ms to minimize.
[2021-05-09 22:14:33] [INFO ] Deduced a trap composed of 4 places in 2051 ms of which 2 ms to minimize.
[2021-05-09 22:14:35] [INFO ] Deduced a trap composed of 9 places in 2014 ms of which 2 ms to minimize.
[2021-05-09 22:14:38] [INFO ] Deduced a trap composed of 13 places in 2034 ms of which 1 ms to minimize.
[2021-05-09 22:14:40] [INFO ] Deduced a trap composed of 9 places in 1984 ms of which 2 ms to minimize.
[2021-05-09 22:14:42] [INFO ] Deduced a trap composed of 645 places in 2000 ms of which 2 ms to minimize.
[2021-05-09 22:14:44] [INFO ] Deduced a trap composed of 647 places in 1996 ms of which 2 ms to minimize.
[2021-05-09 22:14:46] [INFO ] Deduced a trap composed of 654 places in 2008 ms of which 2 ms to minimize.
[2021-05-09 22:14:48] [INFO ] Deduced a trap composed of 648 places in 1995 ms of which 2 ms to minimize.
[2021-05-09 22:14:50] [INFO ] Deduced a trap composed of 665 places in 1975 ms of which 2 ms to minimize.
[2021-05-09 22:14:52] [INFO ] Deduced a trap composed of 676 places in 2036 ms of which 2 ms to minimize.
[2021-05-09 22:14:54] [INFO ] Deduced a trap composed of 652 places in 1981 ms of which 1 ms to minimize.
[2021-05-09 22:14:56] [INFO ] Deduced a trap composed of 659 places in 1969 ms of which 1 ms to minimize.
[2021-05-09 22:14:58] [INFO ] Deduced a trap composed of 667 places in 2020 ms of which 2 ms to minimize.
[2021-05-09 22:15:00] [INFO ] Deduced a trap composed of 658 places in 2011 ms of which 1 ms to minimize.
[2021-05-09 22:15:00] [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 close... while checking expression at index 7
[2021-05-09 22:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:15:45] [INFO ] [Real]Absence check using state equation in 44806 ms returned unknown
[2021-05-09 22:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:15:50] [INFO ] [Real]Absence check using state equation in 4660 ms returned sat
[2021-05-09 22:15:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:15:59] [INFO ] [Nat]Absence check using state equation in 8641 ms returned unknown
[2021-05-09 22:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:16:02] [INFO ] [Real]Absence check using state equation in 3131 ms returned sat
[2021-05-09 22:16:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:16:07] [INFO ] [Nat]Absence check using state equation in 3935 ms returned sat
[2021-05-09 22:16:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 22:16:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 4016 ms returned sat
[2021-05-09 22:16:12] [INFO ] Deduced a trap composed of 18 places in 1574 ms of which 2 ms to minimize.
[2021-05-09 22:16:14] [INFO ] Deduced a trap composed of 14 places in 1549 ms of which 2 ms to minimize.
[2021-05-09 22:16:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3449 ms
[2021-05-09 22:16:14] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 165 ms.
[2021-05-09 22:16:21] [INFO ] Added : 5 causal constraints over 1 iterations in 6336 ms. Result :unknown
[2021-05-09 22:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:16:45] [INFO ] [Real]Absence check using state equation in 24166 ms returned sat
[2021-05-09 22:16:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:16:53] [INFO ] [Nat]Absence check using state equation in 8193 ms returned sat
[2021-05-09 22:16:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 610 ms returned sat
[2021-05-09 22:16:55] [INFO ] Deduced a trap composed of 2 places in 1391 ms of which 1 ms to minimize.
[2021-05-09 22:16:57] [INFO ] Deduced a trap composed of 8 places in 1391 ms of which 1 ms to minimize.
[2021-05-09 22:16:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3019 ms
[2021-05-09 22:16:57] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 164 ms.
[2021-05-09 22:17:05] [INFO ] Added : 5 causal constraints over 1 iterations in 8400 ms. Result :unknown
[2021-05-09 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:17:11] [INFO ] [Real]Absence check using state equation in 4923 ms returned sat
[2021-05-09 22:17:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:17:17] [INFO ] [Nat]Absence check using state equation in 6229 ms returned sat
[2021-05-09 22:17:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-09 22:17:18] [INFO ] Deduced a trap composed of 4 places in 704 ms of which 2 ms to minimize.
[2021-05-09 22:17:19] [INFO ] Deduced a trap composed of 4 places in 723 ms of which 2 ms to minimize.
[2021-05-09 22:17:19] [INFO ] Deduced a trap composed of 3 places in 690 ms of which 1 ms to minimize.
[2021-05-09 22:17:20] [INFO ] Deduced a trap composed of 10 places in 690 ms of which 1 ms to minimize.
[2021-05-09 22:17:21] [INFO ] Deduced a trap composed of 9 places in 688 ms of which 2 ms to minimize.
[2021-05-09 22:17:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3938 ms
[2021-05-09 22:17:21] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 167 ms.
[2021-05-09 22:17:27] [INFO ] Added : 5 causal constraints over 1 iterations in 6388 ms. Result :unknown
[2021-05-09 22:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:17:30] [INFO ] [Real]Absence check using state equation in 2819 ms returned sat
[2021-05-09 22:17:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:17:33] [INFO ] [Nat]Absence check using state equation in 2590 ms returned sat
[2021-05-09 22:17:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-05-09 22:17:34] [INFO ] Deduced a trap composed of 14 places in 783 ms of which 2 ms to minimize.
[2021-05-09 22:17:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 949 ms
[2021-05-09 22:17:35] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 167 ms.
[2021-05-09 22:17:53] [INFO ] Added : 20 causal constraints over 4 iterations in 19059 ms. Result :unknown
[2021-05-09 22:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:18:04] [INFO ] [Real]Absence check using state equation in 10009 ms returned sat
[2021-05-09 22:18:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 22:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 22:18:14] [INFO ] [Nat]Absence check using state equation in 10063 ms returned sat
[2021-05-09 22:18:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 1474 ms returned sat
[2021-05-09 22:18:17] [INFO ] Deduced a trap composed of 11 places in 1400 ms of which 1 ms to minimize.
[2021-05-09 22:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1575 ms
[2021-05-09 22:18:17] [INFO ] Computed and/alt/rep : 1717/10238/1717 causal constraints (skipped 438 transitions) in 167 ms.
[2021-05-09 22:18:23] [INFO ] Added : 5 causal constraints over 1 iterations in 6061 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 22:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 22:18:42] [INFO ] [Real]Absence check using state equation in 18709 ms returned unknown
[2021-05-09 22:18:42] [INFO ] Flatten gal took : 283 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13269699614568600280
[2021-05-09 22:18:43] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2021-05-09 22:18:43] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13269699614568600280
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13269699614568600280]
[2021-05-09 22:18:43] [INFO ] Applying decomposition
[2021-05-09 22:18:43] [INFO ] Flatten gal took : 341 ms
[2021-05-09 22:18:43] [INFO ] Flatten gal took : 361 ms
[2021-05-09 22:18:43] [INFO ] Input system was already deterministic with 2348 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10731405163655427278.txt, -o, /tmp/graph10731405163655427278.bin, -w, /tmp/graph10731405163655427278.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10731405163655427278.bin, -l, -1, -v, -w, /tmp/graph10731405163655427278.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 22:18:44] [INFO ] Decomposing Gal with order
[2021-05-09 22:18:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:18:44] [INFO ] Removed a total of 12389 redundant transitions.
[2021-05-09 22:18:44] [INFO ] Ran tautology test, simplified 0 / 16 in 1526 ms.
[2021-05-09 22:18:44] [INFO ] Flatten gal took : 421 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=0 took 38 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=0 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=0 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=0 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=0 took 9 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=0 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=0 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=0 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=0 took 11 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=1 took 15 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=1 took 10 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=1 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=1 took 4 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=1 took 4 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=1 took 1 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=1 took 11 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=1 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=2 took 404 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=2 took 4 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=2 took 4 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=2 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=2 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=2 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=2 took 6 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=2 took 2 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=2 took 3 ms
[2021-05-09 22:18:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=2 took 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2348 rows 2468 cols
[2021-05-09 22:18:46] [INFO ] Invariants computation overflowed in 151 ms
Total of 0 invariants.
[2021-05-09 22:18:46] [INFO ] Computed 0 place invariants in 151 ms
[2021-05-09 22:18:46] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=3 took 1011 ms
[2021-05-09 22:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 985 labels/synchronizations in 2374 ms.
[2021-05-09 22:18:47] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=3 took 721 ms
[2021-05-09 22:18:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16673506602348764223.gal : 53 ms
[2021-05-09 22:18:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality308662400901354183.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16673506602348764223.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality308662400901354183.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16673506602348764223.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality308662400901354183.prop --nowitness --gen-order FOLLOW
[2021-05-09 22:18:48] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=3 took 713 ms
[2021-05-09 22:18:49] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=3 took 749 ms
Loading property file /tmp/ReachabilityCardinality308662400901354183.prop.
[2021-05-09 22:18:49] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=3 took 734 ms
[2021-05-09 22:18:50] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=3 took 725 ms
[2021-05-09 22:18:51] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=3 took 725 ms
[2021-05-09 22:18:53] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=3 took 1781 ms
[2021-05-09 22:18:53] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=3 took 672 ms
[2021-05-09 22:18:54] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=3 took 744 ms
[2021-05-09 22:18:55] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=3 took 680 ms
[2021-05-09 22:18:55] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=3 took 742 ms
[2021-05-09 22:18:57] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=3 took 1409 ms
[2021-05-09 22:18:58] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=3 took 706 ms
[2021-05-09 22:18:59] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=3 took 1533 ms
[2021-05-09 22:19:00] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=3 took 707 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :17 after 30
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :30 after 39
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :39 after 45
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :45 after 77
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :77 after 273
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :273 after 552
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :552 after 1166
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :1166 after 23713
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :23713 after 51202
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :51202 after 139151
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13269699614568600280] killed by timeout after 22 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13269699614568600280] killed by timeout after 22 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-09 22:19:05] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=4 took 5407 ms
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :139151 after 317240
[2021-05-09 22:19:08] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=4 took 2599 ms
[2021-05-09 22:19:08] [INFO ] Proved 2468 variables to be positive in 22461 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-00
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(SAT) depth K=0 took 59 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-01
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(SAT) depth K=0 took 16 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-02
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(SAT) depth K=0 took 10 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-03
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(SAT) depth K=0 took 25 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-04
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(SAT) depth K=0 took 7 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-05
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(SAT) depth K=0 took 9 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-06
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(SAT) depth K=0 took 9 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-07
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(SAT) depth K=0 took 7 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-08
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(SAT) depth K=0 took 6 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-09
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(SAT) depth K=0 took 7 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-10
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(SAT) depth K=0 took 6 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-11
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(SAT) depth K=0 took 9 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-12
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(SAT) depth K=0 took 6 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-13
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(SAT) depth K=0 took 8 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-14
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(SAT) depth K=0 took 8 ms
[2021-05-09 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-15
[2021-05-09 22:19:08] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(SAT) depth K=0 took 6 ms
[2021-05-09 22:19:11] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-00
[2021-05-09 22:19:11] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-00
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2021-05-09 22:19:11] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(FALSE) depth K=1 took 2697 ms
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :317240 after 654471
[2021-05-09 22:19:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=4 took 9883 ms
[2021-05-09 22:19:20] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=4 took 2631 ms
[2021-05-09 22:19:25] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=4 took 4969 ms
[2021-05-09 22:19:27] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=4 took 1429 ms
SDD proceeding with computation,16 properties remain. new max is 262144
SDD size :654471 after 1.28356e+06
[2021-05-09 22:19:51] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=4 took 24496 ms
[2021-05-09 22:19:54] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=4 took 2242 ms
[2021-05-09 22:19:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-01
[2021-05-09 22:19:56] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(SAT) depth K=1 took 44589 ms
[2021-05-09 22:19:58] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=4 took 4028 ms
[2021-05-09 22:20:00] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=4 took 2550 ms
[2021-05-09 22:20:04] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=4 took 3509 ms
[2021-05-09 22:20:09] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=4 took 5824 ms
[2021-05-09 22:20:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=4 took 2700 ms
[2021-05-09 22:20:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=4 took 3873 ms
[2021-05-09 22:20:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-02
[2021-05-09 22:20:19] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(SAT) depth K=1 took 23568 ms
[2021-05-09 22:20:21] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=4 took 5091 ms
[2021-05-09 22:20:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=4 took 2696 ms
[2021-05-09 22:20:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-03
[2021-05-09 22:20:44] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(SAT) depth K=1 took 24327 ms
[2021-05-09 22:20:44] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-04
[2021-05-09 22:20:44] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-04
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-04 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2021-05-09 22:20:44] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(FALSE) depth K=1 took 350 ms
SDD proceeding with computation,16 properties remain. new max is 524288
SDD size :1.28356e+06 after 4.09604e+06
[2021-05-09 22:21:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-05
[2021-05-09 22:21:32] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(SAT) depth K=1 took 47702 ms
[2021-05-09 22:21:32] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-06
[2021-05-09 22:21:32] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-06
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-06 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2021-05-09 22:21:32] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(FALSE) depth K=1 took 32 ms
[2021-05-09 22:21:32] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-07
[2021-05-09 22:21:32] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-07
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-07 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2021-05-09 22:21:32] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(FALSE) depth K=1 took 213 ms
[2021-05-09 22:21:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-08
[2021-05-09 22:21:58] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(SAT) depth K=1 took 25465 ms
[2021-05-09 22:22:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-09
[2021-05-09 22:22:27] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(SAT) depth K=1 took 29542 ms
[2021-05-09 22:23:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-10
[2021-05-09 22:23:00] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(SAT) depth K=1 took 32762 ms
[2021-05-09 22:23:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-11
[2021-05-09 22:23:09] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(SAT) depth K=1 took 8936 ms
[2021-05-09 22:23:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-12
[2021-05-09 22:23:29] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(SAT) depth K=1 took 19742 ms
[2021-05-09 22:23:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-13
[2021-05-09 22:23:55] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(SAT) depth K=1 took 26906 ms
[2021-05-09 22:24:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-14
[2021-05-09 22:24:21] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(SAT) depth K=1 took 25091 ms
[2021-05-09 22:24:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-15
[2021-05-09 22:24:39] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(SAT) depth K=1 took 18663 ms
[2021-05-09 22:33:19] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=5 took 774937 ms
[2021-05-09 22:36:45] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=5 took 206410 ms
SDD proceeding with computation,16 properties remain. new max is 1048576
[2021-05-09 22:37:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=5 took 29030 ms
SDD size :4.09604e+06 after 8.57434e+08
[2021-05-09 22:37:39] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=5 took 25238 ms
[2021-05-09 22:40:26] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=5 took 166581 ms
[2021-05-09 22:41:57] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=5 took 91233 ms
[2021-05-09 22:42:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=5 took 27014 ms
[2021-05-09 22:42:52] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=5 took 27253 ms
[2021-05-09 22:43:28] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=5 took 36076 ms
[2021-05-09 22:44:58] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=5 took 90650 ms
[2021-05-09 22:45:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=5 took 25572 ms
[2021-05-09 22:47:23] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=5 took 119399 ms
Detected timeout of ITS tools.
[2021-05-09 22:48:18] [INFO ] Applying decomposition
[2021-05-09 22:48:19] [INFO ] Flatten gal took : 1162 ms
[2021-05-09 22:48:19] [INFO ] Decomposing Gal with order
[2021-05-09 22:48:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 22:48:21] [INFO ] Removed a total of 11082 redundant transitions.
[2021-05-09 22:48:21] [INFO ] Flatten gal took : 1233 ms
[2021-05-09 22:48:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 734 labels/synchronizations in 4904 ms.
[2021-05-09 22:48:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3928468670824461742.gal : 53 ms
[2021-05-09 22:48:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9870855069650516661.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3928468670824461742.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9870855069650516661.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3928468670824461742.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9870855069650516661.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9870855069650516661.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :17 after 35
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :35 after 39
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :39 after 41
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :41 after 51
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :51 after 258
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :258 after 407
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :407 after 886
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :886 after 1589
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :1589 after 49310
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :49310 after 140447
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :140447 after 355373
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :355373 after 763286
SDD proceeding with computation,12 properties remain. new max is 262144
SDD size :763286 after 1.55095e+06
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875400446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;