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-165286037200168.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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037200168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.6K Apr 30 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 03:44 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.4K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 03:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 30 03:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 30 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 30 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 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 172K 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 ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655072776125

Running Version 0
[2022-06-12 22:26:17] [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-12 22:26:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:26:17] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-06-12 22:26:17] [INFO ] Transformed 683 places.
[2022-06-12 22:26:17] [INFO ] Transformed 633 transitions.
[2022-06-12 22:26:17] [INFO ] Found NUPN structural information;
[2022-06-12 22:26:17] [INFO ] Parsed PT model containing 683 places and 633 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 101 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :14
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 633 rows 683 cols
[2022-06-12 22:26:18] [INFO ] Computed 111 place invariants in 23 ms
[2022-06-12 22:26:18] [INFO ] [Real]Absence check using 111 positive place invariants in 51 ms returned sat
[2022-06-12 22:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:18] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-06-12 22:26:18] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 4 ms to minimize.
[2022-06-12 22:26:19] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 2 ms to minimize.
[2022-06-12 22:26:19] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2022-06-12 22:26:19] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2022-06-12 22:26:19] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2022-06-12 22:26:19] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:26:19] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:26:20] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-06-12 22:26:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2793 ms
[2022-06-12 22:26:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:21] [INFO ] [Nat]Absence check using 111 positive place invariants in 37 ms returned sat
[2022-06-12 22:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:21] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2022-06-12 22:26:22] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-06-12 22:26:23] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2022-06-12 22:26:24] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2022-06-12 22:26:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-06-12 22:26:26] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4110 ms
[2022-06-12 22:26:26] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints (skipped 0 transitions) in 42 ms.
[2022-06-12 22:26:26] [INFO ] Added : 55 causal constraints over 11 iterations in 543 ms. Result :unknown
[2022-06-12 22:26:26] [INFO ] [Real]Absence check using 111 positive place invariants in 31 ms returned sat
[2022-06-12 22:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:26] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-06-12 22:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 32 ms returned sat
[2022-06-12 22:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:27] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2022-06-12 22:26:27] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-06-12 22:26:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 943 ms
[2022-06-12 22:26:28] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 22:26:32] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2022-06-12 22:26: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 1
Incomplete Parikh walk after 42600 steps, including 325 resets, run finished after 113 ms. (steps per millisecond=376 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 16 out of 683 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 683 transition count 564
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 614 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 613 transition count 563
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 140 place count 613 transition count 513
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 240 place count 563 transition count 513
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 309 place count 494 transition count 444
Iterating global reduction 3 with 69 rules applied. Total rules applied 378 place count 494 transition count 444
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 378 place count 494 transition count 415
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 436 place count 465 transition count 415
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 716 place count 325 transition count 275
Partial Free-agglomeration rule applied 83 times.
Drop transitions removed 83 transitions
Iterating global reduction 3 with 83 rules applied. Total rules applied 799 place count 325 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 800 place count 324 transition count 274
Applied a total of 800 rules in 158 ms. Remains 324 /683 variables (removed 359) and now considering 274/633 (removed 359) transitions.
Finished structural reductions, in 1 iterations. Remains : 324/683 places, 274/633 transitions.
[2022-06-12 22:26:32] [INFO ] Flatten gal took : 62 ms
[2022-06-12 22:26:32] [INFO ] Flatten gal took : 25 ms
[2022-06-12 22:26:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18045144841929307504.gal : 16 ms
[2022-06-12 22:26:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6068066200074410343.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/ReachabilityCardinality18045144841929307504.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6068066200074410343.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/ReachabilityCardinality18045144841929307504.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6068066200074410343.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6068066200074410343.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 810
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :810 after 1055
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1055 after 1259
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1259 after 51396
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :51396 after 292081
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :292081 after 2.47236e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.47236e+06 after 7.95385e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.95385e+08 after 1.17147e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.17147e+10 after 1.40437e+11
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.40437e+11 after 1.27208e+12
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.27208e+12 after 5.76825e+13
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.76825e+13 after 6.63889e+14
Detected timeout of ITS tools.
[2022-06-12 22:26:47] [INFO ] Flatten gal took : 20 ms
[2022-06-12 22:26:47] [INFO ] Applying decomposition
[2022-06-12 22:26:47] [INFO ] Flatten gal took : 18 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/graph10818876647340503217.txt, -o, /tmp/graph10818876647340503217.bin, -w, /tmp/graph10818876647340503217.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/graph10818876647340503217.bin, -l, -1, -v, -w, /tmp/graph10818876647340503217.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:26:47] [INFO ] Decomposing Gal with order
[2022-06-12 22:26:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:26:47] [INFO ] Removed a total of 128 redundant transitions.
[2022-06-12 22:26:48] [INFO ] Flatten gal took : 58 ms
[2022-06-12 22:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 239 labels/synchronizations in 15 ms.
[2022-06-12 22:26:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15644441072839175381.gal : 7 ms
[2022-06-12 22:26:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12381916121364277208.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/ReachabilityCardinality15644441072839175381.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12381916121364277208.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/ReachabilityCardinality15644441072839175381.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12381916121364277208.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12381916121364277208.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 54
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :54 after 365796
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :365796 after 3.18845e+07
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.18845e+07 after 2.42529e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.42529e+09 after 8.32868e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12075439068777642927
[2022-06-12 22:27:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12075439068777642927
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/ltsmin12075439068777642927]
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/ltsmin12075439068777642927] 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/ltsmin12075439068777642927] 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)
Finished random walk after 518823 steps, including 271 resets, run visited all 2 properties in 2118 ms. (steps per millisecond=244 )
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655072827292

--------------------
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="ShieldPPPs-PT-010B"
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 ShieldPPPs-PT-010B, 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-165286037200168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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