Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 30 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 370K May 10 09:34 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 ShieldRVs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655078603813

Running Version 0
[2022-06-13 00:03:25] [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]
[2022-06-13 00:03:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 00:03:25] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2022-06-13 00:03:25] [INFO ] Transformed 1203 places.
[2022-06-13 00:03:25] [INFO ] Transformed 1353 transitions.
[2022-06-13 00:03:25] [INFO ] Found NUPN structural information;
[2022-06-13 00:03:25] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :11
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2022-06-13 00:03:26] [INFO ] Computed 121 place invariants in 33 ms
[2022-06-13 00:03:26] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2022-06-13 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:27] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2022-06-13 00:03:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:03:27] [INFO ] [Nat]Absence check using 121 positive place invariants in 60 ms returned sat
[2022-06-13 00:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:29] [INFO ] [Nat]Absence check using state equation in 1584 ms returned sat
[2022-06-13 00:03:29] [INFO ] Deduced a trap composed of 29 places in 475 ms of which 4 ms to minimize.
[2022-06-13 00:03:30] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 2 ms to minimize.
[2022-06-13 00:03:30] [INFO ] Deduced a trap composed of 27 places in 356 ms of which 2 ms to minimize.
[2022-06-13 00:03:30] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 1 ms to minimize.
[2022-06-13 00:03:31] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 1 ms to minimize.
[2022-06-13 00:03:31] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 1 ms to minimize.
[2022-06-13 00:03:32] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 1 ms to minimize.
[2022-06-13 00:03:32] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 1 ms to minimize.
[2022-06-13 00:03: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 0
[2022-06-13 00:03:32] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-06-13 00:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:33] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2022-06-13 00:03:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:03:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2022-06-13 00:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:34] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2022-06-13 00:03:34] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 0 ms to minimize.
[2022-06-13 00:03:34] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 0 ms to minimize.
[2022-06-13 00:03:35] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2022-06-13 00:03:35] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2022-06-13 00:03:35] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 0 ms to minimize.
[2022-06-13 00:03:35] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2022-06-13 00:03:36] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 1 ms to minimize.
[2022-06-13 00:03:36] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 0 ms to minimize.
[2022-06-13 00:03:37] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2022-06-13 00:03:37] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 1 ms to minimize.
[2022-06-13 00:03:37] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 1 ms to minimize.
[2022-06-13 00:03:38] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 0 ms to minimize.
[2022-06-13 00:03:38] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 1 ms to minimize.
[2022-06-13 00:03:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-13 00:03:38] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-06-13 00:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:39] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2022-06-13 00:03:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:03:39] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2022-06-13 00:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:40] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2022-06-13 00:03:40] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 16 ms to minimize.
[2022-06-13 00:03:40] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 1 ms to minimize.
[2022-06-13 00:03:41] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2022-06-13 00:03:41] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 1 ms to minimize.
[2022-06-13 00:03:41] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 1 ms to minimize.
[2022-06-13 00:03:42] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 0 ms to minimize.
[2022-06-13 00:03:42] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 1 ms to minimize.
[2022-06-13 00:03:42] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 1 ms to minimize.
[2022-06-13 00:03:43] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 0 ms to minimize.
[2022-06-13 00:03:43] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 1 ms to minimize.
[2022-06-13 00:03:43] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 1 ms to minimize.
[2022-06-13 00:03:43] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 1 ms to minimize.
[2022-06-13 00:03:44] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 1 ms to minimize.
[2022-06-13 00:03:44] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 1 ms to minimize.
[2022-06-13 00:03:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-13 00:03:44] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2022-06-13 00:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:45] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2022-06-13 00:03:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:03:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-06-13 00:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:46] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-06-13 00:03:46] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 1 ms to minimize.
[2022-06-13 00:03:47] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 1 ms to minimize.
[2022-06-13 00:03:47] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 8 ms to minimize.
[2022-06-13 00:03:47] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 1 ms to minimize.
[2022-06-13 00:03:47] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 2 ms to minimize.
[2022-06-13 00:03:48] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2022-06-13 00:03:48] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2022-06-13 00:03:48] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 0 ms to minimize.
[2022-06-13 00:03:48] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 0 ms to minimize.
[2022-06-13 00:03:49] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 1 ms to minimize.
[2022-06-13 00:03:49] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 1 ms to minimize.
[2022-06-13 00:03:49] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 1 ms to minimize.
[2022-06-13 00:03:49] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 0 ms to minimize.
[2022-06-13 00:03:50] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 1 ms to minimize.
[2022-06-13 00:03:50] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2022-06-13 00:03:50] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2022-06-13 00:03:50] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 0 ms to minimize.
[2022-06-13 00:03:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-13 00:03:50] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2022-06-13 00:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:51] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2022-06-13 00:03:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:03:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2022-06-13 00:03:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:03:52] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2022-06-13 00:03:53] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2022-06-13 00:03:53] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 0 ms to minimize.
[2022-06-13 00:03:53] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 1 ms to minimize.
[2022-06-13 00:03:53] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2022-06-13 00:03:54] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 9 ms to minimize.
[2022-06-13 00:03:54] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 1 ms to minimize.
[2022-06-13 00:03:54] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2022-06-13 00:03:55] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2022-06-13 00:03:55] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2022-06-13 00:03:55] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 1 ms to minimize.
[2022-06-13 00:03:55] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 0 ms to minimize.
[2022-06-13 00:03:56] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 1 ms to minimize.
[2022-06-13 00:03:56] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2022-06-13 00:03:56] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 1 ms to minimize.
[2022-06-13 00:03:56] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2022-06-13 00:03:56] [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 4
Fused 5 Parikh solutions to 1 different solutions.
Support contains 128 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1203 transition count 1268
Reduce places removed 85 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 94 rules applied. Total rules applied 179 place count 1118 transition count 1259
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 188 place count 1109 transition count 1259
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 142 Pre rules applied. Total rules applied 188 place count 1109 transition count 1117
Deduced a syphon composed of 142 places in 4 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 284 rules applied. Total rules applied 472 place count 967 transition count 1117
Discarding 168 places :
Symmetric choice reduction at 3 with 168 rule applications. Total rules 640 place count 799 transition count 949
Iterating global reduction 3 with 168 rules applied. Total rules applied 808 place count 799 transition count 949
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 808 place count 799 transition count 897
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 912 place count 747 transition count 897
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 2 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 1284 place count 561 transition count 711
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 1336 place count 561 transition count 711
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1337 place count 560 transition count 710
Applied a total of 1337 rules in 340 ms. Remains 560 /1203 variables (removed 643) and now considering 710/1353 (removed 643) transitions.
Finished structural reductions, in 1 iterations. Remains : 560/1203 places, 710/1353 transitions.
[2022-06-13 00:03:57] [INFO ] Flatten gal took : 107 ms
[2022-06-13 00:03:57] [INFO ] Flatten gal took : 67 ms
[2022-06-13 00:03:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6551021971589079301.gal : 22 ms
[2022-06-13 00:03:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9346287567410379693.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/ReachabilityCardinality6551021971589079301.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9346287567410379693.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/ReachabilityCardinality6551021971589079301.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9346287567410379693.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9346287567410379693.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :12 after 26
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :26 after 425
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :425 after 2.29606e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.29606e+06 after 2.10902e+12
Invariant property ShieldRVs-PT-030B-ReachabilityFireability-02 does not hold.
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8.21201e+19 after 1.48779e+20
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.48779e+20 after 1.48779e+20
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.48779e+20 after 1.48779e+20
Detected timeout of ITS tools.
[2022-06-13 00:04:12] [INFO ] Flatten gal took : 52 ms
[2022-06-13 00:04:12] [INFO ] Applying decomposition
[2022-06-13 00:04:12] [INFO ] Flatten gal took : 47 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/graph10062584072451298746.txt, -o, /tmp/graph10062584072451298746.bin, -w, /tmp/graph10062584072451298746.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/graph10062584072451298746.bin, -l, -1, -v, -w, /tmp/graph10062584072451298746.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:04:12] [INFO ] Decomposing Gal with order
[2022-06-13 00:04:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:04:13] [INFO ] Removed a total of 813 redundant transitions.
[2022-06-13 00:04:13] [INFO ] Flatten gal took : 118 ms
[2022-06-13 00:04:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 483 labels/synchronizations in 46 ms.
[2022-06-13 00:04:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16476820499292870507.gal : 13 ms
[2022-06-13 00:04:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9692779499295320722.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/ReachabilityCardinality16476820499292870507.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9692779499295320722.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/ReachabilityCardinality16476820499292870507.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9692779499295320722.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9692779499295320722.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2 after 557
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :557 after 109337
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :109337 after 1.26541e+14
Reachability property ShieldRVs-PT-030B-ReachabilityFireability-01 is true.
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.28495e+21 after 3.7578e+24
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5146631497511906378
[2022-06-13 00:04:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5146631497511906378
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/ltsmin5146631497511906378]
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/ltsmin5146631497511906378] 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/ltsmin5146631497511906378] 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 1849 resets, run finished after 3786 ms. (steps per millisecond=264 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 170 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 157 resets, run finished after 2760 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 710 rows 560 cols
[2022-06-13 00:04:37] [INFO ] Computed 121 place invariants in 8 ms
[2022-06-13 00:04:38] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2022-06-13 00:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:04:38] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-13 00:04:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:04:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2022-06-13 00:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:04:38] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-06-13 00:04:38] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2022-06-13 00:04:38] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-06-13 00:04:38] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 8 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-06-13 00:04:39] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-06-13 00:04:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2022-06-13 00:04:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2022-06-13 00:04:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2022-06-13 00:04:40] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2022-06-13 00:04:40] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1571 ms
[2022-06-13 00:04:40] [INFO ] Computed and/alt/rep : 517/2326/517 causal constraints (skipped 172 transitions) in 48 ms.
[2022-06-13 00:04:45] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2022-06-13 00:04:45] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-06-13 00:04:45] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-06-13 00:04:45] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2022-06-13 00:04:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-06-13 00:04:45] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:04:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2022-06-13 00:04:47] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-06-13 00:04:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2025 ms
[2022-06-13 00:04:47] [INFO ] Added : 391 causal constraints over 79 iterations in 7185 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
Incomplete Parikh walk after 55800 steps, including 568 resets, run finished after 251 ms. (steps per millisecond=222 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 36 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 710/710 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 560 transition count 701
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 551 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 550 transition count 700
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 20 place count 550 transition count 679
Deduced a syphon composed of 21 places in 8 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 62 place count 529 transition count 679
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 525 transition count 675
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 525 transition count 675
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 525 transition count 673
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 523 transition count 673
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 6 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 176 place count 472 transition count 622
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 187 place count 472 transition count 622
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 471 transition count 621
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 470 transition count 620
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 469 transition count 619
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 468 transition count 618
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 467 transition count 617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 466 transition count 616
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 465 transition count 615
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 464 transition count 614
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 463 transition count 613
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 462 transition count 612
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 461 transition count 611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 460 transition count 610
Applied a total of 199 rules in 294 ms. Remains 460 /560 variables (removed 100) and now considering 610/710 (removed 100) transitions.
Finished structural reductions, in 1 iterations. Remains : 460/560 places, 610/710 transitions.
[2022-06-13 00:04:48] [INFO ] Flatten gal took : 38 ms
[2022-06-13 00:04:48] [INFO ] Flatten gal took : 35 ms
[2022-06-13 00:04:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality770963677243317806.gal : 4 ms
[2022-06-13 00:04:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17293832724490237421.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/ReachabilityCardinality770963677243317806.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17293832724490237421.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/ReachabilityCardinality770963677243317806.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17293832724490237421.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17293832724490237421.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 100
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :100 after 1783
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1783 after 32077
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.15477e+06 after 4.79016e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.79016e+06 after 4.80711e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.80711e+06 after 4.84249e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.84249e+06 after 4.95921e+06
Detected timeout of ITS tools.
[2022-06-13 00:05:03] [INFO ] Flatten gal took : 31 ms
[2022-06-13 00:05:03] [INFO ] Applying decomposition
[2022-06-13 00:05:03] [INFO ] Flatten gal took : 42 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/graph11266541212480065504.txt, -o, /tmp/graph11266541212480065504.bin, -w, /tmp/graph11266541212480065504.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/graph11266541212480065504.bin, -l, -1, -v, -w, /tmp/graph11266541212480065504.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:05:03] [INFO ] Decomposing Gal with order
[2022-06-13 00:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:05:03] [INFO ] Removed a total of 715 redundant transitions.
[2022-06-13 00:05:03] [INFO ] Flatten gal took : 49 ms
[2022-06-13 00:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 614 labels/synchronizations in 16 ms.
[2022-06-13 00:05:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13339484954027756405.gal : 5 ms
[2022-06-13 00:05:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1149136503083840005.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/ReachabilityCardinality13339484954027756405.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1149136503083840005.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/ReachabilityCardinality13339484954027756405.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1149136503083840005.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1149136503083840005.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 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 199
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :199 after 32077
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32077 after 192462
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.00401e+08 after 5.58006e+21
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5944750473334278047
[2022-06-13 00:05:18] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5944750473334278047
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/ltsmin5944750473334278047]
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/ltsmin5944750473334278047] 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/ltsmin5944750473334278047] 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 2416 resets, run finished after 3778 ms. (steps per millisecond=264 ) properties (out of 1) seen :0
Finished Best-First random walk after 467587 steps, including 119 resets, run visited all 1 properties in 1344 ms. (steps per millisecond=347 )
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655078725563

--------------------
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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ShieldRVs-PT-030B, 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 r233-tall-165286037500312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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