fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r216-tall-162098205700895
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldPPPt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1160.800 194034.00 240905.00 965.40 TFFFTTTFTTTFFFTF normal

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.r216-tall-162098205700895.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 itstools
Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205700895
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 955K May 5 16:52 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 ShieldPPPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1622927699890

Running Version 0
[2021-06-05 21:15:01] [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-06-05 21:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-05 21:15:01] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2021-06-05 21:15:01] [INFO ] Transformed 3903 places.
[2021-06-05 21:15:01] [INFO ] Transformed 3553 transitions.
[2021-06-05 21:15:01] [INFO ] Found NUPN structural information;
[2021-06-05 21:15:01] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 397 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 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2021-06-05 21:15:02] [INFO ] Computed 551 place invariants in 44 ms
[2021-06-05 21:15:03] [INFO ] [Real]Absence check using 551 positive place invariants in 307 ms returned sat
[2021-06-05 21:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:05] [INFO ] [Real]Absence check using state equation in 2202 ms returned sat
[2021-06-05 21:15:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:15:07] [INFO ] [Nat]Absence check using 551 positive place invariants in 300 ms returned sat
[2021-06-05 21:15:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:09] [INFO ] [Nat]Absence check using state equation in 2406 ms returned sat
[2021-06-05 21:15:11] [INFO ] Deduced a trap composed of 28 places in 1396 ms of which 5 ms to minimize.
[2021-06-05 21:15:12] [INFO ] Deduced a trap composed of 20 places in 1359 ms of which 12 ms to minimize.
[2021-06-05 21:15: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 0
[2021-06-05 21:15:13] [INFO ] [Real]Absence check using 551 positive place invariants in 276 ms returned sat
[2021-06-05 21:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:15] [INFO ] [Real]Absence check using state equation in 2052 ms returned sat
[2021-06-05 21:15:15] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:15:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 259 ms returned sat
[2021-06-05 21:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:18] [INFO ] [Nat]Absence check using state equation in 2161 ms returned sat
[2021-06-05 21:15:19] [INFO ] Deduced a trap composed of 31 places in 1185 ms of which 5 ms to minimize.
[2021-06-05 21:15:21] [INFO ] Deduced a trap composed of 36 places in 1125 ms of which 3 ms to minimize.
[2021-06-05 21:15:21] [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-06-05 21:15:22] [INFO ] [Real]Absence check using 551 positive place invariants in 257 ms returned sat
[2021-06-05 21:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:23] [INFO ] [Real]Absence check using state equation in 1905 ms returned sat
[2021-06-05 21:15:24] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:15:24] [INFO ] [Nat]Absence check using 551 positive place invariants in 257 ms returned sat
[2021-06-05 21:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:26] [INFO ] [Nat]Absence check using state equation in 1984 ms returned sat
[2021-06-05 21:15:28] [INFO ] Deduced a trap composed of 32 places in 1303 ms of which 3 ms to minimize.
[2021-06-05 21:15:29] [INFO ] Deduced a trap composed of 22 places in 1297 ms of which 7 ms to minimize.
[2021-06-05 21:15:29] [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-06-05 21:15:30] [INFO ] [Real]Absence check using 551 positive place invariants in 260 ms returned sat
[2021-06-05 21:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:32] [INFO ] [Real]Absence check using state equation in 2013 ms returned sat
[2021-06-05 21:15:33] [INFO ] Deduced a trap composed of 22 places in 1255 ms of which 2 ms to minimize.
[2021-06-05 21:15:35] [INFO ] Deduced a trap composed of 21 places in 1325 ms of which 3 ms to minimize.
[2021-06-05 21:15:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-06-05 21:15:36] [INFO ] [Real]Absence check using 551 positive place invariants in 460 ms returned sat
[2021-06-05 21:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:40] [INFO ] [Real]Absence check using state equation in 4020 ms returned unknown
[2021-06-05 21:15:41] [INFO ] [Real]Absence check using 551 positive place invariants in 262 ms returned sat
[2021-06-05 21:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:43] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2021-06-05 21:15:44] [INFO ] Deduced a trap composed of 31 places in 1133 ms of which 3 ms to minimize.
[2021-06-05 21:15:45] [INFO ] Deduced a trap composed of 25 places in 1232 ms of which 2 ms to minimize.
[2021-06-05 21:15:45] [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-06-05 21:15:46] [INFO ] [Real]Absence check using 551 positive place invariants in 262 ms returned sat
[2021-06-05 21:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:48] [INFO ] [Real]Absence check using state equation in 2136 ms returned sat
[2021-06-05 21:15:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:15:49] [INFO ] [Nat]Absence check using 551 positive place invariants in 262 ms returned sat
[2021-06-05 21:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:51] [INFO ] [Nat]Absence check using state equation in 2146 ms returned sat
[2021-06-05 21:15:53] [INFO ] Deduced a trap composed of 24 places in 1321 ms of which 3 ms to minimize.
[2021-06-05 21:15:54] [INFO ] Deduced a trap composed of 19 places in 1217 ms of which 2 ms to minimize.
[2021-06-05 21:15: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 6
[2021-06-05 21:15:55] [INFO ] [Real]Absence check using 551 positive place invariants in 291 ms returned sat
[2021-06-05 21:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:15:57] [INFO ] [Real]Absence check using state equation in 2266 ms returned sat
[2021-06-05 21:15:59] [INFO ] Deduced a trap composed of 32 places in 1258 ms of which 3 ms to minimize.
[2021-06-05 21:16:00] [INFO ] Deduced a trap composed of 21 places in 1249 ms of which 2 ms to minimize.
[2021-06-05 21:16:00] [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 7
[2021-06-05 21:16:01] [INFO ] [Real]Absence check using 551 positive place invariants in 387 ms returned sat
[2021-06-05 21:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:16:05] [INFO ] [Real]Absence check using state equation in 4110 ms returned unknown
[2021-06-05 21:16:06] [INFO ] [Real]Absence check using 551 positive place invariants in 268 ms returned sat
[2021-06-05 21:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:16:08] [INFO ] [Real]Absence check using state equation in 2067 ms returned sat
[2021-06-05 21:16:10] [INFO ] Deduced a trap composed of 19 places in 1284 ms of which 3 ms to minimize.
[2021-06-05 21:16:11] [INFO ] Deduced a trap composed of 18 places in 1380 ms of which 3 ms to minimize.
[2021-06-05 21:16:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-06-05 21:16:12] [INFO ] [Real]Absence check using 551 positive place invariants in 280 ms returned sat
[2021-06-05 21:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:16:14] [INFO ] [Real]Absence check using state equation in 2059 ms returned sat
[2021-06-05 21:16:16] [INFO ] Deduced a trap composed of 24 places in 1389 ms of which 3 ms to minimize.
[2021-06-05 21:16:17] [INFO ] Deduced a trap composed of 29 places in 1284 ms of which 2 ms to minimize.
[2021-06-05 21:16:17] [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 10
[2021-06-05 21:16:18] [INFO ] [Real]Absence check using 551 positive place invariants in 245 ms returned sat
[2021-06-05 21:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:16:20] [INFO ] [Real]Absence check using state equation in 1861 ms returned sat
[2021-06-05 21:16:20] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:16:21] [INFO ] [Nat]Absence check using 551 positive place invariants in 291 ms returned sat
[2021-06-05 21:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:16:23] [INFO ] [Nat]Absence check using state equation in 2531 ms returned sat
[2021-06-05 21:16:25] [INFO ] Deduced a trap composed of 25 places in 1288 ms of which 2 ms to minimize.
[2021-06-05 21:16:26] [INFO ] Deduced a trap composed of 18 places in 1265 ms of which 3 ms to minimize.
[2021-06-05 21:16:26] [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 11
Fused 12 Parikh solutions to 1 different solutions.
Support contains 53 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 906 transitions
Trivial Post-agglo rules discarded 906 transitions
Performed 906 trivial Post agglomeration. Transition count delta: 906
Iterating post reduction 0 with 906 rules applied. Total rules applied 906 place count 3903 transition count 2647
Reduce places removed 906 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 923 rules applied. Total rules applied 1829 place count 2997 transition count 2630
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1846 place count 2980 transition count 2630
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 208 Pre rules applied. Total rules applied 1846 place count 2980 transition count 2422
Deduced a syphon composed of 208 places in 6 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 2262 place count 2772 transition count 2422
Discarding 339 places :
Symmetric choice reduction at 3 with 339 rule applications. Total rules 2601 place count 2433 transition count 2083
Iterating global reduction 3 with 339 rules applied. Total rules applied 2940 place count 2433 transition count 2083
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 2940 place count 2433 transition count 1940
Deduced a syphon composed of 143 places in 6 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 3226 place count 2290 transition count 1940
Performed 825 Post agglomeration using F-continuation condition.Transition count delta: 825
Deduced a syphon composed of 825 places in 2 ms
Reduce places removed 825 places and 0 transitions.
Iterating global reduction 3 with 1650 rules applied. Total rules applied 4876 place count 1465 transition count 1115
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5078 place count 1364 transition count 1115
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 5160 place count 1323 transition count 1115
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5162 place count 1323 transition count 1113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5164 place count 1321 transition count 1113
Partial Free-agglomeration rule applied 145 times.
Drop transitions removed 145 transitions
Iterating global reduction 4 with 145 rules applied. Total rules applied 5309 place count 1321 transition count 1113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5310 place count 1320 transition count 1112
Applied a total of 5310 rules in 2589 ms. Remains 1320 /3903 variables (removed 2583) and now considering 1112/3553 (removed 2441) transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/3903 places, 1112/3553 transitions.
[2021-06-05 21:16:29] [INFO ] Flatten gal took : 152 ms
[2021-06-05 21:16:29] [INFO ] Flatten gal took : 101 ms
[2021-06-05 21:16:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17128170169060059403.gal : 29 ms
[2021-06-05 21:16:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17789327537870517646.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/ReachabilityCardinality17128170169060059403.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17789327537870517646.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/ReachabilityCardinality17128170169060059403.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17789327537870517646.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17789327537870517646.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :8 after 59
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :59 after 977
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :977 after 23360
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :23360 after 3.36384e+06
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-10 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-08 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2021-06-05 21:16:44] [INFO ] Flatten gal took : 71 ms
[2021-06-05 21:16:44] [INFO ] Applying decomposition
[2021-06-05 21:16:44] [INFO ] Flatten gal took : 58 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/graph14573153012725232663.txt, -o, /tmp/graph14573153012725232663.bin, -w, /tmp/graph14573153012725232663.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/graph14573153012725232663.bin, -l, -1, -v, -w, /tmp/graph14573153012725232663.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:16:44] [INFO ] Decomposing Gal with order
[2021-06-05 21:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:16:45] [INFO ] Removed a total of 715 redundant transitions.
[2021-06-05 21:16:45] [INFO ] Flatten gal took : 145 ms
[2021-06-05 21:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 63 ms.
[2021-06-05 21:16:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6685377802771528080.gal : 17 ms
[2021-06-05 21:16:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10373908870810920589.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/ReachabilityCardinality6685377802771528080.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10373908870810920589.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/ReachabilityCardinality6685377802771528080.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10373908870810920589.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10373908870810920589.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :13 after 1951
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :1951 after 280320
Invariant property ShieldPPPt-PT-050B-ReachabilityFireability-15 does not hold.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-14 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-09 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-050B-ReachabilityFireability-07 does not hold.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-05 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-04 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-050B-ReachabilityFireability-01 does not hold.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-00 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.46797e+13 after 1.24833e+108
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10876395220904042795
[2021-06-05 21:17:00] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10876395220904042795
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/ltsmin10876395220904042795]
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/ltsmin10876395220904042795] 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/ltsmin10876395220904042795] 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 2 resets, run finished after 8773 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 830904 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 1112 rows 1320 cols
[2021-06-05 21:17:15] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-05 21:17:15] [INFO ] [Real]Absence check using 551 positive place invariants in 107 ms returned sat
[2021-06-05 21:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:17:16] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2021-06-05 21:17:16] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:17:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2021-06-05 21:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:17:16] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2021-06-05 21:17:16] [INFO ] State equation strengthened by 213 read => feed constraints.
[2021-06-05 21:17:16] [INFO ] [Nat]Added 213 Read/Feed constraints in 69 ms returned sat
[2021-06-05 21:17:16] [INFO ] Computed and/alt/rep : 1104/3911/1104 causal constraints (skipped 0 transitions) in 81 ms.
[2021-06-05 21:17:37] [INFO ] Added : 930 causal constraints over 186 iterations in 20238 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
Incomplete Parikh walk after 185400 steps, including 1000 resets, run finished after 1343 ms. (steps per millisecond=138 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1320/1320 places, 1112/1112 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1320 transition count 1102
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1310 transition count 1102
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 20 place count 1310 transition count 1089
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 1297 transition count 1089
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 116 place count 1262 transition count 1054
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 1262 transition count 1052
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 130 place count 1256 transition count 1052
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 1256 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 1255 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 1254 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 136 place count 1254 transition count 1049
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 1252 transition count 1049
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 1251 transition count 1048
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 1250 transition count 1047
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 1249 transition count 1046
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 1248 transition count 1045
Applied a total of 144 rules in 447 ms. Remains 1248 /1320 variables (removed 72) and now considering 1045/1112 (removed 67) transitions.
Finished structural reductions, in 1 iterations. Remains : 1248/1320 places, 1045/1112 transitions.
[2021-06-05 21:17:39] [INFO ] Flatten gal took : 54 ms
[2021-06-05 21:17:39] [INFO ] Flatten gal took : 52 ms
[2021-06-05 21:17:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11577157322249759060.gal : 6 ms
[2021-06-05 21:17:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1886800318445281032.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/ReachabilityCardinality11577157322249759060.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1886800318445281032.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/ReachabilityCardinality11577157322249759060.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1886800318445281032.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1886800318445281032.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 54
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :54 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 227
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :227 after 1000
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1000 after 135394
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :135394 after 4.26812e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.26812e+06 after 6.69304e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.69304e+08 after 1.63233e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.63233e+10 after 1.26352e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.26352e+13 after 2.17789e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.17789e+18 after 3.72559e+23
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.72559e+23 after 9.42181e+33
Detected timeout of ITS tools.
[2021-06-05 21:17:54] [INFO ] Flatten gal took : 47 ms
[2021-06-05 21:17:54] [INFO ] Applying decomposition
[2021-06-05 21:17:54] [INFO ] Flatten gal took : 46 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/graph11893203629173546049.txt, -o, /tmp/graph11893203629173546049.bin, -w, /tmp/graph11893203629173546049.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/graph11893203629173546049.bin, -l, -1, -v, -w, /tmp/graph11893203629173546049.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:17:54] [INFO ] Decomposing Gal with order
[2021-06-05 21:17:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:17:54] [INFO ] Removed a total of 733 redundant transitions.
[2021-06-05 21:17:54] [INFO ] Flatten gal took : 71 ms
[2021-06-05 21:17:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 12 ms.
[2021-06-05 21:17:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9064285348563191622.gal : 8 ms
[2021-06-05 21:17:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13667267741523962227.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/ReachabilityCardinality9064285348563191622.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13667267741523962227.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/ReachabilityCardinality9064285348563191622.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13667267741523962227.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13667267741523962227.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
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin618413894054857075
[2021-06-05 21:18:09] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin618413894054857075
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/ltsmin618413894054857075]
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/ltsmin618413894054857075] 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/ltsmin618413894054857075] 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 239839 steps, including 0 resets, run visited all 1 properties in 2170 ms. (steps per millisecond=110 )
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1622927893924

--------------------
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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r216-tall-162098205700895"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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