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

About the Execution of ITS-Tools for ShieldIIPs-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
781.888 105021.00 130756.00 417.00 TTTTFTTTTTTTFTTT 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-162098204900303.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204900303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:44 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 675K 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 ShieldIIPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621082185088

Running Version 0
[2021-05-15 12:36:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 12:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 12:36:26] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2021-05-15 12:36:26] [INFO ] Transformed 2403 places.
[2021-05-15 12:36:26] [INFO ] Transformed 2363 transitions.
[2021-05-15 12:36:26] [INFO ] Found NUPN structural information;
[2021-05-15 12:36:26] [INFO ] Parsed PT model containing 2403 places and 2363 transitions in 291 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 159 ms. (steps per millisecond=62 ) properties (out of 16) seen :7
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2021-05-15 12:36:27] [INFO ] Computed 361 place invariants in 33 ms
[2021-05-15 12:36:28] [INFO ] [Real]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-15 12:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:29] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2021-05-15 12:36:30] [INFO ] Deduced a trap composed of 13 places in 722 ms of which 12 ms to minimize.
[2021-05-15 12:36:30] [INFO ] Deduced a trap composed of 21 places in 647 ms of which 2 ms to minimize.
[2021-05-15 12:36:31] [INFO ] Deduced a trap composed of 17 places in 654 ms of which 1 ms to minimize.
[2021-05-15 12:36:32] [INFO ] Deduced a trap composed of 17 places in 628 ms of which 2 ms to minimize.
[2021-05-15 12:36:32] [INFO ] Deduced a trap composed of 34 places in 626 ms of which 1 ms to minimize.
[2021-05-15 12:36:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 12:36:33] [INFO ] [Real]Absence check using 361 positive place invariants in 143 ms returned sat
[2021-05-15 12:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:34] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2021-05-15 12:36:35] [INFO ] Deduced a trap composed of 20 places in 639 ms of which 1 ms to minimize.
[2021-05-15 12:36:36] [INFO ] Deduced a trap composed of 32 places in 625 ms of which 1 ms to minimize.
[2021-05-15 12:36:36] [INFO ] Deduced a trap composed of 16 places in 631 ms of which 1 ms to minimize.
[2021-05-15 12:36:37] [INFO ] Deduced a trap composed of 22 places in 624 ms of which 1 ms to minimize.
[2021-05-15 12:36:38] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 1 ms to minimize.
[2021-05-15 12:36:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-15 12:36:38] [INFO ] [Real]Absence check using 361 positive place invariants in 136 ms returned sat
[2021-05-15 12:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:39] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2021-05-15 12:36:40] [INFO ] Deduced a trap composed of 24 places in 602 ms of which 4 ms to minimize.
[2021-05-15 12:36:41] [INFO ] Deduced a trap composed of 27 places in 618 ms of which 1 ms to minimize.
[2021-05-15 12:36:41] [INFO ] Deduced a trap composed of 20 places in 597 ms of which 1 ms to minimize.
[2021-05-15 12:36:42] [INFO ] Deduced a trap composed of 26 places in 594 ms of which 1 ms to minimize.
[2021-05-15 12:36:43] [INFO ] Deduced a trap composed of 20 places in 608 ms of which 1 ms to minimize.
[2021-05-15 12:36:43] [INFO ] Deduced a trap composed of 33 places in 593 ms of which 1 ms to minimize.
[2021-05-15 12:36:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 12:36:44] [INFO ] [Real]Absence check using 361 positive place invariants in 177 ms returned sat
[2021-05-15 12:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:47] [INFO ] [Real]Absence check using state equation in 3328 ms returned sat
[2021-05-15 12:36:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 12:36:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 181 ms returned sat
[2021-05-15 12:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:51] [INFO ] [Nat]Absence check using state equation in 3174 ms returned sat
[2021-05-15 12:36:52] [INFO ] Deduced a trap composed of 24 places in 854 ms of which 3 ms to minimize.
[2021-05-15 12:36:53] [INFO ] Deduced a trap composed of 18 places in 800 ms of which 1 ms to minimize.
[2021-05-15 12:36:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 12:36:53] [INFO ] [Real]Absence check using 361 positive place invariants in 139 ms returned sat
[2021-05-15 12:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:54] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2021-05-15 12:36:55] [INFO ] Deduced a trap composed of 25 places in 685 ms of which 13 ms to minimize.
[2021-05-15 12:36:56] [INFO ] Deduced a trap composed of 23 places in 646 ms of which 11 ms to minimize.
[2021-05-15 12:36:56] [INFO ] Deduced a trap composed of 29 places in 641 ms of which 1 ms to minimize.
[2021-05-15 12:36:57] [INFO ] Deduced a trap composed of 19 places in 640 ms of which 2 ms to minimize.
[2021-05-15 12:36:58] [INFO ] Deduced a trap composed of 24 places in 631 ms of which 1 ms to minimize.
[2021-05-15 12:36:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-15 12:36:58] [INFO ] [Real]Absence check using 361 positive place invariants in 140 ms returned sat
[2021-05-15 12:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:36:59] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2021-05-15 12:37:00] [INFO ] Deduced a trap composed of 17 places in 623 ms of which 1 ms to minimize.
[2021-05-15 12:37:01] [INFO ] Deduced a trap composed of 20 places in 636 ms of which 2 ms to minimize.
[2021-05-15 12:37:01] [INFO ] Deduced a trap composed of 28 places in 608 ms of which 1 ms to minimize.
[2021-05-15 12:37:02] [INFO ] Deduced a trap composed of 18 places in 619 ms of which 2 ms to minimize.
[2021-05-15 12:37:03] [INFO ] Deduced a trap composed of 22 places in 594 ms of which 1 ms to minimize.
[2021-05-15 12:37:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 12:37:03] [INFO ] [Real]Absence check using 361 positive place invariants in 133 ms returned sat
[2021-05-15 12:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:37:04] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2021-05-15 12:37:05] [INFO ] Deduced a trap composed of 36 places in 700 ms of which 2 ms to minimize.
[2021-05-15 12:37:06] [INFO ] Deduced a trap composed of 14 places in 673 ms of which 2 ms to minimize.
[2021-05-15 12:37:07] [INFO ] Deduced a trap composed of 31 places in 680 ms of which 1 ms to minimize.
[2021-05-15 12:37:07] [INFO ] Deduced a trap composed of 13 places in 671 ms of which 2 ms to minimize.
[2021-05-15 12:37:08] [INFO ] Deduced a trap composed of 22 places in 667 ms of which 2 ms to minimize.
[2021-05-15 12:37:08] [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-05-15 12:37:09] [INFO ] [Real]Absence check using 361 positive place invariants in 141 ms returned sat
[2021-05-15 12:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:37:10] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2021-05-15 12:37:10] [INFO ] Deduced a trap composed of 20 places in 594 ms of which 8 ms to minimize.
[2021-05-15 12:37:11] [INFO ] Deduced a trap composed of 22 places in 574 ms of which 1 ms to minimize.
[2021-05-15 12:37:12] [INFO ] Deduced a trap composed of 14 places in 547 ms of which 2 ms to minimize.
[2021-05-15 12:37:12] [INFO ] Deduced a trap composed of 25 places in 548 ms of which 1 ms to minimize.
[2021-05-15 12:37:13] [INFO ] Deduced a trap composed of 37 places in 553 ms of which 2 ms to minimize.
[2021-05-15 12:37:13] [INFO ] Deduced a trap composed of 22 places in 540 ms of which 1 ms to minimize.
[2021-05-15 12:37:13] [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-05-15 12:37:14] [INFO ] [Real]Absence check using 361 positive place invariants in 150 ms returned sat
[2021-05-15 12:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 12:37:15] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2021-05-15 12:37:16] [INFO ] Deduced a trap composed of 18 places in 627 ms of which 2 ms to minimize.
[2021-05-15 12:37:16] [INFO ] Deduced a trap composed of 16 places in 603 ms of which 1 ms to minimize.
[2021-05-15 12:37:17] [INFO ] Deduced a trap composed of 27 places in 628 ms of which 2 ms to minimize.
[2021-05-15 12:37:18] [INFO ] Deduced a trap composed of 27 places in 594 ms of which 1 ms to minimize.
[2021-05-15 12:37:18] [INFO ] Deduced a trap composed of 27 places in 624 ms of which 2 ms to minimize.
[2021-05-15 12:37:20] [INFO ] Deduced a trap composed of 10 places in 1220 ms of which 2 ms to minimize.
[2021-05-15 12:37:20] [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 8
Fused 9 Parikh solutions to 1 different solutions.
Support contains 58 out of 2403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 2403 transition count 2170
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 387 place count 2210 transition count 2169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 2209 transition count 2169
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 195 Pre rules applied. Total rules applied 388 place count 2209 transition count 1974
Deduced a syphon composed of 195 places in 6 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 3 with 390 rules applied. Total rules applied 778 place count 2014 transition count 1974
Discarding 273 places :
Symmetric choice reduction at 3 with 273 rule applications. Total rules 1051 place count 1741 transition count 1701
Iterating global reduction 3 with 273 rules applied. Total rules applied 1324 place count 1741 transition count 1701
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 1324 place count 1741 transition count 1599
Deduced a syphon composed of 102 places in 8 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 1528 place count 1639 transition count 1599
Performed 590 Post agglomeration using F-continuation condition.Transition count delta: 590
Deduced a syphon composed of 590 places in 3 ms
Reduce places removed 590 places and 0 transitions.
Iterating global reduction 3 with 1180 rules applied. Total rules applied 2708 place count 1049 transition count 1009
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 263 times.
Drop transitions removed 263 transitions
Iterating global reduction 3 with 263 rules applied. Total rules applied 2971 place count 1049 transition count 1009
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2972 place count 1048 transition count 1008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 1047 transition count 1008
Applied a total of 2973 rules in 812 ms. Remains 1047 /2403 variables (removed 1356) and now considering 1008/2363 (removed 1355) transitions.
Finished structural reductions, in 1 iterations. Remains : 1047/2403 places, 1008/2363 transitions.
[2021-05-15 12:37:21] [INFO ] Flatten gal took : 153 ms
[2021-05-15 12:37:21] [INFO ] Flatten gal took : 91 ms
[2021-05-15 12:37:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11733614888357341921.gal : 22 ms
[2021-05-15 12:37:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15285278014629234032.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/ReachabilityCardinality11733614888357341921.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15285278014629234032.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/ReachabilityCardinality11733614888357341921.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15285278014629234032.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15285278014629234032.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :8 after 18
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :18 after 130
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :130 after 2310
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2310 after 147840
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :147840 after 3.55272e+08
Reachability property ShieldIIPs-PT-040B-ReachabilityFireability-11 is true.
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.55272e+08 after 3.5528e+08
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.5528e+08 after 3.55334e+08
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3.55334e+08 after 3.55491e+08
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.55491e+08 after 3.6797e+08
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3.6797e+08 after 4.91453e+08
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :4.91453e+08 after 5.47649e+09
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :5.47649e+09 after 8.82465e+13
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :8.82465e+13 after 3.33969e+14
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :3.33969e+14 after 4.81346e+14
Detected timeout of ITS tools.
[2021-05-15 12:37:36] [INFO ] Flatten gal took : 103 ms
[2021-05-15 12:37:36] [INFO ] Applying decomposition
[2021-05-15 12:37:36] [INFO ] Flatten gal took : 60 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/graph5657763087416636843.txt, -o, /tmp/graph5657763087416636843.bin, -w, /tmp/graph5657763087416636843.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/graph5657763087416636843.bin, -l, -1, -v, -w, /tmp/graph5657763087416636843.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 12:37:36] [INFO ] Decomposing Gal with order
[2021-05-15 12:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 12:37:37] [INFO ] Removed a total of 781 redundant transitions.
[2021-05-15 12:37:37] [INFO ] Flatten gal took : 155 ms
[2021-05-15 12:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 896 labels/synchronizations in 52 ms.
[2021-05-15 12:37:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14026084001790557398.gal : 17 ms
[2021-05-15 12:37:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8329239282118629561.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/ReachabilityCardinality14026084001790557398.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8329239282118629561.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/ReachabilityCardinality14026084001790557398.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8329239282118629561.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8329239282118629561.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 48
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :48 after 102
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :102 after 102
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :102 after 2310
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17116863320570692683
[2021-05-15 12:37:52] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17116863320570692683
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/ltsmin17116863320570692683]
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/ltsmin17116863320570692683] 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/ltsmin17116863320570692683] 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 311 resets, run finished after 10393 ms. (steps per millisecond=96 ) properties (out of 8) seen :6
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 927607 steps, including 17 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :{0=1}
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 48135 steps, including 0 resets, run visited all 1 properties in 324 ms. (steps per millisecond=148 )
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621082290109

--------------------
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="ShieldIIPs-PT-040B"
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 ShieldIIPs-PT-040B, 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-162098204900303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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