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-165260117600077.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-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117600077
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655068518920

Running Version 0
[2022-06-12 21:15:20] [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:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:15:20] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-06-12 21:15:20] [INFO ] Transformed 1064 places.
[2022-06-12 21:15:20] [INFO ] Transformed 998 transitions.
[2022-06-12 21:15:20] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 329 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 29 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Probabilistic random walk after 1000000 steps, saw 500073 distinct states, run finished after 11582 ms. (steps per millisecond=86 ) properties seen :{2=1, 4=1}
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
// Phase 1: matrix 998 rows 1064 cols
[2022-06-12 21:15:32] [INFO ] Invariants computation overflowed in 124 ms
[2022-06-12 21:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:37] [INFO ] [Real]Absence check using state equation in 4826 ms returned unknown
[2022-06-12 21:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:39] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2022-06-12 21:15:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:40] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 178 places in 296 ms of which 16 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 210 places in 187 ms of which 2 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 181 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 199 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 193 places in 415 ms of which 1 ms to minimize.
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 149 places in 200 ms of which 1 ms to minimize.
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 151 places in 205 ms of which 0 ms to minimize.
[2022-06-12 21:15:42] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 185 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 0 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 139 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:15:43] [INFO ] Deduced a trap composed of 163 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 185 places in 281 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [INFO ] Deduced a trap composed of 174 places in 272 ms of which 1 ms to minimize.
[2022-06-12 21:15:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 21:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:46] [INFO ] [Real]Absence check using state equation in 2090 ms returned sat
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 383 places in 284 ms of which 1 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 1 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 1 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 1 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 1 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 53 places in 254 ms of which 5 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 2 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 0 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 21:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:52] [INFO ] [Real]Absence check using state equation in 2585 ms returned sat
[2022-06-12 21:15:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:54] [INFO ] [Nat]Absence check using state equation in 1822 ms returned sat
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 89 places in 284 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 414 places in 286 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 417 places in 284 ms of which 1 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 438 places in 287 ms of which 1 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 101 places in 278 ms of which 1 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 463 places in 270 ms of which 1 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 466 places in 295 ms of which 1 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 475 places in 282 ms of which 1 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 2 ms to minimize.
[2022-06-12 21:15:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 21:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:01] [INFO ] [Real]Absence check using state equation in 3190 ms returned unsat
[2022-06-12 21:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:01] [INFO ] [Real]Absence check using state equation in 405 ms returned unsat
[2022-06-12 21:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:03] [INFO ] [Real]Absence check using state equation in 1331 ms returned unsat
[2022-06-12 21:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:07] [INFO ] [Real]Absence check using state equation in 4359 ms returned sat
[2022-06-12 21:16:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:12] [INFO ] [Nat]Absence check using state equation in 4619 ms returned unsat
[2022-06-12 21:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:13] [INFO ] [Real]Absence check using state equation in 604 ms returned unsat
[2022-06-12 21:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:15] [INFO ] [Real]Absence check using state equation in 1936 ms returned sat
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 390 places in 317 ms of which 5 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 361 places in 308 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 397 places in 309 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 386 places in 313 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 382 places in 312 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 395 places in 308 ms of which 2 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 440 places in 312 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 431 places in 307 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2022-06-12 21:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:19] [INFO ] [Real]Absence check using state equation in 918 ms returned unsat
[2022-06-12 21:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:23] [INFO ] [Real]Absence check using state equation in 4006 ms returned sat
[2022-06-12 21:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:28] [INFO ] [Nat]Absence check using state equation in 4919 ms returned unknown
[2022-06-12 21:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:29] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 239 places in 133 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 211 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 280 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 293 places in 133 ms of which 1 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 298 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 298 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1523 ms
[2022-06-12 21:16:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:31] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 239 places in 141 ms of which 0 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 213 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 185 places in 155 ms of which 0 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 193 places in 157 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 452 places in 286 ms of which 6 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 440 places in 279 ms of which 1 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 421 places in 309 ms of which 1 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 115 places in 269 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 389 places in 283 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 187 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 404 places in 288 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 402 places in 274 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 193 places in 282 ms of which 3 ms to minimize.
[2022-06-12 21:16:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2022-06-12 21:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:37] [INFO ] [Real]Absence check using state equation in 1537 ms returned sat
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 2 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 103 places in 254 ms of which 1 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 659 ms
[2022-06-12 21:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:38] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 1 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 0 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2022-06-12 21:16:39] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 63 ms.
[2022-06-12 21:16:43] [INFO ] Added : 30 causal constraints over 6 iterations in 3456 ms. Result :unknown
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 38300 steps, including 1343 resets, run finished after 86 ms. (steps per millisecond=445 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 57 out of 1064 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1059 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 1058 transition count 807
Reduce places removed 190 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 209 rules applied. Total rules applied 402 place count 868 transition count 788
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 421 place count 849 transition count 788
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 421 place count 849 transition count 752
Deduced a syphon composed of 36 places in 28 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 493 place count 813 transition count 752
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 4 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 799 place count 660 transition count 599
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 10 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 851 place count 634 transition count 599
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 854 place count 634 transition count 596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 857 place count 631 transition count 596
Free-agglomeration rule (complex) applied 88 times.
Iterating global reduction 4 with 88 rules applied. Total rules applied 945 place count 631 transition count 508
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 4 with 88 rules applied. Total rules applied 1033 place count 543 transition count 508
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 1114 place count 543 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1115 place count 542 transition count 507
Applied a total of 1115 rules in 386 ms. Remains 542 /1064 variables (removed 522) and now considering 507/998 (removed 491) transitions.
Finished structural reductions, in 1 iterations. Remains : 542/1064 places, 507/998 transitions.
[2022-06-12 21:16:43] [INFO ] Flatten gal took : 120 ms
[2022-06-12 21:16:43] [INFO ] Flatten gal took : 71 ms
[2022-06-12 21:16:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6907064665865891915.gal : 28 ms
[2022-06-12 21:16:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2250182871306590445.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/ReachabilityCardinality6907064665865891915.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2250182871306590445.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/ReachabilityCardinality6907064665865891915.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2250182871306590445.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2250182871306590445.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 31
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :31 after 57
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :57 after 85
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :85 after 200
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :200 after 415
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :415 after 873
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :873 after 2016
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2016 after 21314
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :21314 after 80980
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :80980 after 218817
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :218817 after 498159
Invariant property DoubleExponent-PT-020-ReachabilityCardinality-11 does not hold.
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :498159 after 1.08384e+06
Detected timeout of ITS tools.
[2022-06-12 21:16:59] [INFO ] Flatten gal took : 54 ms
[2022-06-12 21:16:59] [INFO ] Applying decomposition
[2022-06-12 21:16:59] [INFO ] Flatten gal took : 49 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/graph9735955411013194545.txt, -o, /tmp/graph9735955411013194545.bin, -w, /tmp/graph9735955411013194545.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/graph9735955411013194545.bin, -l, -1, -v, -w, /tmp/graph9735955411013194545.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:16:59] [INFO ] Decomposing Gal with order
[2022-06-12 21:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:16:59] [INFO ] Removed a total of 645 redundant transitions.
[2022-06-12 21:16:59] [INFO ] Flatten gal took : 134 ms
[2022-06-12 21:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 63 ms.
[2022-06-12 21:16:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15685263169586401648.gal : 16 ms
[2022-06-12 21:16:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15865876794372689733.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/ReachabilityCardinality15685263169586401648.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15865876794372689733.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/ReachabilityCardinality15685263169586401648.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15865876794372689733.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15865876794372689733.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :15 after 21
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :21 after 42
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :42 after 55
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :55 after 134
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :134 after 362
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :362 after 834
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :834 after 1631
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1631 after 35504
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :35504 after 88682
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :88682 after 183116
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :183116 after 369978
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :369978 after 764533
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17655775566459016755
[2022-06-12 21:17:14] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17655775566459016755
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/ltsmin17655775566459016755]
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/ltsmin17655775566459016755] 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/ltsmin17655775566459016755] 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 100319 resets, run finished after 1504 ms. (steps per millisecond=664 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71236 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71193 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71446 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71463 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71294 resets, run finished after 1172 ms. (steps per millisecond=853 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71438 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71519 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 3815111 steps, run timeout after 30001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 3815111 steps, saw 1907599 distinct states, run finished after 30002 ms. (steps per millisecond=127 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 507 rows 542 cols
[2022-06-12 21:17:54] [INFO ] Computed 100 place invariants in 218 ms
[2022-06-12 21:17:54] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:17:54] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2022-06-12 21:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:55] [INFO ] [Real]Absence check using state equation in 341 ms returned unsat
[2022-06-12 21:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-12 21:17:55] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-06-12 21:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:55] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2022-06-12 21:17:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:17:55] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-06-12 21:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:56] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2022-06-12 21:17:56] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:17:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 43 ms returned sat
[2022-06-12 21:17:56] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:17:56] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:17:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2022-06-12 21:17:57] [INFO ] Computed and/alt/rep : 441/2053/441 causal constraints (skipped 65 transitions) in 51 ms.
[2022-06-12 21:18:04] [INFO ] Added : 421 causal constraints over 85 iterations in 7995 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-12 21:18:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:18:05] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-06-12 21:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:05] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-06-12 21:18:05] [INFO ] [Real]Added 66 Read/Feed constraints in 107 ms returned sat
[2022-06-12 21:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:18:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 22 ms returned sat
[2022-06-12 21:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:05] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-06-12 21:18:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 119 ms returned sat
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-06-12 21:18:06] [INFO ] Computed and/alt/rep : 441/2053/441 causal constraints (skipped 65 transitions) in 35 ms.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1570 ms
[2022-06-12 21:18:19] [INFO ] Added : 428 causal constraints over 86 iterations in 12888 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-12 21:18:19] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:19] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-06-12 21:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:20] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2022-06-12 21:18:20] [INFO ] [Nat]Added 66 Read/Feed constraints in 40 ms returned sat
[2022-06-12 21:18:20] [INFO ] Computed and/alt/rep : 441/2053/441 causal constraints (skipped 65 transitions) in 33 ms.
[2022-06-12 21:18:32] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:18:33] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:18:34] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:18:35] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Deduced a trap composed of 92 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:18:36] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4306 ms
[2022-06-12 21:18:37] [INFO ] Added : 412 causal constraints over 83 iterations in 16800 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-12 21:18:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:18:37] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2022-06-12 21:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:37] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2022-06-12 21:18:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-12 21:18:37] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2022-06-12 21:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:38] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2022-06-12 21:18:38] [INFO ] [Nat]Added 66 Read/Feed constraints in 31 ms returned sat
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1250 ms
[2022-06-12 21:18:39] [INFO ] Computed and/alt/rep : 441/2053/441 causal constraints (skipped 65 transitions) in 34 ms.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 594 ms
[2022-06-12 21:18:52] [INFO ] Added : 414 causal constraints over 83 iterations in 12942 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-12 21:18:52] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:53] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Real]Added 66 Read/Feed constraints in 21 ms returned sat
[2022-06-12 21:18:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:53] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Nat]Added 66 Read/Feed constraints in 31 ms returned sat
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 771 ms
[2022-06-12 21:18:54] [INFO ] Computed and/alt/rep : 441/2053/441 causal constraints (skipped 65 transitions) in 34 ms.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-06-12 21:19:09] [INFO ] Added : 440 causal constraints over 88 iterations in 15171 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2022-06-12 21:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:10] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2022-06-12 21:19:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:10] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 48 ms returned sat
[2022-06-12 21:19:10] [INFO ] Computed and/alt/rep : 441/2053/441 causal constraints (skipped 65 transitions) in 39 ms.
[2022-06-12 21:19:19] [INFO ] Added : 313 causal constraints over 63 iterations in 8290 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Interrupted Parikh walk after 22726077 steps, including 2841726 resets, run timeout after 30001 ms. (steps per millisecond=757 ) properties (out of 6) seen :0
Interrupted Parikh walk after 23661331 steps, including 2957469 resets, run timeout after 30001 ms. (steps per millisecond=788 ) properties (out of 6) seen :0
Interrupted Parikh walk after 23890260 steps, including 2987002 resets, run timeout after 30001 ms. (steps per millisecond=796 ) properties (out of 6) seen :0
Incomplete Parikh walk after 901200 steps, including 109206 resets, run finished after 1068 ms. (steps per millisecond=843 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 55 out of 542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 542/542 places, 507/507 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 541 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 540 transition count 506
Applied a total of 4 rules in 56 ms. Remains 540 /542 variables (removed 2) and now considering 506/507 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/542 places, 506/507 transitions.
[2022-06-12 21:20:50] [INFO ] Flatten gal took : 40 ms
[2022-06-12 21:20:50] [INFO ] Flatten gal took : 37 ms
[2022-06-12 21:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17768666135460981663.gal : 6 ms
[2022-06-12 21:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality496148235544590038.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/ReachabilityCardinality17768666135460981663.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality496148235544590038.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/ReachabilityCardinality17768666135460981663.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality496148235544590038.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality496148235544590038.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :17 after 31
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :31 after 57
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :57 after 85
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :85 after 200
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :200 after 415
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :415 after 873
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :873 after 2016
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2016 after 21314
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :21314 after 80980
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :80980 after 218817
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :218817 after 498159
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :498159 after 1.08848e+06
Detected timeout of ITS tools.
[2022-06-12 21:21:05] [INFO ] Flatten gal took : 119 ms
[2022-06-12 21:21:05] [INFO ] Applying decomposition
[2022-06-12 21:21:05] [INFO ] Flatten gal took : 49 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/graph3682001483643030031.txt, -o, /tmp/graph3682001483643030031.bin, -w, /tmp/graph3682001483643030031.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/graph3682001483643030031.bin, -l, -1, -v, -w, /tmp/graph3682001483643030031.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:21:05] [INFO ] Decomposing Gal with order
[2022-06-12 21:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:21:06] [INFO ] Removed a total of 1559 redundant transitions.
[2022-06-12 21:21:06] [INFO ] Flatten gal took : 156 ms
[2022-06-12 21:21:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 160 ms.
[2022-06-12 21:21:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9062118654039394873.gal : 26 ms
[2022-06-12 21:21:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6353342052577045829.prop : 15 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/ReachabilityCardinality9062118654039394873.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6353342052577045829.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/ReachabilityCardinality9062118654039394873.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6353342052577045829.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6353342052577045829.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :17 after 31
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :31 after 57
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :57 after 85
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :85 after 200
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :200 after 415
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :415 after 873
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :873 after 2016
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2016 after 21314
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :21314 after 80980
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :80980 after 218817
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :218817 after 498159
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :498159 after 1.08848e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14500764702430677596
[2022-06-12 21:21:21] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14500764702430677596
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/ltsmin14500764702430677596]
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/ltsmin14500764702430677596] 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/ltsmin14500764702430677596] 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 100203 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71239 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71556 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 71558 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71305 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 71856 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71471 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 6) seen :0
Probably explored full state space saw : 252894 states, properties seen :{}
Probabilistic random walk after 505793 steps, saw 252894 distinct states, run finished after 3771 ms. (steps per millisecond=134 ) properties seen :{}
Interrupted probabilistic random walk after 3552025 steps, run timeout after 30001 ms. (steps per millisecond=118 ) properties seen :{}
Exhaustive walk after 3552025 steps, saw 1776272 distinct states, run finished after 30001 ms. (steps per millisecond=118 ) properties seen :{}
Running SMT prover for 6 properties.
// Phase 1: matrix 506 rows 540 cols
[2022-06-12 21:22:03] [INFO ] Invariants computation overflowed in 101 ms
[2022-06-12 21:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:03] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2022-06-12 21:22:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:04] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2022-06-12 21:22:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:22:04] [INFO ] [Nat]Added 66 Read/Feed constraints in 38 ms returned sat
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-06-12 21:22:04] [INFO ] Computed and/alt/rep : 438/2052/438 causal constraints (skipped 67 transitions) in 28 ms.
[2022-06-12 21:22:20] [INFO ] Added : 390 causal constraints over 78 iterations in 15789 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-12 21:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:21] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-06-12 21:22:21] [INFO ] [Real]Added 66 Read/Feed constraints in 119 ms returned sat
[2022-06-12 21:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:21] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2022-06-12 21:22:21] [INFO ] [Nat]Added 66 Read/Feed constraints in 100 ms returned sat
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 10 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 485 ms
[2022-06-12 21:22:22] [INFO ] Computed and/alt/rep : 438/2052/438 causal constraints (skipped 67 transitions) in 33 ms.
[2022-06-12 21:22:34] [INFO ] Added : 385 causal constraints over 77 iterations in 12344 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-12 21:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:35] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2022-06-12 21:22:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:35] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Nat]Added 66 Read/Feed constraints in 56 ms returned sat
[2022-06-12 21:22:35] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:22:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 785 ms
[2022-06-12 21:22:36] [INFO ] Computed and/alt/rep : 438/2052/438 causal constraints (skipped 67 transitions) in 48 ms.
[2022-06-12 21:22:47] [INFO ] Added : 436 causal constraints over 88 iterations in 11005 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-12 21:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:48] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2022-06-12 21:22:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:49] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2022-06-12 21:22:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 29 ms returned sat
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:22:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 954 ms
[2022-06-12 21:22:50] [INFO ] Computed and/alt/rep : 438/2052/438 causal constraints (skipped 67 transitions) in 31 ms.
[2022-06-12 21:23:00] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:23:00] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:23:00] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:23:01] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:23:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 700 ms
[2022-06-12 21:23:01] [INFO ] Added : 401 causal constraints over 81 iterations in 11215 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-12 21:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:01] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-06-12 21:23:01] [INFO ] [Real]Added 66 Read/Feed constraints in 21 ms returned sat
[2022-06-12 21:23:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:02] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-06-12 21:23:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:23:02] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 105 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 118 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 117 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:23:03] [INFO ] Deduced a trap composed of 150 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:23:04] [INFO ] Deduced a trap composed of 123 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:23:04] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:23:04] [INFO ] Deduced a trap composed of 127 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:23:04] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:23:04] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2342 ms
[2022-06-12 21:23:04] [INFO ] Computed and/alt/rep : 438/2052/438 causal constraints (skipped 67 transitions) in 31 ms.
[2022-06-12 21:23:16] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2088 ms
[2022-06-12 21:23:18] [INFO ] Added : 406 causal constraints over 82 iterations in 14546 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-12 21:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:19] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-06-12 21:23:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:19] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2022-06-12 21:23:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 36 ms returned sat
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 114 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 106 places in 78 ms of which 13 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 593 ms
[2022-06-12 21:23:20] [INFO ] Computed and/alt/rep : 438/2052/438 causal constraints (skipped 67 transitions) in 47 ms.
[2022-06-12 21:23:33] [INFO ] Added : 370 causal constraints over 74 iterations in 13142 ms. Result :unknown
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Interrupted Parikh walk after 23950124 steps, including 2902999 resets, run timeout after 30001 ms. (steps per millisecond=798 ) properties (out of 6) seen :0
Interrupted Parikh walk after 23922105 steps, including 2989591 resets, run timeout after 30001 ms. (steps per millisecond=797 ) properties (out of 6) seen :0
Interrupted Parikh walk after 24138696 steps, including 2926285 resets, run timeout after 30001 ms. (steps per millisecond=804 ) properties (out of 6) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 55 out of 540 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 540/540 places, 506/506 transitions.
Applied a total of 0 rules in 23 ms. Remains 540 /540 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 506/506 transitions.
Starting structural reductions, iteration 0 : 540/540 places, 506/506 transitions.
Applied a total of 0 rules in 22 ms. Remains 540 /540 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 540 cols
[2022-06-12 21:25:03] [INFO ] Invariants computation overflowed in 53 ms
[2022-06-12 21:25:04] [INFO ] Implicit Places using invariants in 565 ms returned []
// Phase 1: matrix 506 rows 540 cols
[2022-06-12 21:25:04] [INFO ] Invariants computation overflowed in 47 ms
[2022-06-12 21:25:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:25:11] [INFO ] Implicit Places using invariants and state equation in 7665 ms returned [16, 21, 51, 78, 106, 134, 170, 196, 201, 224, 255, 260, 318, 324, 353, 358, 386, 394, 416, 424, 446, 448, 476, 504, 509]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 8248 ms to find 25 implicit places.
[2022-06-12 21:25:11] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 506 rows 515 cols
[2022-06-12 21:25:12] [INFO ] Invariants computation overflowed in 27 ms
[2022-06-12 21:25:12] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Starting structural reductions, iteration 1 : 515/540 places, 506/506 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 514 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 514 transition count 505
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 514 transition count 501
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 510 transition count 501
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 21 place count 510 transition count 501
Applied a total of 21 rules in 87 ms. Remains 510 /515 variables (removed 5) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 510 cols
[2022-06-12 21:25:12] [INFO ] Invariants computation overflowed in 41 ms
[2022-06-12 21:25:12] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 501 rows 510 cols
[2022-06-12 21:25:12] [INFO ] Invariants computation overflowed in 25 ms
[2022-06-12 21:25:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:25:19] [INFO ] Implicit Places using invariants and state equation in 6650 ms returned [53, 106, 133, 163, 218, 227, 278, 427, 455]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 7224 ms to find 9 implicit places.
Starting structural reductions, iteration 2 : 501/540 places, 501/506 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 501 transition count 494
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 494 transition count 494
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 494 transition count 494
Applied a total of 16 rules in 52 ms. Remains 494 /501 variables (removed 7) and now considering 494/501 (removed 7) transitions.
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:25:19] [INFO ] Invariants computation overflowed in 43 ms
[2022-06-12 21:25:19] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:25:20] [INFO ] Invariants computation overflowed in 45 ms
[2022-06-12 21:25:20] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:25:22] [INFO ] Implicit Places using invariants and state equation in 2550 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 494/540 places, 494/506 transitions.
[2022-06-12 21:25:22] [INFO ] Flatten gal took : 27 ms
[2022-06-12 21:25:22] [INFO ] Flatten gal took : 26 ms
[2022-06-12 21:25:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1988632445231230348.gal : 4 ms
[2022-06-12 21:25:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2585344013510756313.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/ReachabilityCardinality1988632445231230348.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2585344013510756313.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/ReachabilityCardinality1988632445231230348.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2585344013510756313.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2585344013510756313.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 43
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 63
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :63 after 249
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :249 after 509
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :509 after 963
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :963 after 6443
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6443 after 30855
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :30855 after 81000
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :81000 after 187846
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :187846 after 403050
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :403050 after 826914
Detected timeout of ITS tools.
[2022-06-12 21:25:37] [INFO ] Flatten gal took : 26 ms
[2022-06-12 21:25:37] [INFO ] Applying decomposition
[2022-06-12 21:25:37] [INFO ] Flatten gal took : 26 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/graph4320441229236459376.txt, -o, /tmp/graph4320441229236459376.bin, -w, /tmp/graph4320441229236459376.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/graph4320441229236459376.bin, -l, -1, -v, -w, /tmp/graph4320441229236459376.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:25:37] [INFO ] Decomposing Gal with order
[2022-06-12 21:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:25:37] [INFO ] Removed a total of 247 redundant transitions.
[2022-06-12 21:25:37] [INFO ] Flatten gal took : 53 ms
[2022-06-12 21:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 18 ms.
[2022-06-12 21:25:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14351788501368880981.gal : 8 ms
[2022-06-12 21:25:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13536677864702371209.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/ReachabilityCardinality14351788501368880981.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13536677864702371209.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/ReachabilityCardinality14351788501368880981.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13536677864702371209.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13536677864702371209.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 26
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :26 after 43
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 56
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :56 after 249
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :249 after 509
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :509 after 1066
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1066 after 13799
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :13799 after 44908
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :44908 after 133944
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :133944 after 350367
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :350367 after 759217
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4551929438171441857
[2022-06-12 21:25:53] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4551929438171441857
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/ltsmin4551929438171441857]
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/ltsmin4551929438171441857] 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/ltsmin4551929438171441857] 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 109704 resets, run finished after 1280 ms. (steps per millisecond=781 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 76366 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76045 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 76211 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 76207 resets, run finished after 1049 ms. (steps per millisecond=953 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76283 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76129 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 4081802 steps, run timeout after 30001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 4081802 steps, saw 2040763 distinct states, run finished after 30003 ms. (steps per millisecond=136 ) properties seen :{}
Running SMT prover for 6 properties.
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:26:30] [INFO ] Invariants computation overflowed in 55 ms
[2022-06-12 21:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:31] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2022-06-12 21:26:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:31] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2022-06-12 21:26:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:26:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 51 ms returned sat
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 525 ms
[2022-06-12 21:26:32] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 25 ms.
[2022-06-12 21:26:43] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:26:43] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:26:44] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:26:44] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:26:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 724 ms
[2022-06-12 21:26:44] [INFO ] Added : 409 causal constraints over 82 iterations in 11822 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-12 21:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:45] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-06-12 21:26:45] [INFO ] [Real]Added 66 Read/Feed constraints in 73 ms returned sat
[2022-06-12 21:26:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:45] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2022-06-12 21:26:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 79 ms returned sat
[2022-06-12 21:26:45] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:26:46] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:26:46] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:26:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 362 ms
[2022-06-12 21:26:46] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 29 ms.
[2022-06-12 21:26:56] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:26:57] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:26:57] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:26:57] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:26:57] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:26:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 876 ms
[2022-06-12 21:26:57] [INFO ] Added : 372 causal constraints over 75 iterations in 11553 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-12 21:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:58] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-06-12 21:26:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:59] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2022-06-12 21:26:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:26:59] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2022-06-12 21:26:59] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:26:59] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:26:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 358 ms
[2022-06-12 21:26:59] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 27 ms.
[2022-06-12 21:27:11] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:27:12] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:27:12] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:27:12] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:27:12] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:27:12] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2022-06-12 21:27:12] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:27:13] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:27:14] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:27:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2347 ms
[2022-06-12 21:27:14] [INFO ] Added : 413 causal constraints over 83 iterations in 14913 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-12 21:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:15] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2022-06-12 21:27:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:16] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2022-06-12 21:27:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 46 ms returned sat
[2022-06-12 21:27:16] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:27:16] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:27:16] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:27:16] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-06-12 21:27:16] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2022-06-12 21:27:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 738 ms
[2022-06-12 21:27:16] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 29 ms.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:27:28] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 4 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:27:29] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:27:30] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:27:30] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:27:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2341 ms
[2022-06-12 21:27:30] [INFO ] Added : 417 causal constraints over 84 iterations in 13588 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-12 21:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:30] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-06-12 21:27:30] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:27:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:31] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2022-06-12 21:27:31] [INFO ] [Nat]Added 66 Read/Feed constraints in 35 ms returned sat
[2022-06-12 21:27:31] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:27:31] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:27:31] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:27:32] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:27:33] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2066 ms
[2022-06-12 21:27:33] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 30 ms.
[2022-06-12 21:27:54] [INFO ] Added : 380 causal constraints over 76 iterations in 21188 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-12 21:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:55] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Real]Added 66 Read/Feed constraints in 58 ms returned sat
[2022-06-12 21:27:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:56] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2022-06-12 21:27:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2022-06-12 21:27:56] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 33 ms.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 758 ms
[2022-06-12 21:28:06] [INFO ] Added : 353 causal constraints over 72 iterations in 10429 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3878500 steps, including 514878 resets, run finished after 4874 ms. (steps per millisecond=795 ) properties (out of 6) seen :0 could not realise parikh vector
Interrupted Parikh walk after 22041687 steps, including 2926878 resets, run timeout after 30001 ms. (steps per millisecond=734 ) properties (out of 6) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 6) seen :0 could not realise parikh vector
Interrupted Parikh walk after 22362100 steps, including 2968989 resets, run timeout after 30001 ms. (steps per millisecond=745 ) properties (out of 6) seen :0
Incomplete Parikh walk after 10991300 steps, including 1459398 resets, run finished after 13563 ms. (steps per millisecond=810 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 55 out of 494 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 494/494 places, 494/494 transitions.
Applied a total of 0 rules in 14 ms. Remains 494 /494 variables (removed 0) and now considering 494/494 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 494/494 places, 494/494 transitions.
Starting structural reductions, iteration 0 : 494/494 places, 494/494 transitions.
Applied a total of 0 rules in 12 ms. Remains 494 /494 variables (removed 0) and now considering 494/494 (removed 0) transitions.
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:29:25] [INFO ] Invariants computation overflowed in 52 ms
[2022-06-12 21:29:25] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:29:25] [INFO ] Invariants computation overflowed in 57 ms
[2022-06-12 21:29:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:29:28] [INFO ] Implicit Places using invariants and state equation in 2430 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
[2022-06-12 21:29:28] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:29:28] [INFO ] Invariants computation overflowed in 52 ms
[2022-06-12 21:29:28] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []
Finished structural reductions, in 1 iterations. Remains : 494/494 places, 494/494 transitions.
Incomplete random walk after 100000 steps, including 11079 resets, run finished after 219 ms. (steps per millisecond=456 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 494 rows 494 cols
[2022-06-12 21:29:28] [INFO ] Invariants computation overflowed in 56 ms
[2022-06-12 21:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:29] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-06-12 21:29:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:29:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:29] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2022-06-12 21:29:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:29:30] [INFO ] [Nat]Added 66 Read/Feed constraints in 53 ms returned sat
[2022-06-12 21:29:30] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:29:30] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:29:30] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:29:30] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:29:30] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:29:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 551 ms
[2022-06-12 21:29:30] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 31 ms.
[2022-06-12 21:29:42] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:29:42] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:29:42] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:29:42] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:29:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 746 ms
[2022-06-12 21:29:42] [INFO ] Added : 409 causal constraints over 82 iterations in 12362 ms. Result :sat
[2022-06-12 21:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:43] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2022-06-12 21:29:43] [INFO ] [Real]Added 66 Read/Feed constraints in 74 ms returned sat
[2022-06-12 21:29:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:44] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2022-06-12 21:29:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 79 ms returned sat
[2022-06-12 21:29:44] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:29:44] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:29:44] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:29:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 363 ms
[2022-06-12 21:29:44] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 24 ms.
[2022-06-12 21:29:55] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:29:55] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:29:55] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:29:55] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:29:55] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:29:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 831 ms
[2022-06-12 21:29:56] [INFO ] Added : 372 causal constraints over 75 iterations in 11327 ms. Result :sat
[2022-06-12 21:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:56] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2022-06-12 21:29:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:57] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2022-06-12 21:29:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:29:57] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:29:57] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:29:57] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:29:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2022-06-12 21:29:57] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 44 ms.
[2022-06-12 21:30:10] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:30:10] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:30:10] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:30:10] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:30:12] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2582 ms
[2022-06-12 21:30:12] [INFO ] Added : 413 causal constraints over 83 iterations in 15358 ms. Result :sat
[2022-06-12 21:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:13] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2022-06-12 21:30:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:14] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2022-06-12 21:30:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 51 ms returned sat
[2022-06-12 21:30:14] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:30:15] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:30:15] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:30:15] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:30:15] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:30:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 647 ms
[2022-06-12 21:30:15] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 34 ms.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:29] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:30:29] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:30:29] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:30:29] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:30:29] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2462 ms
[2022-06-12 21:30:29] [INFO ] Added : 417 causal constraints over 84 iterations in 14341 ms. Result :sat
[2022-06-12 21:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:30] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2022-06-12 21:30:30] [INFO ] [Real]Added 66 Read/Feed constraints in 19 ms returned sat
[2022-06-12 21:30:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:30] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2022-06-12 21:30:30] [INFO ] [Nat]Added 66 Read/Feed constraints in 37 ms returned sat
[2022-06-12 21:30:30] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:30:31] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2052 ms
[2022-06-12 21:30:32] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 31 ms.
[2022-06-12 21:30:50] [INFO ] Added : 360 causal constraints over 72 iterations in 17347 ms. Result :unknown
[2022-06-12 21:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:50] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2022-06-12 21:30:50] [INFO ] [Real]Added 66 Read/Feed constraints in 57 ms returned sat
[2022-06-12 21:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:51] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2022-06-12 21:30:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 32 ms returned sat
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2022-06-12 21:30:51] [INFO ] Computed and/alt/rep : 422/2052/422 causal constraints (skipped 71 transitions) in 26 ms.
[2022-06-12 21:31:01] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:31:01] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:31:02] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2022-06-12 21:31:02] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:31:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 839 ms
[2022-06-12 21:31:02] [INFO ] Added : 353 causal constraints over 72 iterations in 10559 ms. Result :sat
[2022-06-12 21:31:02] [INFO ] Flatten gal took : 38 ms
[2022-06-12 21:31:02] [INFO ] Flatten gal took : 32 ms
[2022-06-12 21:31:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13110453490638186399.gal : 7 ms
[2022-06-12 21:31:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15200349570691346498.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/ReachabilityCardinality13110453490638186399.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15200349570691346498.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/ReachabilityCardinality13110453490638186399.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15200349570691346498.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15200349570691346498.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 43
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 63
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :63 after 249
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :249 after 509
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :509 after 963
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :963 after 6443
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6443 after 30855
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :30855 after 81000
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :81000 after 187846
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :187846 after 403050
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :403050 after 826914
Detected timeout of ITS tools.
[2022-06-12 21:31:22] [INFO ] Flatten gal took : 31 ms
[2022-06-12 21:31:22] [INFO ] Applying decomposition
[2022-06-12 21:31:22] [INFO ] Flatten gal took : 27 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/graph13467044393102349737.txt, -o, /tmp/graph13467044393102349737.bin, -w, /tmp/graph13467044393102349737.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/graph13467044393102349737.bin, -l, -1, -v, -w, /tmp/graph13467044393102349737.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:31:22] [INFO ] Decomposing Gal with order
[2022-06-12 21:31:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:31:22] [INFO ] Removed a total of 641 redundant transitions.
[2022-06-12 21:31:22] [INFO ] Flatten gal took : 102 ms
[2022-06-12 21:31:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 37 ms.
[2022-06-12 21:31:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10855864765763208592.gal : 11 ms
[2022-06-12 21:31:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6209878320178903216.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/ReachabilityCardinality10855864765763208592.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6209878320178903216.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/ReachabilityCardinality10855864765763208592.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6209878320178903216.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6209878320178903216.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 43
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 60
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :60 after 232
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :232 after 509
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :509 after 1066
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1066 after 13114
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :13114 after 45216
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :45216 after 160098
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :160098 after 458400
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :458400 after 956842
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :956842 after 1.29934e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6309137709758350355
[2022-06-12 21:31:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6309137709758350355
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/ltsmin6309137709758350355]
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/ltsmin6309137709758350355] killed by timeout after 2 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/ltsmin6309137709758350355] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 494 transition count 487
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 487 transition count 487
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 14 place count 487 transition count 464
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 60 place count 464 transition count 464
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 456 transition count 456
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 456 transition count 456
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 456 transition count 453
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 453 transition count 453
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 453 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 451 transition count 451
Applied a total of 86 rules in 134 ms. Remains 451 /494 variables (removed 43) and now considering 451/494 (removed 43) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 451 rows 451 cols
[2022-06-12 21:31:45] [INFO ] Invariants computation overflowed in 83 ms
[2022-06-12 21:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:46] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2022-06-12 21:31:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:46] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2022-06-12 21:31:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-12 21:31:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2022-06-12 21:31:46] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:31:46] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 2 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 782 ms
[2022-06-12 21:31:47] [INFO ] Computed and/alt/rep : 384/1867/384 causal constraints (skipped 66 transitions) in 28 ms.
[2022-06-12 21:31:57] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:31:57] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:31:57] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:31:57] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:31:57] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:31:58] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:31:58] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:31:58] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:31:58] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:31:58] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:31:58] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:31:59] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:31:59] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:31:59] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:31:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2342 ms
[2022-06-12 21:31:59] [INFO ] Added : 381 causal constraints over 78 iterations in 11894 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-12 21:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:00] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2022-06-12 21:32:00] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:32:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:00] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2022-06-12 21:32:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 67 ms returned sat
[2022-06-12 21:32:00] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:32:00] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:32:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-06-12 21:32:00] [INFO ] Computed and/alt/rep : 384/1867/384 causal constraints (skipped 66 transitions) in 28 ms.
[2022-06-12 21:32:08] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:32:08] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:32:09] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:32:09] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:32:09] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:32:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 629 ms
[2022-06-12 21:32:09] [INFO ] Added : 315 causal constraints over 63 iterations in 8498 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 21:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:10] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2022-06-12 21:32:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:11] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2022-06-12 21:32:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 21:32:11] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:32:11] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:32:11] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:32:11] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:32:11] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:32:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 398 ms
[2022-06-12 21:32:11] [INFO ] Computed and/alt/rep : 384/1867/384 causal constraints (skipped 66 transitions) in 26 ms.
[2022-06-12 21:32:21] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-06-12 21:32:22] [INFO ] Added : 382 causal constraints over 77 iterations in 10606 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-12 21:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:23] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2022-06-12 21:32:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:23] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2022-06-12 21:32:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 21:32:23] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:32:23] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:32:24] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:32:24] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:32:24] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:32:24] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:32:24] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:32:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 591 ms
[2022-06-12 21:32:24] [INFO ] Computed and/alt/rep : 384/1867/384 causal constraints (skipped 66 transitions) in 28 ms.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1123 ms
[2022-06-12 21:32:36] [INFO ] Added : 380 causal constraints over 76 iterations in 12502 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-12 21:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:37] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-12 21:32:37] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 21:32:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:37] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2022-06-12 21:32:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:32:38] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 80 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 102 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:32:39] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1856 ms
[2022-06-12 21:32:39] [INFO ] Computed and/alt/rep : 384/1867/384 causal constraints (skipped 66 transitions) in 27 ms.
[2022-06-12 21:32:54] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:32:54] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:32:54] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:32:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2022-06-12 21:32:54] [INFO ] Added : 383 causal constraints over 78 iterations in 15107 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-12 21:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:55] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-12 21:32:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:56] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2022-06-12 21:32:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 539 ms
[2022-06-12 21:32:56] [INFO ] Computed and/alt/rep : 384/1867/384 causal constraints (skipped 66 transitions) in 29 ms.
[2022-06-12 21:33:04] [INFO ] Added : 275 causal constraints over 55 iterations in 7679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-12 21:33:04] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
[2022-06-12 21:33:04] [INFO ] Flatten gal took : 37 ms
Built C files in :
/tmp/ltsmin7974910544682926716
[2022-06-12 21:33:04] [INFO ] Computing symmetric may disable matrix : 494 transitions.
[2022-06-12 21:33:04] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:33:04] [INFO ] Input system was already deterministic with 494 transitions.
[2022-06-12 21:33:04] [INFO ] Applying decomposition
[2022-06-12 21:33:04] [INFO ] Computing symmetric may enable matrix : 494 transitions.
[2022-06-12 21:33:04] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:33:04] [INFO ] Flatten gal took : 40 ms
[2022-06-12 21:33:04] [INFO ] Computing Do-Not-Accords matrix : 494 transitions.
[2022-06-12 21:33:04] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph3015104652824135269.txt, -o, /tmp/graph3015104652824135269.bin, -w, /tmp/graph3015104652824135269.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/graph3015104652824135269.bin, -l, -1, -v, -w, /tmp/graph3015104652824135269.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:33:04] [INFO ] Decomposing Gal with order
[2022-06-12 21:33:04] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7974910544682926716
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/ltsmin7974910544682926716]
[2022-06-12 21:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:33:04] [INFO ] Removed a total of 268 redundant transitions.
[2022-06-12 21:33:04] [INFO ] Flatten gal took : 61 ms
[2022-06-12 21:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 48 ms.
[2022-06-12 21:33:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11867254565569891188.gal : 6 ms
[2022-06-12 21:33:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11846030349214497052.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/ReachabilityCardinality11867254565569891188.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11846030349214497052.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/ReachabilityCardinality11867254565569891188.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11846030349214497052.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11846030349214497052.prop.
[2022-06-12 21:33:05] [INFO ] Ran tautology test, simplified 0 / 6 in 696 ms.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 28
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=0 took 86 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=0 took 0 ms
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :28 after 43
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 57
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :57 after 232
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=1 took 2 ms
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :232 after 509
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=1 took 14 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=1 took 1 ms
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :509 after 1066
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 494 rows 494 cols
SDD proceeding with computation,6 properties remain. new max is 4096
[2022-06-12 21:33:05] [INFO ] Invariants computation overflowed in 84 ms
Total of 0 invariants.
[2022-06-12 21:33:05] [INFO ] Computed 0 place invariants in 84 ms
SDD size :1066 after 6444
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=2 took 288 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=2 took 12 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=2 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=2 took 2 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=2 took 1 ms
[2022-06-12 21:33:05] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=2 took 2 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6444 after 33803
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=3 took 186 ms
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=3 took 1 ms
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=3 took 7 ms
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=3 took 2 ms
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=4 took 309 ms
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :33803 after 96696
[2022-06-12 21:33:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=4 took 340 ms
[2022-06-12 21:33:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=4 took 417 ms
[2022-06-12 21:33:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=4 took 314 ms
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :96696 after 267078
[2022-06-12 21:33:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=4 took 271 ms
[2022-06-12 21:33:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=4 took 280 ms
[2022-06-12 21:33:08] [INFO ] Proved 494 variables to be positive in 2499 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=0 took 20 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=0 took 2 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=0 took 2 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=0 took 2 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-14
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(SAT) depth K=0 took 2 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=0 took 2 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=1 took 255 ms
[2022-06-12 21:33:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=5 took 551 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=1 took 190 ms
[2022-06-12 21:33:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-12 21:33:08] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=1 took 190 ms
[2022-06-12 21:33:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=5 took 740 ms
[2022-06-12 21:33:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=5 took 193 ms
Compilation finished in 5042 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7974910544682926716]
Link finished in 96 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT020ReachabilityCardinality01==true], workingDir=/tmp/ltsmin7974910544682926716]
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :267078 after 626423
[2022-06-12 21:33:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-12 21:33:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=1 took 1186 ms
[2022-06-12 21:33:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-14
[2022-06-12 21:33:11] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(SAT) depth K=1 took 1588 ms
[2022-06-12 21:33:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2022-06-12 21:33:12] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=1 took 383 ms
[2022-06-12 21:33:14] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=5 took 5445 ms
[2022-06-12 21:33:16] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=5 took 1239 ms
[2022-06-12 21:33:17] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=5 took 1324 ms
[2022-06-12 21:33:21] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=6 took 3467 ms
[2022-06-12 21:33:23] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=6 took 2118 ms
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :626423 after 6.6323e+06
[2022-06-12 21:33:50] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=6 took 27665 ms
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :6.6323e+06 after 3.75153e+07
[2022-06-12 21:34:00] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=6 took 9368 ms
[2022-06-12 21:34:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=6 took 2030 ms
[2022-06-12 21:34:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=6 took 9285 ms
[2022-06-12 21:34:30] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=7 took 19239 ms
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :3.75153e+07 after 1.05267e+08
[2022-06-12 21:37:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=7 took 156112 ms
[2022-06-12 21:37:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-12 21:37:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=2 took 245317 ms
SDD proceeding with computation,6 properties remain. new max is 1048576
SDD size :1.05267e+08 after 2.44874e+08
[2022-06-12 21:37:59] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=7 took 53089 ms
[2022-06-12 21:38:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=7 took 7620 ms
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Initializing POR dependencies: labels 500, guards 494
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.059: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.059: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.091: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.091: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.091: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.091: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.443: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.531: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 3/ 8), 2.587: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 2.583: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 2.583: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 2.584: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 2.588: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 2.595: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 2.595: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 2.596: There are 500 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.597: State length is 494, there are 494 groups
pins2lts-mc-linux64( 0/ 8), 2.597: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.597: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.597: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 2.597: Visible groups: 5 / 494, labels: 1 / 500
pins2lts-mc-linux64( 0/ 8), 2.597: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 2.597: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 2.595: "DoubleExponentPT020ReachabilityCardinality01==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 3.417: ~54 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 1/ 8), 3.660: ~93 levels ~1920 states ~1992 transitions
pins2lts-mc-linux64( 7/ 8), 3.849: ~159 levels ~3840 states ~3896 transitions
pins2lts-mc-linux64( 7/ 8), 3.902: ~194 levels ~7680 states ~8192 transitions
pins2lts-mc-linux64( 7/ 8), 3.970: ~209 levels ~15360 states ~16784 transitions
pins2lts-mc-linux64( 7/ 8), 4.104: ~225 levels ~30720 states ~33336 transitions
pins2lts-mc-linux64( 7/ 8), 4.466: ~245 levels ~61440 states ~65976 transitions
pins2lts-mc-linux64( 7/ 8), 5.258: ~909 levels ~122880 states ~126392 transitions
pins2lts-mc-linux64( 7/ 8), 7.324: ~2926 levels ~245760 states ~247032 transitions
pins2lts-mc-linux64( 7/ 8), 10.661: ~4464 levels ~491520 states ~500280 transitions
pins2lts-mc-linux64( 7/ 8), 17.449: ~9722 levels ~983040 states ~994048 transitions
pins2lts-mc-linux64( 0/ 8), 28.453: ~13682 levels ~1966080 states ~1977536 transitions
pins2lts-mc-linux64( 0/ 8), 49.469: ~14317 levels ~3932160 states ~3986600 transitions
pins2lts-mc-linux64( 0/ 8), 92.112: ~14354 levels ~7864320 states ~8016920 transitions
pins2lts-mc-linux64( 0/ 8), 179.984: ~14394 levels ~15728640 states ~15968752 transitions
pins2lts-mc-linux64( 1/ 8), 324.504: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 324.547:
pins2lts-mc-linux64( 0/ 8), 324.547: mean standard work distribution: 9.8% (states) 9.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 324.547:
pins2lts-mc-linux64( 0/ 8), 324.547: Explored 24550146 states 24714022 transitions, fanout: 1.007
pins2lts-mc-linux64( 0/ 8), 324.547: Total exploration time 321.950 sec (321.910 sec minimum, 321.923 sec on average)
pins2lts-mc-linux64( 0/ 8), 324.547: States per second: 76255, Transitions per second: 76764
pins2lts-mc-linux64( 0/ 8), 324.547: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 324.547:
pins2lts-mc-linux64( 0/ 8), 324.547: Queue width: 8B, total height: 218240, memory: 1.67MB
pins2lts-mc-linux64( 0/ 8), 324.547: Tree memory: 444.6MB, 18.9 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 324.547: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 324.547: Stored 496 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 324.547: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 324.547: Est. total memory use: 446.2MB (~1025.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT020ReachabilityCardinality01==true], workingDir=/tmp/ltsmin7974910544682926716]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT020ReachabilityCardinality01==true], workingDir=/tmp/ltsmin7974910544682926716]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 21:38:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-12 21:38:38] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=2 took 80544 ms
[2022-06-12 21:38:43] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=7 took 36340 ms
[2022-06-12 21:38:46] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=7 took 2933 ms
[2022-06-12 21:39:14] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=8 took 27349 ms
[2022-06-12 21:39:19] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=8 took 4758 ms
[2022-06-12 21:39:39] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=8 took 20673 ms
SDD proceeding with computation,6 properties remain. new max is 2097152
SDD size :2.44874e+08 after 5.31626e+08
[2022-06-12 21:40:41] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=8 took 61563 ms
[2022-06-12 21:40:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-12 21:40:51] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=2 took 133386 ms
[2022-06-12 21:42:22] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=8 took 101100 ms
[2022-06-12 21:42:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-12 21:42:31] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=2 took 100108 ms
[2022-06-12 21:42:49] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=8 took 27295 ms
[2022-06-12 21:43:18] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=9 took 28839 ms
[2022-06-12 21:43:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=9 took 28994 ms
[2022-06-12 21:45:01] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=9 took 73528 ms
[2022-06-12 21:45:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-14
[2022-06-12 21:45:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(SAT) depth K=2 took 159392 ms
[2022-06-12 21:45:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2022-06-12 21:45:15] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=2 took 4811 ms
SDD proceeding with computation,6 properties remain. new max is 4194304
SDD size :5.31626e+08 after 1.68105e+09
[2022-06-12 21:47:40] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=9 took 159776 ms
[2022-06-12 21:49:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2022-06-12 21:49:13] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=3 took 238071 ms
[2022-06-12 21:49:27] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=9 took 107121 ms
[2022-06-12 21:50:23] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=9 took 55852 ms
[2022-06-12 21:50:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=10 took 35024 ms
[2022-06-12 21:51:23] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(UNSAT) depth K=10 took 24751 ms
[2022-06-12 21:51:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-03
[2022-06-12 21:51:54] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-03(SAT) depth K=3 took 161076 ms
SDD proceeding with computation,6 properties remain. new max is 8388608
SDD size :1.68105e+09 after 3.30979e+09
[2022-06-12 21:54:27] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=10 took 184034 ms
[2022-06-12 21:56:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=10 took 98741 ms
[2022-06-12 21:57:34] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-14(UNSAT) depth K=10 took 87817 ms
Detected timeout of ITS tools.
[2022-06-12 21:58:59] [INFO ] Applying decomposition
[2022-06-12 21:58:59] [INFO ] Flatten gal took : 80 ms
[2022-06-12 21:58:59] [INFO ] Decomposing Gal with order
[2022-06-12 21:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:59:00] [INFO ] Removed a total of 641 redundant transitions.
[2022-06-12 21:59:00] [INFO ] Flatten gal took : 235 ms
[2022-06-12 21:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 98 ms.
[2022-06-12 21:59:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8400559804470390927.gal : 47 ms
[2022-06-12 21:59:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1791715351236342332.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/ReachabilityCardinality8400559804470390927.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1791715351236342332.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/ReachabilityCardinality8400559804470390927.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1791715351236342332.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1791715351236342332.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 43
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43 after 60
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :60 after 232
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :232 after 509
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :509 after 1066
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1066 after 13114
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :13114 after 45216
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :45216 after 160098
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :160098 after 458400
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :458400 after 956842
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :956842 after 1.29934e+07
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :1.29934e+07 after 4.40139e+07
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :4.40139e+07 after 1.11291e+08
[2022-06-12 22:01:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2022-06-12 22:01:32] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=3 took 577625 ms
[2022-06-12 22:03:58] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=10 took 384553 ms
SDD proceeding with computation,6 properties remain. new max is 1048576
SDD size :1.11291e+08 after 2.5075e+08
[2022-06-12 22:05:59] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=11 took 120975 ms
[2022-06-12 22:08:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2022-06-12 22:08:16] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=3 took 404240 ms
SDD proceeding with computation,6 properties remain. new max is 2097152
SDD size :2.5075e+08 after 5.36077e+08

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-020"
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-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-tall-165260117600077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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