Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127500255.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127500255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 548K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620953503923

Running Version 0
[2021-05-14 00:51:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 00:51:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 00:51:45] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2021-05-14 00:51:45] [INFO ] Transformed 2003 places.
[2021-05-14 00:51:45] [INFO ] Transformed 2292 transitions.
[2021-05-14 00:51:45] [INFO ] Found NUPN structural information;
[2021-05-14 00:51:45] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :9
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2021-05-14 00:51:46] [INFO ] Computed 66 place invariants in 41 ms
[2021-05-14 00:51:46] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2021-05-14 00:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:51:47] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2021-05-14 00:51:48] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 7 ms to minimize.
[2021-05-14 00:51:48] [INFO ] Deduced a trap composed of 55 places in 409 ms of which 2 ms to minimize.
[2021-05-14 00:51:48] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 1 ms to minimize.
[2021-05-14 00:51:49] [INFO ] Deduced a trap composed of 115 places in 235 ms of which 2 ms to minimize.
[2021-05-14 00:51:49] [INFO ] Deduced a trap composed of 102 places in 244 ms of which 0 ms to minimize.
[2021-05-14 00:51:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2054 ms
[2021-05-14 00:51:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:51:49] [INFO ] [Nat]Absence check using 66 positive place invariants in 61 ms returned sat
[2021-05-14 00:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:51:50] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2021-05-14 00:51:51] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 1 ms to minimize.
[2021-05-14 00:51:51] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 1 ms to minimize.
[2021-05-14 00:51:51] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 1 ms to minimize.
[2021-05-14 00:51:52] [INFO ] Deduced a trap composed of 115 places in 249 ms of which 1 ms to minimize.
[2021-05-14 00:51:52] [INFO ] Deduced a trap composed of 102 places in 254 ms of which 0 ms to minimize.
[2021-05-14 00:51:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1878 ms
[2021-05-14 00:51:52] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 126 ms.
[2021-05-14 00:51:54] [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 0
[2021-05-14 00:51:55] [INFO ] [Real]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 00:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:51:56] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2021-05-14 00:51:56] [INFO ] Deduced a trap composed of 86 places in 252 ms of which 0 ms to minimize.
[2021-05-14 00:51:56] [INFO ] Deduced a trap composed of 103 places in 239 ms of which 1 ms to minimize.
[2021-05-14 00:51:57] [INFO ] Deduced a trap composed of 89 places in 223 ms of which 1 ms to minimize.
[2021-05-14 00:51:57] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 1 ms to minimize.
[2021-05-14 00:51:57] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 0 ms to minimize.
[2021-05-14 00:51:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1471 ms
[2021-05-14 00:51:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:51:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 54 ms returned sat
[2021-05-14 00:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:51:58] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2021-05-14 00:51:59] [INFO ] Deduced a trap composed of 57 places in 390 ms of which 1 ms to minimize.
[2021-05-14 00:51:59] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 1 ms to minimize.
[2021-05-14 00:51:59] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 1 ms to minimize.
[2021-05-14 00:52:00] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 0 ms to minimize.
[2021-05-14 00:52:00] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 1 ms to minimize.
[2021-05-14 00:52:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1517 ms
[2021-05-14 00:52:00] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 119 ms.
[2021-05-14 00:52:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-14 00:52:02] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned sat
[2021-05-14 00:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:03] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2021-05-14 00:52:04] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 1 ms to minimize.
[2021-05-14 00:52:04] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 1 ms to minimize.
[2021-05-14 00:52:05] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 1 ms to minimize.
[2021-05-14 00:52:05] [INFO ] Deduced a trap composed of 70 places in 218 ms of which 1 ms to minimize.
[2021-05-14 00:52:05] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 0 ms to minimize.
[2021-05-14 00:52:05] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 1 ms to minimize.
[2021-05-14 00:52:06] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 0 ms to minimize.
[2021-05-14 00:52:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2186 ms
[2021-05-14 00:52:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:52:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2021-05-14 00:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:07] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2021-05-14 00:52:07] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 1 ms to minimize.
[2021-05-14 00:52:08] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 1 ms to minimize.
[2021-05-14 00:52:08] [INFO ] Deduced a trap composed of 58 places in 305 ms of which 1 ms to minimize.
[2021-05-14 00:52:08] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 1 ms to minimize.
[2021-05-14 00:52:09] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 1 ms to minimize.
[2021-05-14 00:52:09] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 0 ms to minimize.
[2021-05-14 00:52:09] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 1 ms to minimize.
[2021-05-14 00:52:09] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 1 ms to minimize.
[2021-05-14 00:52:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2496 ms
[2021-05-14 00:52:10] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 128 ms.
[2021-05-14 00:52:12] [INFO ] Deduced a trap composed of 7 places in 877 ms of which 2 ms to minimize.
[2021-05-14 00:52:12] [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
[2021-05-14 00:52:12] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2021-05-14 00:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:13] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2021-05-14 00:52:13] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 1 ms to minimize.
[2021-05-14 00:52:13] [INFO ] Deduced a trap composed of 118 places in 233 ms of which 1 ms to minimize.
[2021-05-14 00:52:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 683 ms
[2021-05-14 00:52:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:52:14] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2021-05-14 00:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:15] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2021-05-14 00:52:15] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 0 ms to minimize.
[2021-05-14 00:52:15] [INFO ] Deduced a trap composed of 118 places in 224 ms of which 1 ms to minimize.
[2021-05-14 00:52:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2021-05-14 00:52:15] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 112 ms.
[2021-05-14 00:52:19] [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
[2021-05-14 00:52:19] [INFO ] [Real]Absence check using 66 positive place invariants in 52 ms returned sat
[2021-05-14 00:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:20] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2021-05-14 00:52:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:52:20] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2021-05-14 00:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:21] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2021-05-14 00:52:21] [INFO ] Deduced a trap composed of 71 places in 365 ms of which 1 ms to minimize.
[2021-05-14 00:52:22] [INFO ] Deduced a trap composed of 55 places in 316 ms of which 1 ms to minimize.
[2021-05-14 00:52:22] [INFO ] Deduced a trap composed of 128 places in 268 ms of which 1 ms to minimize.
[2021-05-14 00:52:22] [INFO ] Deduced a trap composed of 77 places in 241 ms of which 1 ms to minimize.
[2021-05-14 00:52:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1508 ms
[2021-05-14 00:52:22] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 109 ms.
[2021-05-14 00:52:25] [INFO ] Added : 130 causal constraints over 26 iterations in 2425 ms. Result :unknown
[2021-05-14 00:52:25] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned sat
[2021-05-14 00:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:26] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2021-05-14 00:52:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:52:26] [INFO ] [Nat]Absence check using 66 positive place invariants in 57 ms returned sat
[2021-05-14 00:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:27] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2021-05-14 00:52:28] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 1 ms to minimize.
[2021-05-14 00:52:28] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 1 ms to minimize.
[2021-05-14 00:52:28] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2021-05-14 00:52:28] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 1 ms to minimize.
[2021-05-14 00:52:28] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 0 ms to minimize.
[2021-05-14 00:52:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1122 ms
[2021-05-14 00:52:29] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 158 ms.
[2021-05-14 00:52:32] [INFO ] Deduced a trap composed of 7 places in 875 ms of which 1 ms to minimize.
[2021-05-14 00:52:32] [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 5
[2021-05-14 00:52:32] [INFO ] [Real]Absence check using 66 positive place invariants in 51 ms returned sat
[2021-05-14 00:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:33] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2021-05-14 00:52:33] [INFO ] Deduced a trap composed of 89 places in 342 ms of which 1 ms to minimize.
[2021-05-14 00:52:34] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 0 ms to minimize.
[2021-05-14 00:52:34] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 1 ms to minimize.
[2021-05-14 00:52:35] [INFO ] Deduced a trap composed of 91 places in 324 ms of which 1 ms to minimize.
[2021-05-14 00:52:35] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 1 ms to minimize.
[2021-05-14 00:52:35] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 1 ms to minimize.
[2021-05-14 00:52:35] [INFO ] Deduced a trap composed of 168 places in 173 ms of which 1 ms to minimize.
[2021-05-14 00:52:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2388 ms
[2021-05-14 00:52:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:52:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 54 ms returned sat
[2021-05-14 00:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:52:37] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2021-05-14 00:52:37] [INFO ] Deduced a trap composed of 89 places in 343 ms of which 1 ms to minimize.
[2021-05-14 00:52:37] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 0 ms to minimize.
[2021-05-14 00:52:38] [INFO ] Deduced a trap composed of 64 places in 339 ms of which 1 ms to minimize.
[2021-05-14 00:52:38] [INFO ] Deduced a trap composed of 91 places in 326 ms of which 0 ms to minimize.
[2021-05-14 00:52:38] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 0 ms to minimize.
[2021-05-14 00:52:39] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 1 ms to minimize.
[2021-05-14 00:52:39] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 1 ms to minimize.
[2021-05-14 00:52:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2362 ms
[2021-05-14 00:52:39] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 109 ms.
[2021-05-14 00:52:41] [INFO ] Added : 85 causal constraints over 17 iterations in 1608 ms. Result :unknown
Fused 7 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 74300 steps, including 200 resets, run finished after 381 ms. (steps per millisecond=195 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 65900 steps, including 163 resets, run finished after 248 ms. (steps per millisecond=265 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 43 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1515 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 8 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 365 transitions
Trivial Post-agglo rules discarded 365 transitions
Performed 365 trivial Post agglomeration. Transition count delta: 365
Iterating post reduction 0 with 374 rules applied. Total rules applied 375 place count 1938 transition count 1863
Reduce places removed 365 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 379 rules applied. Total rules applied 754 place count 1573 transition count 1849
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 768 place count 1559 transition count 1849
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 768 place count 1559 transition count 1822
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 822 place count 1532 transition count 1822
Discarding 360 places :
Symmetric choice reduction at 3 with 360 rule applications. Total rules 1182 place count 1172 transition count 1462
Iterating global reduction 3 with 360 rules applied. Total rules applied 1542 place count 1172 transition count 1462
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 1542 place count 1172 transition count 1426
Deduced a syphon composed of 36 places in 9 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1614 place count 1136 transition count 1426
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 1739 place count 1011 transition count 1266
Iterating global reduction 3 with 125 rules applied. Total rules applied 1864 place count 1011 transition count 1266
Discarding 119 places :
Symmetric choice reduction at 3 with 119 rule applications. Total rules 1983 place count 892 transition count 1133
Iterating global reduction 3 with 119 rules applied. Total rules applied 2102 place count 892 transition count 1133
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 2143 place count 851 transition count 1061
Iterating global reduction 3 with 41 rules applied. Total rules applied 2184 place count 851 transition count 1061
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 2201 place count 849 transition count 1046
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2203 place count 847 transition count 1046
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 2231 place count 819 transition count 1018
Iterating global reduction 5 with 28 rules applied. Total rules applied 2259 place count 819 transition count 1018
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2261 place count 818 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2262 place count 817 transition count 1017
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2281 place count 798 transition count 979
Iterating global reduction 7 with 19 rules applied. Total rules applied 2300 place count 798 transition count 979
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2319 place count 779 transition count 960
Iterating global reduction 7 with 19 rules applied. Total rules applied 2338 place count 779 transition count 960
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 23 rules applied. Total rules applied 2361 place count 777 transition count 939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2363 place count 775 transition count 939
Performed 283 Post agglomeration using F-continuation condition.Transition count delta: 283
Deduced a syphon composed of 283 places in 1 ms
Reduce places removed 283 places and 0 transitions.
Iterating global reduction 9 with 566 rules applied. Total rules applied 2929 place count 492 transition count 656
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 2941 place count 480 transition count 644
Iterating global reduction 9 with 12 rules applied. Total rules applied 2953 place count 480 transition count 644
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 2962 place count 471 transition count 626
Iterating global reduction 9 with 9 rules applied. Total rules applied 2971 place count 471 transition count 626
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2973 place count 469 transition count 622
Iterating global reduction 9 with 2 rules applied. Total rules applied 2975 place count 469 transition count 622
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 3021 place count 446 transition count 691
Free-agglomeration rule applied 16 times.
Iterating global reduction 9 with 16 rules applied. Total rules applied 3037 place count 446 transition count 675
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 3057 place count 430 transition count 671
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3059 place count 430 transition count 669
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3061 place count 430 transition count 667
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3063 place count 428 transition count 667
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 3068 place count 428 transition count 667
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 3070 place count 428 transition count 667
Applied a total of 3070 rules in 766 ms. Remains 428 /2003 variables (removed 1575) and now considering 667/2292 (removed 1625) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/2003 places, 667/2292 transitions.
[2021-05-14 00:52:42] [INFO ] Flatten gal took : 93 ms
[2021-05-14 00:52:42] [INFO ] Flatten gal took : 50 ms
[2021-05-14 00:52:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5804858103106316153.gal : 22 ms
[2021-05-14 00:52:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10942249139011398940.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/ReachabilityCardinality5804858103106316153.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10942249139011398940.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/ReachabilityCardinality5804858103106316153.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10942249139011398940.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10942249139011398940.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 28
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :28 after 47
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :47 after 58
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :58 after 826
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :826 after 1618
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1618 after 10012
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :10012 after 33994
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :33994 after 134654
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :134654 after 7.39411e+07
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :7.39411e+07 after 1.07883e+08
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.07883e+08 after 2.27543e+10
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.27543e+10 after 2.06491e+11
Detected timeout of ITS tools.
[2021-05-14 00:52:57] [INFO ] Flatten gal took : 44 ms
[2021-05-14 00:52:57] [INFO ] Applying decomposition
[2021-05-14 00:52:57] [INFO ] Flatten gal took : 40 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/graph16240013054131116271.txt, -o, /tmp/graph16240013054131116271.bin, -w, /tmp/graph16240013054131116271.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/graph16240013054131116271.bin, -l, -1, -v, -w, /tmp/graph16240013054131116271.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 00:52:58] [INFO ] Decomposing Gal with order
[2021-05-14 00:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 00:52:58] [INFO ] Removed a total of 437 redundant transitions.
[2021-05-14 00:52:58] [INFO ] Flatten gal took : 107 ms
[2021-05-14 00:52:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 28 ms.
[2021-05-14 00:52:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17309250622769757380.gal : 12 ms
[2021-05-14 00:52:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12456354226992273355.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/ReachabilityCardinality17309250622769757380.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12456354226992273355.prop, --nowitness], 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/ReachabilityCardinality17309250622769757380.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12456354226992273355.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12456354226992273355.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1 after 2015
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2015 after 250075
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :250075 after 2.63314e+07
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2.63314e+07 after 6.72495e+10
Reachability property NoC3x3-PT-2B-ReachabilityFireability-04 is true.
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6.72495e+10 after 5.06889e+12
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5.06889e+12 after 1.98616e+16
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.98616e+16 after 5.96945e+16
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5.96945e+16 after 9.14578e+19
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15150995200428885821
[2021-05-14 00:53:13] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15150995200428885821
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/ltsmin15150995200428885821]
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/ltsmin15150995200428885821] 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/ltsmin15150995200428885821] 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 10760 resets, run finished after 4559 ms. (steps per millisecond=219 ) properties (out of 4) seen :2
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 727 resets, run finished after 1361 ms. (steps per millisecond=734 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 712 resets, run finished after 1413 ms. (steps per millisecond=707 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 667 rows 428 cols
[2021-05-14 00:53:23] [INFO ] Computed 55 place invariants in 8 ms
[2021-05-14 00:53:23] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-14 00:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:53:23] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-14 00:53:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:53:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-14 00:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:53:23] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-14 00:53:23] [INFO ] State equation strengthened by 63 read => feed constraints.
[2021-05-14 00:53:23] [INFO ] [Nat]Added 63 Read/Feed constraints in 16 ms returned sat
[2021-05-14 00:53:23] [INFO ] Computed and/alt/rep : 427/2240/427 causal constraints (skipped 238 transitions) in 37 ms.
[2021-05-14 00:53:25] [INFO ] Added : 231 causal constraints over 47 iterations in 1711 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 59500 steps, including 494 resets, run finished after 246 ms. (steps per millisecond=241 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 13 out of 428 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 428/428 places, 667/667 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 662
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 423 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 422 transition count 661
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 422 transition count 654
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 415 transition count 654
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 34 place count 407 transition count 627
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 407 transition count 627
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 406 transition count 625
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 406 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 406 transition count 624
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 67 place count 395 transition count 613
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 71 place count 391 transition count 608
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 391 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 391 transition count 607
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 78 place count 389 transition count 603
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 389 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 389 transition count 602
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 87 place count 386 transition count 610
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 90 place count 386 transition count 607
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 95 place count 383 transition count 605
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 96 place count 383 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 97 place count 382 transition count 607
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 382 transition count 607
Applied a total of 98 rules in 114 ms. Remains 382 /428 variables (removed 46) and now considering 607/667 (removed 60) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/428 places, 607/667 transitions.
[2021-05-14 00:53:25] [INFO ] Flatten gal took : 47 ms
[2021-05-14 00:53:26] [INFO ] Flatten gal took : 40 ms
[2021-05-14 00:53:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10788592658640375595.gal : 4 ms
[2021-05-14 00:53:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11948269564556635468.prop : 4635 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/ReachabilityCardinality10788592658640375595.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11948269564556635468.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/ReachabilityCardinality10788592658640375595.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11948269564556635468.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11948269564556635468.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 205
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :205 after 1043
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1043 after 6250
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6250 after 38815
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :38815 after 93807
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :93807 after 1.00477e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.00477e+07 after 7.5209e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.5209e+08 after 9.78363e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.78363e+10 after 8.62381e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.62381e+11 after 3.60312e+15
Detected timeout of ITS tools.
[2021-05-14 00:53:45] [INFO ] Flatten gal took : 34 ms
[2021-05-14 00:53:45] [INFO ] Applying decomposition
[2021-05-14 00:53:45] [INFO ] Flatten gal took : 33 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/graph2241403094114257510.txt, -o, /tmp/graph2241403094114257510.bin, -w, /tmp/graph2241403094114257510.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/graph2241403094114257510.bin, -l, -1, -v, -w, /tmp/graph2241403094114257510.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 00:53:45] [INFO ] Decomposing Gal with order
[2021-05-14 00:53:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 00:53:45] [INFO ] Removed a total of 781 redundant transitions.
[2021-05-14 00:53:45] [INFO ] Flatten gal took : 73 ms
[2021-05-14 00:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 66 ms.
[2021-05-14 00:53:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10288335415380904060.gal : 6 ms
[2021-05-14 00:53:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11403792777307104201.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/ReachabilityCardinality10288335415380904060.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11403792777307104201.prop, --nowitness], 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/ReachabilityCardinality10288335415380904060.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11403792777307104201.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11403792777307104201.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1201
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1201 after 45361
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :45361 after 864241
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :864241 after 2.09679e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.09679e+08 after 5.96262e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.96262e+10 after 3.64378e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.64378e+14 after 1.0635e+18
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.0635e+18 after 6.05401e+18
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10872420210307066122
[2021-05-14 00:54:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10872420210307066122
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/ltsmin10872420210307066122]
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/ltsmin10872420210307066122] 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/ltsmin10872420210307066122] 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 12210 resets, run finished after 4722 ms. (steps per millisecond=211 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 754 resets, run finished after 1529 ms. (steps per millisecond=654 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6610968 steps, run timeout after 30001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 6610968 steps, saw 1156148 distinct states, run finished after 34618 ms. (steps per millisecond=190 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-14 00:54:42] [INFO ] Flow matrix only has 606 transitions (discarded 1 similar events)
// Phase 1: matrix 606 rows 382 cols
[2021-05-14 00:54:42] [INFO ] Computed 55 place invariants in 4 ms
[2021-05-14 00:54:42] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-14 00:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:54:43] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-14 00:54:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:54:43] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-14 00:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:54:43] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-14 00:54:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 00:54:43] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2021-05-14 00:54:43] [INFO ] Computed and/alt/rep : 186/1022/185 causal constraints (skipped 405 transitions) in 38 ms.
[2021-05-14 00:54:44] [INFO ] Added : 120 causal constraints over 25 iterations in 769 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 53000 steps, including 447 resets, run finished after 247 ms. (steps per millisecond=214 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 13 out of 382 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 382/382 places, 607/607 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 607/607 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 607/607 transitions.
Starting structural reductions, iteration 0 : 382/382 places, 607/607 transitions.
Applied a total of 0 rules in 11 ms. Remains 382 /382 variables (removed 0) and now considering 607/607 (removed 0) transitions.
[2021-05-14 00:54:44] [INFO ] Flow matrix only has 606 transitions (discarded 1 similar events)
// Phase 1: matrix 606 rows 382 cols
[2021-05-14 00:54:44] [INFO ] Computed 55 place invariants in 3 ms
[2021-05-14 00:54:44] [INFO ] Implicit Places using invariants in 285 ms returned [11, 41, 87, 118, 168, 247, 295, 323, 363]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 289 ms to find 9 implicit places.
[2021-05-14 00:54:44] [INFO ] Redundant transitions in 33 ms returned []
[2021-05-14 00:54:44] [INFO ] Flow matrix only has 606 transitions (discarded 1 similar events)
// Phase 1: matrix 606 rows 373 cols
[2021-05-14 00:54:44] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-14 00:54:44] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Starting structural reductions, iteration 1 : 373/382 places, 607/607 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 352 transition count 586
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 62 place count 352 transition count 566
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 352 transition count 565
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 352 transition count 565
Applied a total of 64 rules in 34 ms. Remains 352 /373 variables (removed 21) and now considering 565/607 (removed 42) transitions.
// Phase 1: matrix 565 rows 352 cols
[2021-05-14 00:54:45] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-14 00:54:45] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 565 rows 352 cols
[2021-05-14 00:54:45] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-14 00:54:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2021-05-14 00:54:45] [INFO ] Implicit Places using invariants and state equation in 707 ms returned [6, 10, 28, 29, 32, 33, 37, 38, 75, 78, 80, 97, 98, 103, 104, 108, 134, 135, 136, 137, 140, 141, 142, 148, 149, 150, 154, 155, 156, 217, 218, 219, 222, 223, 224, 225, 228, 229, 230, 270, 274, 289, 290, 291, 294, 298, 299, 330, 331, 334, 335]
Discarding 51 places :
Implicit Place search using SMT with State Equation took 888 ms to find 51 implicit places.
Starting structural reductions, iteration 2 : 301/382 places, 565/607 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 301 transition count 563
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 299 transition count 563
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 74 place count 264 transition count 528
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 263 transition count 526
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 263 transition count 526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 262 transition count 524
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 262 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 262 transition count 523
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 107 place count 248 transition count 541
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 3 with 44 rules applied. Total rules applied 151 place count 248 transition count 511
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 198 place count 204 transition count 508
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 204 transition count 507
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 213 place count 204 transition count 507
Applied a total of 213 rules in 50 ms. Remains 204 /301 variables (removed 97) and now considering 507/565 (removed 58) transitions.
[2021-05-14 00:54:45] [INFO ] Flow matrix only has 502 transitions (discarded 5 similar events)
// Phase 1: matrix 502 rows 204 cols
[2021-05-14 00:54:45] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-14 00:54:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2021-05-14 00:54:46] [INFO ] Flow matrix only has 502 transitions (discarded 5 similar events)
// Phase 1: matrix 502 rows 204 cols
[2021-05-14 00:54:46] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-14 00:54:46] [INFO ] State equation strengthened by 98 read => feed constraints.
[2021-05-14 00:54:46] [INFO ] Implicit Places using invariants and state equation in 504 ms returned [157, 191]
Discarding 2 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 599 ms to find 2 implicit places.
Starting structural reductions, iteration 3 : 202/382 places, 503/607 transitions.
Applied a total of 0 rules in 8 ms. Remains 202 /202 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2021-05-14 00:54:46] [INFO ] Redundant transitions in 33 ms returned []
[2021-05-14 00:54:46] [INFO ] Flow matrix only has 498 transitions (discarded 5 similar events)
// Phase 1: matrix 498 rows 202 cols
[2021-05-14 00:54:46] [INFO ] Computed 31 place invariants in 1 ms
[2021-05-14 00:54:46] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 4 iterations. Remains : 202/382 places, 503/607 transitions.
[2021-05-14 00:54:46] [INFO ] Flatten gal took : 21 ms
[2021-05-14 00:54:46] [INFO ] Flatten gal took : 20 ms
[2021-05-14 00:54:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12018139507074879398.gal : 3 ms
[2021-05-14 00:54:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8220607802857974903.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/ReachabilityCardinality12018139507074879398.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8220607802857974903.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/ReachabilityCardinality12018139507074879398.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8220607802857974903.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8220607802857974903.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 58
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :58 after 65
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :65 after 306
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :306 after 818
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :818 after 4672
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4672 after 11364
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :11364 after 68991
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :68991 after 2.74302e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.74302e+07 after 3.15198e+09
Detected timeout of ITS tools.
[2021-05-14 00:55:01] [INFO ] Flatten gal took : 20 ms
[2021-05-14 00:55:01] [INFO ] Applying decomposition
[2021-05-14 00:55:01] [INFO ] Flatten gal took : 20 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/graph6417584252127157092.txt, -o, /tmp/graph6417584252127157092.bin, -w, /tmp/graph6417584252127157092.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/graph6417584252127157092.bin, -l, -1, -v, -w, /tmp/graph6417584252127157092.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 00:55:01] [INFO ] Decomposing Gal with order
[2021-05-14 00:55:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 00:55:01] [INFO ] Removed a total of 1053 redundant transitions.
[2021-05-14 00:55:01] [INFO ] Flatten gal took : 43 ms
[2021-05-14 00:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 49 ms.
[2021-05-14 00:55:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality980915420909272152.gal : 3 ms
[2021-05-14 00:55:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14111433540136520741.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/ReachabilityCardinality980915420909272152.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14111433540136520741.prop, --nowitness], 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/ReachabilityCardinality980915420909272152.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14111433540136520741.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14111433540136520741.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 641
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :641 after 9281
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9281 after 1.65952e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.65952e+06 after 2.76544e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.76544e+06 after 3.11104e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.11104e+06 after 2.89723e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.89723e+09 after 4.54561e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.54561e+09 after 2.14883e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.14883e+10 after 2.21917e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.21917e+10 after 8.09069e+17
Reachability property NoC3x3-PT-2B-ReachabilityFireability-11 is true.
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Detected timeout of ITS tools.
All properties solved without resorting to model-checking.

BK_STOP 1620953723102

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="NoC3x3-PT-2B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-2B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127500255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2B.tgz
mv NoC3x3-PT-2B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;