Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117600080.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
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 r089-tall-165260117600080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 29 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 29 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 29 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-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 1655068533011

Running Version 0
[2022-06-12 21:15:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:15:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:15:34] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2022-06-12 21:15:34] [INFO ] Transformed 5304 places.
[2022-06-12 21:15:34] [INFO ] Transformed 4998 transitions.
[2022-06-12 21:15:34] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 325 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 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 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 28 resets, run finished after 13 ms. (steps per millisecond=76 ) 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 27 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 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 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 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 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 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 29 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 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 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 802458 steps, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 802458 steps, saw 401281 distinct states, run finished after 30016 ms. (steps per millisecond=26 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 4998 rows 5304 cols
[2022-06-12 21:16:06] [INFO ] Invariants computation overflowed in 273 ms
[2022-06-12 21:16:08] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:16
[2022-06-12 21:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:33] [INFO ] [Nat]Absence check using state equation in 22403 ms returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-12 21:16:33] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :14
Fused 16 Parikh solutions to 1 different solutions.
Support contains 434 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.14 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 801 transitions
Trivial Post-agglo rules discarded 801 transitions
Performed 801 trivial Post agglomeration. Transition count delta: 801
Iterating post reduction 0 with 804 rules applied. Total rules applied 805 place count 5297 transition count 4195
Reduce places removed 801 places and 0 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Iterating post reduction 1 with 925 rules applied. Total rules applied 1730 place count 4496 transition count 4071
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 1854 place count 4372 transition count 4071
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 213 Pre rules applied. Total rules applied 1854 place count 4372 transition count 3858
Deduced a syphon composed of 213 places in 250 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 3 with 426 rules applied. Total rules applied 2280 place count 4159 transition count 3858
Performed 706 Post agglomeration using F-continuation condition.Transition count delta: 706
Deduced a syphon composed of 706 places in 106 ms
Reduce places removed 706 places and 0 transitions.
Iterating global reduction 3 with 1412 rules applied. Total rules applied 3692 place count 3453 transition count 3152
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 95 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3894 place count 3352 transition count 3152
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 105 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3990 place count 3304 transition count 3152
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4000 place count 3304 transition count 3142
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 4010 place count 3294 transition count 3142
Free-agglomeration rule (complex) applied 419 times.
Iterating global reduction 4 with 419 rules applied. Total rules applied 4429 place count 3294 transition count 2723
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 4 with 419 rules applied. Total rules applied 4848 place count 2875 transition count 2723
Partial Free-agglomeration rule applied 380 times.
Drop transitions removed 380 transitions
Iterating global reduction 5 with 380 rules applied. Total rules applied 5228 place count 2875 transition count 2723
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 5230 place count 2875 transition count 2723
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5231 place count 2874 transition count 2722
Applied a total of 5231 rules in 2797 ms. Remains 2874 /5304 variables (removed 2430) and now considering 2722/4998 (removed 2276) transitions.
Finished structural reductions, in 1 iterations. Remains : 2874/5304 places, 2722/4998 transitions.
[2022-06-12 21:16:36] [INFO ] Flatten gal took : 319 ms
[2022-06-12 21:16:37] [INFO ] Flatten gal took : 174 ms
[2022-06-12 21:16:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14008796449375265715.gal : 57 ms
[2022-06-12 21:16:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7263386384421625764.prop : 2 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/ReachabilityCardinality14008796449375265715.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7263386384421625764.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/ReachabilityCardinality14008796449375265715.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7263386384421625764.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7263386384421625764.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :15 after 31
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :31 after 48
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :48 after 90
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :90 after 377
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :377 after 1316
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1316 after 35809
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :35809 after 263384
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :263384 after 791413
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :791413 after 1.3553e+07
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :1.3553e+07 after 8.61918e+07
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :8.61918e+07 after 2.77781e+08
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :2.77781e+08 after 7.20378e+08
Detected timeout of ITS tools.
[2022-06-12 21:16:52] [INFO ] Flatten gal took : 148 ms
[2022-06-12 21:16:52] [INFO ] Applying decomposition
[2022-06-12 21:16:52] [INFO ] Flatten gal took : 160 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/graph9470753273647295583.txt, -o, /tmp/graph9470753273647295583.bin, -w, /tmp/graph9470753273647295583.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/graph9470753273647295583.bin, -l, -1, -v, -w, /tmp/graph9470753273647295583.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:16:53] [INFO ] Decomposing Gal with order
[2022-06-12 21:16:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:16:53] [INFO ] Removed a total of 2546 redundant transitions.
[2022-06-12 21:16:53] [INFO ] Flatten gal took : 373 ms
[2022-06-12 21:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 419 labels/synchronizations in 181 ms.
[2022-06-12 21:16:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16985688963263534969.gal : 40 ms
[2022-06-12 21:16:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16688826996939345344.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/ReachabilityCardinality16985688963263534969.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16688826996939345344.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/ReachabilityCardinality16985688963263534969.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16688826996939345344.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16688826996939345344.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :15 after 28
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :28 after 48
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :48 after 90
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :90 after 378
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :378 after 1265
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1265 after 13023
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :13023 after 91591
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :91591 after 268343
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :268343 after 631114
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :631114 after 4.61698e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1004395554342180957
[2022-06-12 21:17:09] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1004395554342180957
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/ltsmin1004395554342180957]
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/ltsmin1004395554342180957] 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/ltsmin1004395554342180957] 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 75388 resets, run finished after 4270 ms. (steps per millisecond=234 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5385 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5458 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5440 resets, run finished after 320 ms. (steps per millisecond=312 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5431 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 5466 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5461 resets, run finished after 258 ms. (steps per millisecond=387 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5413 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5408 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5467 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5433 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 5408 resets, run finished after 336 ms. (steps per millisecond=297 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5433 resets, run finished after 349 ms. (steps per millisecond=286 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5420 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5480 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 5436 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100000 steps, including 5467 resets, run finished after 258 ms. (steps per millisecond=387 ) properties (out of 16) seen :0
Probably explored full state space saw : 387455 states, properties seen :{}
Probabilistic random walk after 774927 steps, saw 387455 distinct states, run finished after 19423 ms. (steps per millisecond=39 ) properties seen :{}
Interrupted probabilistic random walk after 1082895 steps, run timeout after 30001 ms. (steps per millisecond=36 ) properties seen :{}
Exhaustive walk after 1082895 steps, saw 542164 distinct states, run finished after 30001 ms. (steps per millisecond=36 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 2722 rows 2874 cols
[2022-06-12 21:18:08] [INFO ] Invariants computation overflowed in 80 ms
[2022-06-12 21:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:19] [INFO ] [Real]Absence check using state equation in 10664 ms returned sat
[2022-06-12 21:18:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:32] [INFO ] [Nat]Absence check using state equation in 11850 ms returned sat
[2022-06-12 21:18:32] [INFO ] State equation strengthened by 285 read => feed constraints.
[2022-06-12 21:18:32] [INFO ] [Nat]Added 285 Read/Feed constraints in 592 ms returned sat
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 2 places in 933 ms of which 8 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 15 places in 980 ms of which 2 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 15 places in 926 ms of which 3 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 10 places in 889 ms of which 3 ms to minimize.
[2022-06-12 21:18:37] [INFO ] Deduced a trap composed of 15 places in 1036 ms of which 2 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5448 ms
[2022-06-12 21:18:38] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 169 ms.
[2022-06-12 21:18:45] [INFO ] Added : 5 causal constraints over 1 iterations in 7099 ms. Result :unknown
[2022-06-12 21:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:12] [INFO ] [Real]Absence check using state equation in 26775 ms returned sat
[2022-06-12 21:19:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:43] [INFO ] [Nat]Absence check using state equation in 31354 ms returned sat
[2022-06-12 21:19:44] [INFO ] [Nat]Added 285 Read/Feed constraints in 392 ms returned sat
[2022-06-12 21:19:45] [INFO ] Deduced a trap composed of 18 places in 864 ms of which 1 ms to minimize.
[2022-06-12 21:19:46] [INFO ] Deduced a trap composed of 2 places in 830 ms of which 3 ms to minimize.
[2022-06-12 21:19:47] [INFO ] Deduced a trap composed of 14 places in 821 ms of which 1 ms to minimize.
[2022-06-12 21:19:48] [INFO ] Deduced a trap composed of 12 places in 826 ms of which 2 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 12 places in 829 ms of which 2 ms to minimize.
[2022-06-12 21:19:49] [INFO ] Deduced a trap composed of 7 places in 803 ms of which 4 ms to minimize.
[2022-06-12 21:19:50] [INFO ] Deduced a trap composed of 13 places in 803 ms of which 2 ms to minimize.
[2022-06-12 21:19:51] [INFO ] Deduced a trap composed of 20 places in 788 ms of which 1 ms to minimize.
[2022-06-12 21:19:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7560 ms
[2022-06-12 21:19:52] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 134 ms.
[2022-06-12 21:19:57] [INFO ] Added : 10 causal constraints over 2 iterations in 5442 ms. Result :unknown
[2022-06-12 21:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:12] [INFO ] [Real]Absence check using state equation in 14760 ms returned sat
[2022-06-12 21:20:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:29] [INFO ] [Nat]Absence check using state equation in 16369 ms returned sat
[2022-06-12 21:20:31] [INFO ] [Nat]Added 285 Read/Feed constraints in 1888 ms returned sat
[2022-06-12 21:20:32] [INFO ] Deduced a trap composed of 2 places in 963 ms of which 2 ms to minimize.
[2022-06-12 21:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1179 ms
[2022-06-12 21:20:32] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 127 ms.
[2022-06-12 21:20:39] [INFO ] Added : 10 causal constraints over 2 iterations in 6795 ms. Result :unknown
[2022-06-12 21:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:46] [INFO ] [Real]Absence check using state equation in 7360 ms returned unknown
[2022-06-12 21:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:55] [INFO ] [Real]Absence check using state equation in 8749 ms returned sat
[2022-06-12 21:20:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:05] [INFO ] [Nat]Absence check using state equation in 9847 ms returned sat
[2022-06-12 21:21:07] [INFO ] [Nat]Added 285 Read/Feed constraints in 1386 ms returned sat
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 2 places in 919 ms of which 1 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Deduced a trap composed of 10 places in 913 ms of which 2 ms to minimize.
[2022-06-12 21:21:10] [INFO ] Deduced a trap composed of 11 places in 889 ms of which 4 ms to minimize.
[2022-06-12 21:21:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3197 ms
[2022-06-12 21:21:10] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 256 ms.
[2022-06-12 21:21:17] [INFO ] Added : 5 causal constraints over 1 iterations in 6753 ms. Result :unknown
[2022-06-12 21:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:02] [INFO ] [Real]Absence check using state equation in 44792 ms returned unknown
[2022-06-12 21:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:32] [INFO ] [Real]Absence check using state equation in 29726 ms returned sat
[2022-06-12 21:22:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:17] [INFO ] [Nat]Absence check using state equation in 44821 ms returned unknown
[2022-06-12 21:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:38] [INFO ] [Real]Absence check using state equation in 21177 ms returned unsat
[2022-06-12 21:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:52] [INFO ] [Real]Absence check using state equation in 13753 ms returned sat
[2022-06-12 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:05] [INFO ] [Nat]Absence check using state equation in 12455 ms returned sat
[2022-06-12 21:24:07] [INFO ] [Nat]Added 285 Read/Feed constraints in 1581 ms returned sat
[2022-06-12 21:24:07] [INFO ] Deduced a trap composed of 17 places in 840 ms of which 2 ms to minimize.
[2022-06-12 21:24:08] [INFO ] Deduced a trap composed of 14 places in 862 ms of which 2 ms to minimize.
[2022-06-12 21:24:09] [INFO ] Deduced a trap composed of 24 places in 841 ms of which 2 ms to minimize.
[2022-06-12 21:24:10] [INFO ] Deduced a trap composed of 30 places in 825 ms of which 2 ms to minimize.
[2022-06-12 21:24:11] [INFO ] Deduced a trap composed of 19 places in 840 ms of which 2 ms to minimize.
[2022-06-12 21:24:12] [INFO ] Deduced a trap composed of 18 places in 839 ms of which 2 ms to minimize.
[2022-06-12 21:24:13] [INFO ] Deduced a trap composed of 7 places in 759 ms of which 1 ms to minimize.
[2022-06-12 21:24:14] [INFO ] Deduced a trap composed of 55 places in 770 ms of which 1 ms to minimize.
[2022-06-12 21:24:15] [INFO ] Deduced a trap composed of 41 places in 761 ms of which 2 ms to minimize.
[2022-06-12 21:24:16] [INFO ] Deduced a trap composed of 50 places in 762 ms of which 2 ms to minimize.
[2022-06-12 21:24:17] [INFO ] Deduced a trap composed of 53 places in 756 ms of which 2 ms to minimize.
[2022-06-12 21:24:18] [INFO ] Deduced a trap composed of 48 places in 829 ms of which 104 ms to minimize.
[2022-06-12 21:24:18] [INFO ] Deduced a trap composed of 52 places in 732 ms of which 1 ms to minimize.
[2022-06-12 21:24:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 12129 ms
[2022-06-12 21:24:19] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 125 ms.
[2022-06-12 21:24:32] [INFO ] Added : 5 causal constraints over 1 iterations in 13555 ms. Result :unknown
[2022-06-12 21:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:40] [INFO ] [Real]Absence check using state equation in 7260 ms returned unknown
[2022-06-12 21:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:44] [INFO ] [Real]Absence check using state equation in 3985 ms returned sat
[2022-06-12 21:24:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:48] [INFO ] [Nat]Absence check using state equation in 4029 ms returned sat
[2022-06-12 21:24:48] [INFO ] [Nat]Added 285 Read/Feed constraints in 274 ms returned sat
[2022-06-12 21:24:50] [INFO ] Deduced a trap composed of 2 places in 1483 ms of which 3 ms to minimize.
[2022-06-12 21:24:52] [INFO ] Deduced a trap composed of 10 places in 1459 ms of which 2 ms to minimize.
[2022-06-12 21:24:53] [INFO ] Deduced a trap composed of 13 places in 1450 ms of which 3 ms to minimize.
[2022-06-12 21:24:55] [INFO ] Deduced a trap composed of 11 places in 1473 ms of which 9 ms to minimize.
[2022-06-12 21:24:56] [INFO ] Deduced a trap composed of 26 places in 1446 ms of which 2 ms to minimize.
[2022-06-12 21:24:58] [INFO ] Deduced a trap composed of 22 places in 1500 ms of which 2 ms to minimize.
[2022-06-12 21:24:59] [INFO ] Deduced a trap composed of 24 places in 1443 ms of which 2 ms to minimize.
[2022-06-12 21:25:01] [INFO ] Deduced a trap composed of 21 places in 1454 ms of which 2 ms to minimize.
[2022-06-12 21:25:02] [INFO ] Deduced a trap composed of 19 places in 1367 ms of which 2 ms to minimize.
[2022-06-12 21:25:04] [INFO ] Deduced a trap composed of 11 places in 1453 ms of which 2 ms to minimize.
[2022-06-12 21:25:05] [INFO ] Deduced a trap composed of 14 places in 1452 ms of which 2 ms to minimize.
[2022-06-12 21:25:07] [INFO ] Deduced a trap composed of 8 places in 1418 ms of which 2 ms to minimize.
[2022-06-12 21:25:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 18497 ms
[2022-06-12 21:25:07] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 130 ms.
[2022-06-12 21:25:11] [INFO ] Added : 15 causal constraints over 3 iterations in 4035 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:33] [INFO ] [Real]Absence check using state equation in 21560 ms returned unknown
[2022-06-12 21:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:40] [INFO ] [Real]Absence check using state equation in 7197 ms returned sat
[2022-06-12 21:25:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:58] [INFO ] [Nat]Absence check using state equation in 17256 ms returned unknown
[2022-06-12 21:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:22] [INFO ] [Real]Absence check using state equation in 24250 ms returned sat
[2022-06-12 21:26:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:39] [INFO ] [Nat]Absence check using state equation in 15881 ms returned sat
[2022-06-12 21:26:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:26:43] [INFO ] [Nat]Added 285 Read/Feed constraints in 3976 ms returned sat
[2022-06-12 21:26:44] [INFO ] Deduced a trap composed of 2 places in 928 ms of which 2 ms to minimize.
[2022-06-12 21:26:45] [INFO ] Deduced a trap composed of 17 places in 986 ms of which 2 ms to minimize.
[2022-06-12 21:26:46] [INFO ] Deduced a trap composed of 16 places in 990 ms of which 3 ms to minimize.
[2022-06-12 21:26:47] [INFO ] Deduced a trap composed of 19 places in 966 ms of which 1 ms to minimize.
[2022-06-12 21:26:48] [INFO ] Deduced a trap composed of 29 places in 968 ms of which 1 ms to minimize.
[2022-06-12 21:26:49] [INFO ] Deduced a trap composed of 32 places in 965 ms of which 1 ms to minimize.
[2022-06-12 21:26:50] [INFO ] Deduced a trap composed of 30 places in 995 ms of which 7 ms to minimize.
[2022-06-12 21:26:52] [INFO ] Deduced a trap composed of 18 places in 974 ms of which 2 ms to minimize.
[2022-06-12 21:26:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 9282 ms
[2022-06-12 21:26:52] [INFO ] Computed and/alt/rep : 2526/11388/2526 causal constraints (skipped 195 transitions) in 128 ms.
[2022-06-12 21:26:56] [INFO ] Added : 5 causal constraints over 1 iterations in 3855 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-12 21:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:41] [INFO ] [Real]Absence check using state equation in 44791 ms returned unknown
[2022-06-12 21:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:22] [INFO ] [Real]Absence check using state equation in 41327 ms returned sat
[2022-06-12 21:28:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:45] [INFO ] [Nat]Absence check using state equation in 22135 ms returned sat
[2022-06-12 21:28:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:28:51] [INFO ] [Nat]Added 285 Read/Feed constraints in 6391 ms returned unknown
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 8 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 15) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
Interrupted Parikh walk after 7123101 steps, including 575450 resets, run timeout after 30001 ms. (steps per millisecond=237 ) properties (out of 15) seen :0
This parikh vector is obviously unfeasible : no match in initial state.
Interrupted Parikh walk after 7426614 steps, including 599860 resets, run timeout after 30001 ms. (steps per millisecond=247 ) properties (out of 15) seen :0
Support contains 398 out of 2874 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2874/2874 places, 2722/2722 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2874 transition count 2719
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 2871 transition count 2718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 2870 transition count 2718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 2870 transition count 2717
Deduced a syphon composed of 1 places in 57 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2869 transition count 2717
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 73 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 42 place count 2853 transition count 2701
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 57 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 2849 transition count 2701
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 2849 transition count 2699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 2847 transition count 2699
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 66 place count 2847 transition count 2687
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 78 place count 2835 transition count 2687
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 85 place count 2835 transition count 2687
Applied a total of 85 rules in 920 ms. Remains 2835 /2874 variables (removed 39) and now considering 2687/2722 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 2835/2874 places, 2687/2722 transitions.
[2022-06-12 21:29:53] [INFO ] Flatten gal took : 182 ms
[2022-06-12 21:29:53] [INFO ] Flatten gal took : 135 ms
[2022-06-12 21:29:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7676028659024173912.gal : 13 ms
[2022-06-12 21:29:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13734045385181845505.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/ReachabilityCardinality7676028659024173912.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13734045385181845505.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/ReachabilityCardinality7676028659024173912.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13734045385181845505.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13734045385181845505.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :15 after 31
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :31 after 48
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :48 after 90
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :90 after 377
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :377 after 1316
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1316 after 35809
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :35809 after 263384
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :263384 after 791413
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :791413 after 1.3553e+07
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :1.3553e+07 after 8.61918e+07
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :8.61918e+07 after 2.77781e+08
Detected timeout of ITS tools.
[2022-06-12 21:30:08] [INFO ] Flatten gal took : 124 ms
[2022-06-12 21:30:08] [INFO ] Applying decomposition
[2022-06-12 21:30:08] [INFO ] Flatten gal took : 123 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/graph12414438273263577821.txt, -o, /tmp/graph12414438273263577821.bin, -w, /tmp/graph12414438273263577821.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/graph12414438273263577821.bin, -l, -1, -v, -w, /tmp/graph12414438273263577821.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:30:08] [INFO ] Decomposing Gal with order
[2022-06-12 21:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:30:09] [INFO ] Removed a total of 2992 redundant transitions.
[2022-06-12 21:30:09] [INFO ] Flatten gal took : 269 ms
[2022-06-12 21:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 475 labels/synchronizations in 138 ms.
[2022-06-12 21:30:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2440619446402997455.gal : 23 ms
[2022-06-12 21:30:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13726933272277729150.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/ReachabilityCardinality2440619446402997455.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13726933272277729150.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/ReachabilityCardinality2440619446402997455.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13726933272277729150.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13726933272277729150.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :27 after 46
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :46 after 82
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :82 after 386
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :386 after 1355
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1355 after 44383
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :44383 after 292178
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :292178 after 835953
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :835953 after 1.62836e+07
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :1.62836e+07 after 1.05066e+08
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :1.05066e+08 after 3.52459e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10018872682486998719
[2022-06-12 21:30:24] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10018872682486998719
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/ltsmin10018872682486998719]
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/ltsmin10018872682486998719] 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/ltsmin10018872682486998719] 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 75451 resets, run finished after 3540 ms. (steps per millisecond=282 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5496 resets, run finished after 320 ms. (steps per millisecond=312 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5419 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5407 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5520 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5465 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5505 resets, run finished after 256 ms. (steps per millisecond=390 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5430 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5445 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5413 resets, run finished after 259 ms. (steps per millisecond=386 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5402 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5432 resets, run finished after 322 ms. (steps per millisecond=310 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5468 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5435 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 5419 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5428 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 1092903 steps, run timeout after 30001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 1092903 steps, saw 547146 distinct states, run finished after 30001 ms. (steps per millisecond=36 ) properties seen :{}
Running SMT prover for 15 properties.
// Phase 1: matrix 2687 rows 2835 cols
[2022-06-12 21:31:03] [INFO ] Invariants computation overflowed in 55 ms
[2022-06-12 21:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:23] [INFO ] [Real]Absence check using state equation in 19124 ms returned sat
[2022-06-12 21:31:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:43] [INFO ] [Nat]Absence check using state equation in 20455 ms returned sat
[2022-06-12 21:31:43] [INFO ] State equation strengthened by 291 read => feed constraints.
[2022-06-12 21:31:44] [INFO ] [Nat]Added 291 Read/Feed constraints in 928 ms returned sat
[2022-06-12 21:31:45] [INFO ] Deduced a trap composed of 2 places in 984 ms of which 2 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 14 places in 1020 ms of which 2 ms to minimize.
[2022-06-12 21:31:48] [INFO ] Deduced a trap composed of 11 places in 968 ms of which 5 ms to minimize.
[2022-06-12 21:31:49] [INFO ] Deduced a trap composed of 8 places in 963 ms of which 2 ms to minimize.
[2022-06-12 21:31:50] [INFO ] Deduced a trap composed of 19 places in 964 ms of which 2 ms to minimize.
[2022-06-12 21:31:51] [INFO ] Deduced a trap composed of 12 places in 963 ms of which 2 ms to minimize.
[2022-06-12 21:31:52] [INFO ] Deduced a trap composed of 11 places in 992 ms of which 13 ms to minimize.
[2022-06-12 21:31:53] [INFO ] Deduced a trap composed of 27 places in 981 ms of which 2 ms to minimize.
[2022-06-12 21:31:54] [INFO ] Deduced a trap composed of 28 places in 923 ms of which 1 ms to minimize.
[2022-06-12 21:31:55] [INFO ] Deduced a trap composed of 32 places in 916 ms of which 1 ms to minimize.
[2022-06-12 21:31:56] [INFO ] Deduced a trap composed of 36 places in 893 ms of which 2 ms to minimize.
[2022-06-12 21:31:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 11985 ms
[2022-06-12 21:31:57] [INFO ] Computed and/alt/rep : 2474/11450/2474 causal constraints (skipped 212 transitions) in 162 ms.
[2022-06-12 21:32:03] [INFO ] Added : 5 causal constraints over 1 iterations in 6901 ms. Result :unknown
[2022-06-12 21:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:15] [INFO ] [Real]Absence check using state equation in 11426 ms returned sat
[2022-06-12 21:32:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:36] [INFO ] [Nat]Absence check using state equation in 20246 ms returned sat
[2022-06-12 21:32:38] [INFO ] [Nat]Added 291 Read/Feed constraints in 1973 ms returned sat
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 3 places in 1010 ms of which 2 ms to minimize.
[2022-06-12 21:32:40] [INFO ] Deduced a trap composed of 12 places in 1000 ms of which 2 ms to minimize.
[2022-06-12 21:32:41] [INFO ] Deduced a trap composed of 13 places in 1010 ms of which 2 ms to minimize.
[2022-06-12 21:32:42] [INFO ] Deduced a trap composed of 15 places in 988 ms of which 2 ms to minimize.
[2022-06-12 21:32:43] [INFO ] Deduced a trap composed of 15 places in 973 ms of which 7 ms to minimize.
[2022-06-12 21:32:44] [INFO ] Deduced a trap composed of 20 places in 992 ms of which 1 ms to minimize.
[2022-06-12 21:32:45] [INFO ] Deduced a trap composed of 19 places in 1001 ms of which 2 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Deduced a trap composed of 20 places in 971 ms of which 2 ms to minimize.
[2022-06-12 21:32:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8886 ms
[2022-06-12 21:32:47] [INFO ] Computed and/alt/rep : 2474/11450/2474 causal constraints (skipped 212 transitions) in 127 ms.
[2022-06-12 21:32:53] [INFO ] Added : 5 causal constraints over 1 iterations in 6311 ms. Result :unknown
[2022-06-12 21:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:03] [INFO ] [Real]Absence check using state equation in 10331 ms returned sat
[2022-06-12 21:33:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:27] [INFO ] [Nat]Absence check using state equation in 23333 ms returned sat
[2022-06-12 21:33:28] [INFO ] [Nat]Added 291 Read/Feed constraints in 1249 ms returned sat
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 2 places in 862 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1105 ms
[2022-06-12 21:33:29] [INFO ] Computed and/alt/rep : 2474/11450/2474 causal constraints (skipped 212 transitions) in 127 ms.
[2022-06-12 21:33:36] [INFO ] Added : 5 causal constraints over 1 iterations in 6874 ms. Result :unknown
[2022-06-12 21:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:44] [INFO ] [Real]Absence check using state equation in 7201 ms returned unknown
[2022-06-12 21:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:54] [INFO ] [Real]Absence check using state equation in 10124 ms returned sat
[2022-06-12 21:33:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:10] [INFO ] [Nat]Absence check using state equation in 15298 ms returned sat
[2022-06-12 21:34:10] [INFO ] [Nat]Added 291 Read/Feed constraints in 680 ms returned sat
[2022-06-12 21:34:11] [INFO ] Deduced a trap composed of 2 places in 716 ms of which 2 ms to minimize.
[2022-06-12 21:34:12] [INFO ] Deduced a trap composed of 10 places in 732 ms of which 2 ms to minimize.
[2022-06-12 21:34:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1859 ms
[2022-06-12 21:34:12] [INFO ] Computed and/alt/rep : 2474/11450/2474 causal constraints (skipped 212 transitions) in 129 ms.
[2022-06-12 21:34:18] [INFO ] Added : 5 causal constraints over 1 iterations in 6315 ms. Result :unknown
[2022-06-12 21:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:35:04] [INFO ] [Real]Absence check using state equation in 44819 ms returned unknown
[2022-06-12 21:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:35:26] [INFO ] [Real]Absence check using state equation in 22385 ms returned sat
[2022-06-12 21:35:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:35:49] [INFO ] [Nat]Absence check using state equation in 22776 ms returned sat
[2022-06-12 21:35:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:35:55] [INFO ] [Nat]Added 291 Read/Feed constraints in 6082 ms returned unknown
[2022-06-12 21:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:12] [INFO ] [Real]Absence check using state equation in 16111 ms returned sat
[2022-06-12 21:36:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:40] [INFO ] [Nat]Absence check using state equation in 27501 ms returned sat
[2022-06-12 21:36:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:36:46] [INFO ] [Nat]Added 291 Read/Feed constraints in 6278 ms returned unknown
[2022-06-12 21:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:53] [INFO ] [Real]Absence check using state equation in 7162 ms returned unknown
[2022-06-12 21:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:08] [INFO ] [Real]Absence check using state equation in 14405 ms returned unknown
[2022-06-12 21:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:30] [INFO ] [Real]Absence check using state equation in 21980 ms returned sat
[2022-06-12 21:37:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:15] [INFO ] [Nat]Absence check using state equation in 44814 ms returned unknown
[2022-06-12 21:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:22] [INFO ] [Real]Absence check using state equation in 6899 ms returned sat
[2022-06-12 21:38:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:34] [INFO ] [Nat]Absence check using state equation in 11533 ms returned unknown
[2022-06-12 21:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:48] [INFO ] [Real]Absence check using state equation in 13548 ms returned unknown
[2022-06-12 21:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:33] [INFO ] [Real]Absence check using state equation in 44811 ms returned unknown
[2022-06-12 21:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:34] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2022-06-12 21:39:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:40:03] [INFO ] [Nat]Absence check using state equation in 28650 ms returned unknown
Fused 15 Parikh solutions to 5 different solutions.
Interrupted Parikh walk after 6668135 steps, including 538684 resets, run timeout after 30001 ms. (steps per millisecond=222 ) properties (out of 15) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 15) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 15) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 398 out of 2835 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2835/2835 places, 2687/2687 transitions.
Applied a total of 0 rules in 131 ms. Remains 2835 /2835 variables (removed 0) and now considering 2687/2687 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2835/2835 places, 2687/2687 transitions.
Starting structural reductions, iteration 0 : 2835/2835 places, 2687/2687 transitions.
Applied a total of 0 rules in 148 ms. Remains 2835 /2835 variables (removed 0) and now considering 2687/2687 (removed 0) transitions.
// Phase 1: matrix 2687 rows 2835 cols
[2022-06-12 21:40:34] [INFO ] Invariants computation overflowed in 55 ms
[2022-06-12 21:40:35] [INFO ] Implicit Places using invariants in 1634 ms returned []
// Phase 1: matrix 2687 rows 2835 cols
[2022-06-12 21:40:35] [INFO ] Invariants computation overflowed in 34 ms
[2022-06-12 21:40:38] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 3939 ms to find 0 implicit places.
[2022-06-12 21:40:38] [INFO ] Redundant transitions in 180 ms returned []
// Phase 1: matrix 2687 rows 2835 cols
[2022-06-12 21:40:38] [INFO ] Invariants computation overflowed in 41 ms
[2022-06-12 21:40:39] [INFO ] Dead Transitions using invariants and state equation in 1243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2835/2835 places, 2687/2687 transitions.
Incomplete random walk after 100000 steps, including 7578 resets, run finished after 472 ms. (steps per millisecond=211 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2687 rows 2835 cols
[2022-06-12 21:40:40] [INFO ] Invariants computation overflowed in 44 ms
[2022-06-12 21:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:40:59] [INFO ] [Real]Absence check using state equation in 19455 ms returned sat
[2022-06-12 21:40:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:19] [INFO ] [Nat]Absence check using state equation in 19780 ms returned unknown
[2022-06-12 21:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:31] [INFO ] [Real]Absence check using state equation in 11855 ms returned sat
[2022-06-12 21:41:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:52] [INFO ] [Nat]Absence check using state equation in 19782 ms returned unknown
[2022-06-12 21:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:42:02] [INFO ] [Real]Absence check using state equation in 10565 ms returned sat
[2022-06-12 21:42:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:42:23] [INFO ] [Nat]Absence check using state equation in 19792 ms returned unknown
[2022-06-12 21:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:42:30] [INFO ] [Real]Absence check using state equation in 7130 ms returned unknown
[2022-06-12 21:42:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:42:40] [INFO ] [Real]Absence check using state equation in 9988 ms returned sat
[2022-06-12 21:42:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:42:56] [INFO ] [Nat]Absence check using state equation in 15178 ms returned sat
[2022-06-12 21:42:56] [INFO ] State equation strengthened by 291 read => feed constraints.
[2022-06-12 21:42:56] [INFO ] [Nat]Added 291 Read/Feed constraints in 694 ms returned sat
[2022-06-12 21:42:57] [INFO ] Deduced a trap composed of 2 places in 767 ms of which 2 ms to minimize.
[2022-06-12 21:42:58] [INFO ] Deduced a trap composed of 10 places in 675 ms of which 2 ms to minimize.
[2022-06-12 21:42:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1859 ms
[2022-06-12 21:42:58] [INFO ] Computed and/alt/rep : 2474/11450/2474 causal constraints (skipped 212 transitions) in 131 ms.
[2022-06-12 21:43:00] [INFO ] Added : 5 causal constraints over 1 iterations in 2070 ms. Result :unknown
[2022-06-12 21:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:43:20] [INFO ] [Real]Absence check using state equation in 19797 ms returned unknown
[2022-06-12 21:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:43:40] [INFO ] [Real]Absence check using state equation in 19800 ms returned unknown
[2022-06-12 21:43:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:43:58] [INFO ] [Real]Absence check using state equation in 17113 ms returned sat
[2022-06-12 21:43:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:44:12] [INFO ] [Nat]Absence check using state equation in 14226 ms returned sat
[2022-06-12 21:44:15] [INFO ] [Nat]Added 291 Read/Feed constraints in 2769 ms returned sat
[2022-06-12 21:44:16] [INFO ] Deduced a trap composed of 2 places in 1025 ms of which 2 ms to minimize.
[2022-06-12 21:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1235 ms
[2022-06-12 21:44:16] [INFO ] Computed and/alt/rep : 2474/11450/2474 causal constraints (skipped 212 transitions) in 140 ms.
[2022-06-12 21:44:18] [INFO ] Added : 5 causal constraints over 1 iterations in 1583 ms. Result :unknown
[2022-06-12 21:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:44:25] [INFO ] [Real]Absence check using state equation in 7434 ms returned unknown
[2022-06-12 21:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:44:40] [INFO ] [Real]Absence check using state equation in 14549 ms returned unknown
[2022-06-12 21:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:45:00] [INFO ] [Real]Absence check using state equation in 19797 ms returned unknown
[2022-06-12 21:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:45:08] [INFO ] [Real]Absence check using state equation in 7038 ms returned sat
[2022-06-12 21:45:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:45:19] [INFO ] [Nat]Absence check using state equation in 11627 ms returned unknown
[2022-06-12 21:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:45:33] [INFO ] [Real]Absence check using state equation in 13396 ms returned unknown
[2022-06-12 21:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:45:53] [INFO ] [Real]Absence check using state equation in 19803 ms returned unknown
[2022-06-12 21:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:45:54] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2022-06-12 21:45:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:46:15] [INFO ] [Nat]Absence check using state equation in 19791 ms returned unknown
[2022-06-12 21:46:15] [INFO ] Flatten gal took : 151 ms
[2022-06-12 21:46:15] [INFO ] Flatten gal took : 143 ms
[2022-06-12 21:46:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3340961913124153719.gal : 25 ms
[2022-06-12 21:46:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9119444905277689095.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/ReachabilityCardinality3340961913124153719.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9119444905277689095.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/ReachabilityCardinality3340961913124153719.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9119444905277689095.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9119444905277689095.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :15 after 31
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :31 after 48
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :48 after 90
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :90 after 377
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :377 after 1316
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1316 after 35809
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :35809 after 263384
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :263384 after 791413
Detected timeout of ITS tools.
[2022-06-12 21:46:30] [INFO ] Flatten gal took : 126 ms
[2022-06-12 21:46:30] [INFO ] Applying decomposition
[2022-06-12 21:46:30] [INFO ] Flatten gal took : 127 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/graph12825929199510375072.txt, -o, /tmp/graph12825929199510375072.bin, -w, /tmp/graph12825929199510375072.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/graph12825929199510375072.bin, -l, -1, -v, -w, /tmp/graph12825929199510375072.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:46:31] [INFO ] Decomposing Gal with order
[2022-06-12 21:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:46:31] [INFO ] Removed a total of 3440 redundant transitions.
[2022-06-12 21:46:31] [INFO ] Flatten gal took : 230 ms
[2022-06-12 21:46:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 446 labels/synchronizations in 145 ms.
[2022-06-12 21:46:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality701338769137677981.gal : 51 ms
[2022-06-12 21:46:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18089077942187322971.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/ReachabilityCardinality701338769137677981.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18089077942187322971.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/ReachabilityCardinality701338769137677981.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18089077942187322971.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18089077942187322971.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :15 after 27
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :27 after 46
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :46 after 82
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :82 after 379
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :379 after 1674
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1674 after 28463
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :28463 after 266011
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :266011 after 836939
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1966311306528238127
[2022-06-12 21:46:47] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1966311306528238127
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/ltsmin1966311306528238127]
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/ltsmin1966311306528238127] 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/ltsmin1966311306528238127] 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 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 2835 transition count 2672
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 2820 transition count 2672
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 30 place count 2820 transition count 2555
Deduced a syphon composed of 117 places in 62 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 264 place count 2703 transition count 2555
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 274 place count 2703 transition count 2545
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 284 place count 2693 transition count 2545
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 285 place count 2693 transition count 2545
Applied a total of 285 rules in 554 ms. Remains 2693 /2835 variables (removed 142) and now considering 2545/2687 (removed 142) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 2545 rows 2693 cols
[2022-06-12 21:46:48] [INFO ] Invariants computation overflowed in 80 ms
[2022-06-12 21:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:47:00] [INFO ] [Real]Absence check using state equation in 11091 ms returned sat
[2022-06-12 21:47:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:47:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:47:16] [INFO ] [Nat]Absence check using state equation in 15913 ms returned sat
[2022-06-12 21:47:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-12 21:47:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 15 ms returned sat
[2022-06-12 21:47:17] [INFO ] Deduced a trap composed of 2 places in 818 ms of which 1 ms to minimize.
[2022-06-12 21:47:18] [INFO ] Deduced a trap composed of 12 places in 860 ms of which 2 ms to minimize.
[2022-06-12 21:47:19] [INFO ] Deduced a trap composed of 23 places in 801 ms of which 1 ms to minimize.
[2022-06-12 21:47:20] [INFO ] Deduced a trap composed of 8 places in 784 ms of which 1 ms to minimize.
[2022-06-12 21:47:20] [INFO ] Deduced a trap composed of 22 places in 791 ms of which 1 ms to minimize.
[2022-06-12 21:47:21] [INFO ] Deduced a trap composed of 42 places in 733 ms of which 1 ms to minimize.
[2022-06-12 21:47:22] [INFO ] Deduced a trap composed of 38 places in 724 ms of which 2 ms to minimize.
[2022-06-12 21:47:23] [INFO ] Deduced a trap composed of 36 places in 713 ms of which 2 ms to minimize.
[2022-06-12 21:47:26] [INFO ] Deduced a trap composed of 39 places in 741 ms of which 1 ms to minimize.
[2022-06-12 21:47:27] [INFO ] Deduced a trap composed of 41 places in 742 ms of which 2 ms to minimize.
[2022-06-12 21:47:31] [INFO ] Deduced a trap composed of 29 places in 742 ms of which 2 ms to minimize.
[2022-06-12 21:47:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 17195 ms
[2022-06-12 21:47:33] [INFO ] Computed and/alt/rep : 2334/10762/2334 causal constraints (skipped 210 transitions) in 123 ms.
[2022-06-12 21:47:40] [INFO ] Added : 5 causal constraints over 1 iterations in 6484 ms. Result :unknown
[2022-06-12 21:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:47:53] [INFO ] [Real]Absence check using state equation in 13274 ms returned sat
[2022-06-12 21:47:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:48:21] [INFO ] [Nat]Absence check using state equation in 27712 ms returned unknown
[2022-06-12 21:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:48:31] [INFO ] [Real]Absence check using state equation in 9520 ms returned sat
[2022-06-12 21:48:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:48:53] [INFO ] [Nat]Absence check using state equation in 21546 ms returned sat
[2022-06-12 21:48:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 15 ms returned sat
[2022-06-12 21:48:53] [INFO ] Deduced a trap composed of 2 places in 637 ms of which 1 ms to minimize.
[2022-06-12 21:48:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2022-06-12 21:48:54] [INFO ] Computed and/alt/rep : 2334/10762/2334 causal constraints (skipped 210 transitions) in 124 ms.
[2022-06-12 21:49:00] [INFO ] Added : 5 causal constraints over 1 iterations in 6424 ms. Result :unknown
[2022-06-12 21:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:49:08] [INFO ] [Real]Absence check using state equation in 7452 ms returned unknown
[2022-06-12 21:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:49:17] [INFO ] [Real]Absence check using state equation in 9080 ms returned sat
[2022-06-12 21:49:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:49:33] [INFO ] [Nat]Absence check using state equation in 15306 ms returned sat
[2022-06-12 21:49:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 92 ms returned sat
[2022-06-12 21:49:34] [INFO ] Deduced a trap composed of 9 places in 806 ms of which 1 ms to minimize.
[2022-06-12 21:49:34] [INFO ] Deduced a trap composed of 2 places in 797 ms of which 2 ms to minimize.
[2022-06-12 21:49:35] [INFO ] Deduced a trap composed of 16 places in 800 ms of which 1 ms to minimize.
[2022-06-12 21:49:36] [INFO ] Deduced a trap composed of 13 places in 840 ms of which 1 ms to minimize.
[2022-06-12 21:49:37] [INFO ] Deduced a trap composed of 14 places in 797 ms of which 1 ms to minimize.
[2022-06-12 21:49:38] [INFO ] Deduced a trap composed of 10 places in 859 ms of which 1 ms to minimize.
[2022-06-12 21:49:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5694 ms
[2022-06-12 21:49:39] [INFO ] Computed and/alt/rep : 2334/10762/2334 causal constraints (skipped 210 transitions) in 124 ms.
[2022-06-12 21:49:45] [INFO ] Added : 5 causal constraints over 1 iterations in 6322 ms. Result :unknown
[2022-06-12 21:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:50:30] [INFO ] [Real]Absence check using state equation in 44810 ms returned unknown
[2022-06-12 21:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:51:15] [INFO ] [Real]Absence check using state equation in 44819 ms returned unknown
[2022-06-12 21:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:51:30] [INFO ] [Real]Absence check using state equation in 15238 ms returned sat
[2022-06-12 21:51:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:51:44] [INFO ] [Nat]Absence check using state equation in 12988 ms returned sat
[2022-06-12 21:51:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 1131 ms returned sat
[2022-06-12 21:51:46] [INFO ] Deduced a trap composed of 12 places in 893 ms of which 1 ms to minimize.
[2022-06-12 21:51:47] [INFO ] Deduced a trap composed of 2 places in 883 ms of which 2 ms to minimize.
[2022-06-12 21:51:48] [INFO ] Deduced a trap composed of 11 places in 871 ms of which 1 ms to minimize.
[2022-06-12 21:51:49] [INFO ] Deduced a trap composed of 18 places in 857 ms of which 2 ms to minimize.
[2022-06-12 21:51:49] [INFO ] Deduced a trap composed of 7 places in 789 ms of which 2 ms to minimize.
[2022-06-12 21:51:50] [INFO ] Deduced a trap composed of 62 places in 780 ms of which 1 ms to minimize.
[2022-06-12 21:51:51] [INFO ] Deduced a trap composed of 73 places in 797 ms of which 2 ms to minimize.
[2022-06-12 21:51:52] [INFO ] Deduced a trap composed of 68 places in 765 ms of which 2 ms to minimize.
[2022-06-12 21:51:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7595 ms
[2022-06-12 21:51:52] [INFO ] Computed and/alt/rep : 2334/10762/2334 causal constraints (skipped 210 transitions) in 126 ms.
[2022-06-12 21:51:59] [INFO ] Added : 5 causal constraints over 1 iterations in 6737 ms. Result :unknown
[2022-06-12 21:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:52:06] [INFO ] [Real]Absence check using state equation in 7127 ms returned unknown
[2022-06-12 21:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:52:17] [INFO ] [Real]Absence check using state equation in 10027 ms returned unknown
[2022-06-12 21:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:52:28] [INFO ] [Real]Absence check using state equation in 11373 ms returned sat
[2022-06-12 21:52:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:53:13] [INFO ] [Nat]Absence check using state equation in 44799 ms returned unknown
[2022-06-12 21:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:53:22] [INFO ] [Real]Absence check using state equation in 8989 ms returned unknown
[2022-06-12 21:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:53:38] [INFO ] [Real]Absence check using state equation in 15626 ms returned sat
[2022-06-12 21:53:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:54:02] [INFO ] [Nat]Absence check using state equation in 23020 ms returned sat
[2022-06-12 21:54:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 552 ms returned sat
[2022-06-12 21:54:03] [INFO ] Deduced a trap composed of 2 places in 973 ms of which 2 ms to minimize.
[2022-06-12 21:54:04] [INFO ] Deduced a trap composed of 14 places in 961 ms of which 2 ms to minimize.
[2022-06-12 21:54:05] [INFO ] Deduced a trap composed of 15 places in 938 ms of which 2 ms to minimize.
[2022-06-12 21:54:06] [INFO ] Deduced a trap composed of 28 places in 961 ms of which 2 ms to minimize.
[2022-06-12 21:54:07] [INFO ] Deduced a trap composed of 7 places in 935 ms of which 2 ms to minimize.
[2022-06-12 21:54:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5438 ms
[2022-06-12 21:54:08] [INFO ] Computed and/alt/rep : 2334/10762/2334 causal constraints (skipped 210 transitions) in 135 ms.
[2022-06-12 21:54:14] [INFO ] Added : 5 causal constraints over 1 iterations in 6795 ms. Result :unknown
[2022-06-12 21:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:54:59] [INFO ] [Real]Absence check using state equation in 44796 ms returned unknown
[2022-06-12 21:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:55:02] [INFO ] [Real]Absence check using state equation in 1968 ms returned sat
[2022-06-12 21:55:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:55:03] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2022-06-12 21:55:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:55:09] [INFO ] [Nat]Added 4 Read/Feed constraints in 6023 ms returned unknown
[2022-06-12 21:55:09] [INFO ] Flatten gal took : 133 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin22798015327495065
[2022-06-12 21:55:10] [INFO ] Too many transitions (2687) to apply POR reductions. Disabling POR matrices.
[2022-06-12 21:55:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin22798015327495065
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/ltsmin22798015327495065]
[2022-06-12 21:55:10] [INFO ] Applying decomposition
[2022-06-12 21:55:10] [INFO ] Flatten gal took : 220 ms
[2022-06-12 21:55:10] [INFO ] Flatten gal took : 137 ms
[2022-06-12 21:55:10] [INFO ] Input system was already deterministic with 2687 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/graph15457371142165943791.txt, -o, /tmp/graph15457371142165943791.bin, -w, /tmp/graph15457371142165943791.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/graph15457371142165943791.bin, -l, -1, -v, -w, /tmp/graph15457371142165943791.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:55:10] [INFO ] Decomposing Gal with order
[2022-06-12 21:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:55:11] [INFO ] Removed a total of 2064 redundant transitions.
[2022-06-12 21:55:11] [INFO ] Flatten gal took : 231 ms
[2022-06-12 21:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 470 labels/synchronizations in 95 ms.
[2022-06-12 21:55:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality730014897326167823.gal : 46 ms
[2022-06-12 21:55:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2358470718977235905.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/ReachabilityCardinality730014897326167823.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2358470718977235905.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/ReachabilityCardinality730014897326167823.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2358470718977235905.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2358470718977235905.prop.
[2022-06-12 21:55:12] [INFO ] Ran tautology test, simplified 0 / 15 in 2282 ms.
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=0 took 133 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=0 took 3 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=0 took 17 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:55:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=0 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=1 took 6 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=1 took 4 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=1 took 3 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=1 took 30 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=1 took 4 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=1 took 3 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=1 took 6 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=1 took 3 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=1 took 3 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=1 took 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2687 rows 2835 cols
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=2 took 462 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=2 took 5 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=2 took 29 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=2 took 3 ms
[2022-06-12 21:55:13] [INFO ] Invariants computation overflowed in 63 ms
Total of 0 invariants.
[2022-06-12 21:55:13] [INFO ] Computed 0 place invariants in 63 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=2 took 22 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=2 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=2 took 3 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=2 took 3 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=2 took 2 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=2 took 76 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=2 took 12 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=2 took 4 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=2 took 4 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=2 took 13 ms
[2022-06-12 21:55:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=2 took 2 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=3 took 755 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=3 took 6 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=3 took 6 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=3 took 8 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=3 took 2 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=3 took 5 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=3 took 4 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=3 took 17 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=3 took 4 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=3 took 4 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=3 took 2 ms
[2022-06-12 21:55:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=3 took 2 ms
[2022-06-12 21:55:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=4 took 1967 ms
[2022-06-12 21:55:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=4 took 947 ms
[2022-06-12 21:55:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=4 took 851 ms
[2022-06-12 21:55:19] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=4 took 700 ms
[2022-06-12 21:55:20] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=4 took 977 ms
[2022-06-12 21:55:21] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=4 took 770 ms
[2022-06-12 21:55:21] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=4 took 685 ms
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :11 after 14
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :15 after 32
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :32 after 48
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :48 after 90
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :90 after 377
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :377 after 1214
[2022-06-12 21:55:22] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=4 took 736 ms
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1214 after 28452
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :28452 after 278632
[2022-06-12 21:55:23] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=4 took 759 ms
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :278632 after 840267
[2022-06-12 21:55:23] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=4 took 709 ms
[2022-06-12 21:55:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=4 took 849 ms
[2022-06-12 21:55:25] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=4 took 843 ms
[2022-06-12 21:55:26] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=4 took 750 ms
[2022-06-12 21:55:27] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=4 took 733 ms
[2022-06-12 21:55:27] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=4 took 863 ms
[2022-06-12 21:55:28] [INFO ] Proved 2835 variables to be positive in 14494 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-00
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(SAT) depth K=0 took 141 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-01
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(SAT) depth K=0 took 25 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-02
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(SAT) depth K=0 took 16 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-03
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(SAT) depth K=0 took 13 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-04
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(SAT) depth K=0 took 10 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-05
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(SAT) depth K=0 took 9 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-06
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(SAT) depth K=0 took 11 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-08
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(SAT) depth K=0 took 12 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-09
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(SAT) depth K=0 took 12 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-10
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(SAT) depth K=0 took 9 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-11
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(SAT) depth K=0 took 18 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-12
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(SAT) depth K=0 took 12 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-13
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(SAT) depth K=0 took 13 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-14
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(SAT) depth K=0 took 11 ms
[2022-06-12 21:55:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-15
[2022-06-12 21:55:28] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(SAT) depth K=0 took 9 ms
[2022-06-12 21:55:31] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=5 took 3709 ms
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/ltsmin22798015327495065] killed by timeout after 24 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/ltsmin22798015327495065] killed by timeout after 24 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :840267 after 2.6574e+07
[2022-06-12 21:56:02] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=5 took 30855 ms
[2022-06-12 21:56:06] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=5 took 3893 ms
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :2.6574e+07 after 1.9175e+08
[2022-06-12 21:56:30] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=5 took 23599 ms
[2022-06-12 21:56:35] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=5 took 5045 ms
[2022-06-12 21:56:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-00
[2022-06-12 21:56:37] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(SAT) depth K=1 took 68491 ms
[2022-06-12 21:56:51] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=5 took 15929 ms
[2022-06-12 21:57:03] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=5 took 12335 ms
[2022-06-12 21:57:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-01
[2022-06-12 21:57:18] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(SAT) depth K=1 took 41163 ms
[2022-06-12 21:57:18] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-02
[2022-06-12 21:57:18] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-02
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2022-06-12 21:57:18] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(FALSE) depth K=1 took 655 ms
[2022-06-12 21:57:47] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=5 took 43938 ms
[2022-06-12 21:57:50] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=5 took 3440 ms
[2022-06-12 21:57:54] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=5 took 3302 ms
[2022-06-12 21:57:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-03
[2022-06-12 21:57:58] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(SAT) depth K=1 took 40064 ms
[2022-06-12 21:58:19] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=5 took 25725 ms
[2022-06-12 21:58:27] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=5 took 7425 ms
[2022-06-12 21:58:31] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=5 took 4188 ms
[2022-06-12 21:58:40] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=5 took 8950 ms
[2022-06-12 21:58:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-04
[2022-06-12 21:58:42] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(SAT) depth K=1 took 44055 ms
[2022-06-12 21:58:45] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-05
[2022-06-12 21:58:45] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-05
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-05 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2022-06-12 21:58:45] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(FALSE) depth K=1 took 2857 ms
[2022-06-12 21:58:58] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(UNSAT) depth K=5 took 18638 ms
[2022-06-12 21:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-06
[2022-06-12 21:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(SAT) depth K=1 took 24539 ms
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :1.9175e+08 after 6.74207e+08
[2022-06-12 21:59:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-08
[2022-06-12 21:59:55] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(SAT) depth K=1 took 44938 ms
[2022-06-12 22:00:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-09
[2022-06-12 22:00:31] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(SAT) depth K=1 took 36342 ms
[2022-06-12 22:00:32] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-10
[2022-06-12 22:00:32] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-10
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-10 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2022-06-12 22:00:32] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(FALSE) depth K=1 took 1154 ms
[2022-06-12 22:02:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-11
[2022-06-12 22:02:09] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(SAT) depth K=1 took 97008 ms
[2022-06-12 22:02:12] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-12
[2022-06-12 22:02:12] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-12
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-12 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2022-06-12 22:02:12] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(FALSE) depth K=1 took 2682 ms
[2022-06-12 22:02:18] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate DoubleExponent-PT-100-ReachabilityCardinality-13
[2022-06-12 22:02:18] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for DoubleExponent-PT-100-ReachabilityCardinality-13
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2022-06-12 22:02:18] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(FALSE) depth K=1 took 5544 ms
[2022-06-12 22:03:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-14
[2022-06-12 22:03:09] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(SAT) depth K=1 took 51621 ms
[2022-06-12 22:04:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-15
[2022-06-12 22:04:07] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-15(SAT) depth K=1 took 57939 ms
[2022-06-12 22:08:21] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-00(UNSAT) depth K=6 took 562851 ms
SDD proceeding with computation,15 properties remain. new max is 131072
SDD size :6.74207e+08 after 1.8619e+09
[2022-06-12 22:11:20] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=6 took 178742 ms

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="gold2021"
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 gold2021"
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 r089-tall-165260117600080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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