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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8871.348 339696.00 356465.00 18576.10 TTTFTTFTTTTFTTFF 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-162098205700815.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 ShieldPPPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205700815
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K 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.0K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:35 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 569K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621181950170

Running Version 0
[2021-05-16 16:19:12] [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-16 16:19:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:19:12] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2021-05-16 16:19:12] [INFO ] Transformed 2343 places.
[2021-05-16 16:19:12] [INFO ] Transformed 2133 transitions.
[2021-05-16 16:19:12] [INFO ] Found NUPN structural information;
[2021-05-16 16:19:12] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2021-05-16 16:19:13] [INFO ] Computed 331 place invariants in 42 ms
[2021-05-16 16:19:13] [INFO ] [Real]Absence check using 331 positive place invariants in 151 ms returned sat
[2021-05-16 16:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:14] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2021-05-16 16:19:15] [INFO ] Deduced a trap composed of 26 places in 733 ms of which 7 ms to minimize.
[2021-05-16 16:19:16] [INFO ] Deduced a trap composed of 25 places in 603 ms of which 1 ms to minimize.
[2021-05-16 16:19:17] [INFO ] Deduced a trap composed of 25 places in 616 ms of which 1 ms to minimize.
[2021-05-16 16:19:17] [INFO ] Deduced a trap composed of 23 places in 609 ms of which 3 ms to minimize.
[2021-05-16 16:19:18] [INFO ] Deduced a trap composed of 18 places in 589 ms of which 1 ms to minimize.
[2021-05-16 16:19:18] [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-16 16:19:18] [INFO ] [Real]Absence check using 331 positive place invariants in 123 ms returned sat
[2021-05-16 16:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:19] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2021-05-16 16:19:20] [INFO ] Deduced a trap composed of 21 places in 727 ms of which 13 ms to minimize.
[2021-05-16 16:19:21] [INFO ] Deduced a trap composed of 30 places in 617 ms of which 1 ms to minimize.
[2021-05-16 16:19:22] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 11 ms to minimize.
[2021-05-16 16:19:22] [INFO ] Deduced a trap composed of 21 places in 636 ms of which 1 ms to minimize.
[2021-05-16 16:19:23] [INFO ] Deduced a trap composed of 30 places in 612 ms of which 1 ms to minimize.
[2021-05-16 16:19:23] [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-16 16:19:24] [INFO ] [Real]Absence check using 331 positive place invariants in 122 ms returned sat
[2021-05-16 16:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:24] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2021-05-16 16:19:25] [INFO ] Deduced a trap composed of 21 places in 582 ms of which 1 ms to minimize.
[2021-05-16 16:19:26] [INFO ] Deduced a trap composed of 25 places in 587 ms of which 2 ms to minimize.
[2021-05-16 16:19:27] [INFO ] Deduced a trap composed of 22 places in 604 ms of which 2 ms to minimize.
[2021-05-16 16:19:27] [INFO ] Deduced a trap composed of 28 places in 555 ms of which 1 ms to minimize.
[2021-05-16 16:19:28] [INFO ] Deduced a trap composed of 19 places in 568 ms of which 2 ms to minimize.
[2021-05-16 16:19:28] [INFO ] Deduced a trap composed of 24 places in 599 ms of which 1 ms to minimize.
[2021-05-16 16:19:28] [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-16 16:19:29] [INFO ] [Real]Absence check using 331 positive place invariants in 121 ms returned sat
[2021-05-16 16:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:30] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2021-05-16 16:19:30] [INFO ] Deduced a trap composed of 21 places in 626 ms of which 1 ms to minimize.
[2021-05-16 16:19:31] [INFO ] Deduced a trap composed of 29 places in 621 ms of which 1 ms to minimize.
[2021-05-16 16:19:32] [INFO ] Deduced a trap composed of 27 places in 634 ms of which 1 ms to minimize.
[2021-05-16 16:19:33] [INFO ] Deduced a trap composed of 25 places in 615 ms of which 2 ms to minimize.
[2021-05-16 16:19:33] [INFO ] Deduced a trap composed of 24 places in 623 ms of which 2 ms to minimize.
[2021-05-16 16:19:34] [INFO ] Deduced a trap composed of 24 places in 594 ms of which 1 ms to minimize.
[2021-05-16 16:19:34] [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-16 16:19:34] [INFO ] [Real]Absence check using 331 positive place invariants in 126 ms returned sat
[2021-05-16 16:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:36] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2021-05-16 16:19:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:19:36] [INFO ] [Nat]Absence check using 331 positive place invariants in 134 ms returned sat
[2021-05-16 16:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:38] [INFO ] [Nat]Absence check using state equation in 1366 ms returned sat
[2021-05-16 16:19:38] [INFO ] Deduced a trap composed of 20 places in 593 ms of which 1 ms to minimize.
[2021-05-16 16:19:39] [INFO ] Deduced a trap composed of 19 places in 672 ms of which 2 ms to minimize.
[2021-05-16 16:19:40] [INFO ] Deduced a trap composed of 23 places in 586 ms of which 1 ms to minimize.
[2021-05-16 16:19:40] [INFO ] Deduced a trap composed of 32 places in 618 ms of which 2 ms to minimize.
[2021-05-16 16:19:41] [INFO ] Deduced a trap composed of 32 places in 604 ms of which 1 ms to minimize.
[2021-05-16 16:19:41] [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-16 16:19:42] [INFO ] [Real]Absence check using 331 positive place invariants in 132 ms returned sat
[2021-05-16 16:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:43] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2021-05-16 16:19:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:19:43] [INFO ] [Nat]Absence check using 331 positive place invariants in 130 ms returned sat
[2021-05-16 16:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:44] [INFO ] [Nat]Absence check using state equation in 1302 ms returned sat
[2021-05-16 16:19:45] [INFO ] Deduced a trap composed of 26 places in 900 ms of which 2 ms to minimize.
[2021-05-16 16:19:46] [INFO ] Deduced a trap composed of 36 places in 929 ms of which 2 ms to minimize.
[2021-05-16 16:19:47] [INFO ] Deduced a trap composed of 18 places in 933 ms of which 2 ms to minimize.
[2021-05-16 16:19:48] [INFO ] Deduced a trap composed of 26 places in 838 ms of which 2 ms to minimize.
[2021-05-16 16:19:48] [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-16 16:19:49] [INFO ] [Real]Absence check using 331 positive place invariants in 120 ms returned sat
[2021-05-16 16:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:50] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2021-05-16 16:19:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:19:50] [INFO ] [Nat]Absence check using 331 positive place invariants in 121 ms returned sat
[2021-05-16 16:19:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:51] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2021-05-16 16:19:52] [INFO ] Deduced a trap composed of 19 places in 613 ms of which 1 ms to minimize.
[2021-05-16 16:19:52] [INFO ] Deduced a trap composed of 26 places in 572 ms of which 1 ms to minimize.
[2021-05-16 16:19:53] [INFO ] Deduced a trap composed of 21 places in 593 ms of which 5 ms to minimize.
[2021-05-16 16:19:54] [INFO ] Deduced a trap composed of 28 places in 630 ms of which 2 ms to minimize.
[2021-05-16 16:19:54] [INFO ] Deduced a trap composed of 22 places in 586 ms of which 1 ms to minimize.
[2021-05-16 16:19:55] [INFO ] Deduced a trap composed of 20 places in 581 ms of which 1 ms to minimize.
[2021-05-16 16:19:55] [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-16 16:19:55] [INFO ] [Real]Absence check using 331 positive place invariants in 115 ms returned sat
[2021-05-16 16:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:56] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2021-05-16 16:19:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:19:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 129 ms returned sat
[2021-05-16 16:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:19:58] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2021-05-16 16:19:58] [INFO ] Deduced a trap composed of 22 places in 589 ms of which 1 ms to minimize.
[2021-05-16 16:19:59] [INFO ] Deduced a trap composed of 21 places in 629 ms of which 2 ms to minimize.
[2021-05-16 16:20:00] [INFO ] Deduced a trap composed of 21 places in 597 ms of which 2 ms to minimize.
[2021-05-16 16:20:00] [INFO ] Deduced a trap composed of 19 places in 579 ms of which 1 ms to minimize.
[2021-05-16 16:20:01] [INFO ] Deduced a trap composed of 19 places in 575 ms of which 1 ms to minimize.
[2021-05-16 16:20:02] [INFO ] Deduced a trap composed of 25 places in 593 ms of which 2 ms to minimize.
[2021-05-16 16:20:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-16 16:20:02] [INFO ] [Real]Absence check using 331 positive place invariants in 124 ms returned sat
[2021-05-16 16:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:20:03] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2021-05-16 16:20:04] [INFO ] Deduced a trap composed of 21 places in 602 ms of which 1 ms to minimize.
[2021-05-16 16:20:05] [INFO ] Deduced a trap composed of 29 places in 653 ms of which 1 ms to minimize.
[2021-05-16 16:20:05] [INFO ] Deduced a trap composed of 26 places in 700 ms of which 1 ms to minimize.
[2021-05-16 16:20:06] [INFO ] Deduced a trap composed of 27 places in 666 ms of which 1 ms to minimize.
[2021-05-16 16:20:07] [INFO ] Deduced a trap composed of 19 places in 615 ms of which 1 ms to minimize.
[2021-05-16 16:20:07] [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
[2021-05-16 16:20:07] [INFO ] [Real]Absence check using 331 positive place invariants in 115 ms returned sat
[2021-05-16 16:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:20:08] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2021-05-16 16:20:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:20:09] [INFO ] [Nat]Absence check using 331 positive place invariants in 122 ms returned sat
[2021-05-16 16:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:20:10] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2021-05-16 16:20:10] [INFO ] Deduced a trap composed of 20 places in 641 ms of which 1 ms to minimize.
[2021-05-16 16:20:11] [INFO ] Deduced a trap composed of 23 places in 596 ms of which 1 ms to minimize.
[2021-05-16 16:20:12] [INFO ] Deduced a trap composed of 19 places in 634 ms of which 1 ms to minimize.
[2021-05-16 16:20:12] [INFO ] Deduced a trap composed of 28 places in 635 ms of which 2 ms to minimize.
[2021-05-16 16:20:13] [INFO ] Deduced a trap composed of 19 places in 638 ms of which 1 ms to minimize.
[2021-05-16 16:20:14] [INFO ] Deduced a trap composed of 26 places in 561 ms of which 2 ms to minimize.
[2021-05-16 16:20:14] [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
Fused 10 Parikh solutions to 1 different solutions.
Support contains 36 out of 2343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 542 place count 2343 transition count 1591
Reduce places removed 542 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 544 rules applied. Total rules applied 1086 place count 1801 transition count 1589
Reduce places removed 1 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 17 rules applied. Total rules applied 1103 place count 1800 transition count 1573
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1119 place count 1784 transition count 1573
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 1119 place count 1784 transition count 1452
Deduced a syphon composed of 121 places in 4 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1361 place count 1663 transition count 1452
Discarding 204 places :
Symmetric choice reduction at 4 with 204 rule applications. Total rules 1565 place count 1459 transition count 1248
Iterating global reduction 4 with 204 rules applied. Total rules applied 1769 place count 1459 transition count 1248
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 1769 place count 1459 transition count 1168
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 1929 place count 1379 transition count 1168
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 2 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 4 with 992 rules applied. Total rules applied 2921 place count 883 transition count 672
Renaming transitions due to excessive name length > 1024 char.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 3083 place count 802 transition count 672
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3084 place count 802 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3085 place count 801 transition count 671
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 3172 place count 801 transition count 671
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3173 place count 800 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3174 place count 799 transition count 670
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3174 place count 799 transition count 668
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3178 place count 797 transition count 668
Applied a total of 3178 rules in 865 ms. Remains 797 /2343 variables (removed 1546) and now considering 668/2133 (removed 1465) transitions.
Finished structural reductions, in 1 iterations. Remains : 797/2343 places, 668/2133 transitions.
[2021-05-16 16:20:15] [INFO ] Flatten gal took : 99 ms
[2021-05-16 16:20:15] [INFO ] Flatten gal took : 52 ms
[2021-05-16 16:20:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16983379589914468125.gal : 24 ms
[2021-05-16 16:20:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6486182508116102611.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/ReachabilityCardinality16983379589914468125.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6486182508116102611.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/ReachabilityCardinality16983379589914468125.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6486182508116102611.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6486182508116102611.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 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 42
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :42 after 126
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :126 after 756
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :756 after 117180
Reachability property ShieldPPPt-PT-030B-ReachabilityFireability-10 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldPPPt-PT-030B-ReachabilityFireability-00 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :117180 after 127481
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :127481 after 418511
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :418511 after 922843
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :922843 after 3.10838e+06
Invariant property ShieldPPPt-PT-030B-ReachabilityFireability-11 does not hold.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :3.10838e+06 after 3.52931e+08
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3.52931e+08 after 5.62614e+09
Invariant property ShieldPPPt-PT-030B-ReachabilityFireability-15 does not hold.
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :5.62614e+09 after 7.71229e+12
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :7.71229e+12 after 8.78127e+13
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :8.78127e+13 after 4.30683e+16
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :4.30683e+16 after 1.38343e+18
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.38343e+18 after 5.14836e+21
Detected timeout of ITS tools.
[2021-05-16 16:20:30] [INFO ] Flatten gal took : 47 ms
[2021-05-16 16:20:30] [INFO ] Applying decomposition
[2021-05-16 16:20:30] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8514631219792730993.txt, -o, /tmp/graph8514631219792730993.bin, -w, /tmp/graph8514631219792730993.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/graph8514631219792730993.bin, -l, -1, -v, -w, /tmp/graph8514631219792730993.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:20:30] [INFO ] Decomposing Gal with order
[2021-05-16 16:20:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:20:30] [INFO ] Removed a total of 395 redundant transitions.
[2021-05-16 16:20:31] [INFO ] Flatten gal took : 105 ms
[2021-05-16 16:20:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 19 ms.
[2021-05-16 16:20:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14099066063983560350.gal : 16 ms
[2021-05-16 16:20:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16757642379704258114.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/ReachabilityCardinality14099066063983560350.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16757642379704258114.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/ReachabilityCardinality14099066063983560350.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16757642379704258114.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16757642379704258114.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 7
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :7 after 126
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :5.57539e+09 after 2.25859e+22
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9700216794400285708
[2021-05-16 16:20:46] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9700216794400285708
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/ltsmin9700216794400285708]
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/ltsmin9700216794400285708] 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/ltsmin9700216794400285708] 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 6664 ms. (steps per millisecond=150 ) properties (out of 6) seen :2
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 3765 ms. (steps per millisecond=265 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3641 ms. (steps per millisecond=274 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3888 ms. (steps per millisecond=257 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3810 ms. (steps per millisecond=262 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 668 rows 797 cols
[2021-05-16 16:21:09] [INFO ] Computed 330 place invariants in 5 ms
[2021-05-16 16:21:09] [INFO ] [Real]Absence check using 330 positive place invariants in 53 ms returned sat
[2021-05-16 16:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:21:09] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-16 16:21:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-16 16:21:09] [INFO ] [Real]Added 53 Read/Feed constraints in 8 ms returned sat
[2021-05-16 16:21:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:21:09] [INFO ] [Nat]Absence check using 330 positive place invariants in 51 ms returned sat
[2021-05-16 16:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:21:09] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2021-05-16 16:21:09] [INFO ] [Nat]Added 53 Read/Feed constraints in 11 ms returned sat
[2021-05-16 16:21:09] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 8 ms to minimize.
[2021-05-16 16:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2021-05-16 16:21:09] [INFO ] Computed and/alt/rep : 657/1805/657 causal constraints (skipped 0 transitions) in 44 ms.
[2021-05-16 16:21:18] [INFO ] Added : 638 causal constraints over 128 iterations in 8272 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2021-05-16 16:21:18] [INFO ] [Real]Absence check using 330 positive place invariants in 55 ms returned sat
[2021-05-16 16:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:21:18] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-16 16:21:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:21:18] [INFO ] [Nat]Absence check using 330 positive place invariants in 54 ms returned sat
[2021-05-16 16:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:21:19] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2021-05-16 16:21:19] [INFO ] [Nat]Added 53 Read/Feed constraints in 15 ms returned sat
[2021-05-16 16:21:19] [INFO ] Computed and/alt/rep : 657/1805/657 causal constraints (skipped 0 transitions) in 42 ms.
[2021-05-16 16:21:26] [INFO ] Added : 636 causal constraints over 129 iterations in 7358 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2021-05-16 16:21:26] [INFO ] [Real]Absence check using 330 positive place invariants in 50 ms returned sat
[2021-05-16 16:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:21:26] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-16 16:21:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:21:27] [INFO ] [Nat]Absence check using 330 positive place invariants in 47 ms returned sat
[2021-05-16 16:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:21:27] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-16 16:21:27] [INFO ] [Nat]Added 53 Read/Feed constraints in 16 ms returned sat
[2021-05-16 16:21:27] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2021-05-16 16:21:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2021-05-16 16:21:27] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2021-05-16 16:21:27] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2021-05-16 16:21:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2021-05-16 16:21:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 371 ms
[2021-05-16 16:21:27] [INFO ] Computed and/alt/rep : 657/1805/657 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-16 16:21:33] [INFO ] Added : 594 causal constraints over 120 iterations in 6150 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
Incomplete Parikh walk after 105500 steps, including 324 resets, run finished after 701 ms. (steps per millisecond=150 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 133100 steps, including 1001 resets, run finished after 857 ms. (steps per millisecond=155 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92200 steps, including 656 resets, run finished after 581 ms. (steps per millisecond=158 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 797 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 797/797 places, 668/668 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 797 transition count 661
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 790 transition count 661
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 790 transition count 652
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 781 transition count 652
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 56 place count 769 transition count 640
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 762 transition count 640
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 761 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 760 transition count 638
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 759 transition count 637
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 758 transition count 636
Applied a total of 74 rules in 265 ms. Remains 758 /797 variables (removed 39) and now considering 636/668 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/797 places, 636/668 transitions.
[2021-05-16 16:21:36] [INFO ] Flatten gal took : 33 ms
[2021-05-16 16:21:36] [INFO ] Flatten gal took : 33 ms
[2021-05-16 16:21:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4322738274171947171.gal : 3 ms
[2021-05-16 16:21:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17762635882538556800.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/ReachabilityCardinality4322738274171947171.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17762635882538556800.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/ReachabilityCardinality4322738274171947171.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17762635882538556800.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17762635882538556800.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 918
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :918 after 1323
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1323 after 1916
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1916 after 273924
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :273924 after 795088
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :795088 after 9.68252e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.68252e+06 after 6.70724e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.70724e+08 after 2.19396e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.19396e+11 after 3.16572e+16
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.16572e+16 after 1.55224e+20
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.55224e+20 after 4.69598e+23
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.69598e+23 after 3.23083e+34
Detected timeout of ITS tools.
[2021-05-16 16:21:51] [INFO ] Flatten gal took : 35 ms
[2021-05-16 16:21:51] [INFO ] Applying decomposition
[2021-05-16 16:21:51] [INFO ] Flatten gal took : 29 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/graph3499355388386129603.txt, -o, /tmp/graph3499355388386129603.bin, -w, /tmp/graph3499355388386129603.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/graph3499355388386129603.bin, -l, -1, -v, -w, /tmp/graph3499355388386129603.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:21:51] [INFO ] Decomposing Gal with order
[2021-05-16 16:21:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:21:51] [INFO ] Removed a total of 426 redundant transitions.
[2021-05-16 16:21:51] [INFO ] Flatten gal took : 50 ms
[2021-05-16 16:21:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 8 ms.
[2021-05-16 16:21:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18248765403824231758.gal : 7 ms
[2021-05-16 16:21:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8481657376119572329.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/ReachabilityCardinality18248765403824231758.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8481657376119572329.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/ReachabilityCardinality18248765403824231758.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8481657376119572329.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8481657376119572329.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 18
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15202502706898537622
[2021-05-16 16:22:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15202502706898537622
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/ltsmin15202502706898537622]
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/ltsmin15202502706898537622] 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/ltsmin15202502706898537622] 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 6520 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3605 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3273862 steps, run timeout after 30001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 3273862 steps, saw 2776953 distinct states, run finished after 30005 ms. (steps per millisecond=109 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 758 cols
[2021-05-16 16:22:47] [INFO ] Computed 330 place invariants in 7 ms
[2021-05-16 16:22:48] [INFO ] [Real]Absence check using 330 positive place invariants in 54 ms returned sat
[2021-05-16 16:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:22:48] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-16 16:22:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2021-05-16 16:22:48] [INFO ] [Real]Added 46 Read/Feed constraints in 5 ms returned sat
[2021-05-16 16:22:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:22:48] [INFO ] [Nat]Absence check using 330 positive place invariants in 50 ms returned sat
[2021-05-16 16:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:22:48] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2021-05-16 16:22:48] [INFO ] [Nat]Added 46 Read/Feed constraints in 13 ms returned sat
[2021-05-16 16:22:48] [INFO ] Computed and/alt/rep : 629/1757/629 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 16:22:56] [INFO ] Added : 613 causal constraints over 125 iterations in 7864 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
Incomplete Parikh walk after 115400 steps, including 1000 resets, run finished after 677 ms. (steps per millisecond=170 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 8 out of 758 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 758/758 places, 636/636 transitions.
Applied a total of 0 rules in 16 ms. Remains 758 /758 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 636/636 transitions.
Starting structural reductions, iteration 0 : 758/758 places, 636/636 transitions.
Applied a total of 0 rules in 39 ms. Remains 758 /758 variables (removed 0) and now considering 636/636 (removed 0) transitions.
// Phase 1: matrix 636 rows 758 cols
[2021-05-16 16:22:57] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 16:22:57] [INFO ] Implicit Places using invariants in 436 ms returned [741, 745]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 438 ms to find 2 implicit places.
[2021-05-16 16:22:57] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 636 rows 756 cols
[2021-05-16 16:22:57] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:22:58] [INFO ] Dead Transitions using invariants and state equation in 379 ms returned []
Starting structural reductions, iteration 1 : 756/758 places, 636/636 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 754 transition count 634
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 754 transition count 634
Applied a total of 4 rules in 26 ms. Remains 754 /756 variables (removed 2) and now considering 634/636 (removed 2) transitions.
// Phase 1: matrix 634 rows 754 cols
[2021-05-16 16:22:58] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:22:58] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 634 rows 754 cols
[2021-05-16 16:22:58] [INFO ] Computed 328 place invariants in 3 ms
[2021-05-16 16:22:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-16 16:22:59] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 754/758 places, 634/636 transitions.
[2021-05-16 16:22:59] [INFO ] Flatten gal took : 29 ms
[2021-05-16 16:22:59] [INFO ] Flatten gal took : 28 ms
[2021-05-16 16:22:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16255610896183469387.gal : 4 ms
[2021-05-16 16:22:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10235097900088461373.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/ReachabilityCardinality16255610896183469387.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10235097900088461373.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/ReachabilityCardinality16255610896183469387.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10235097900088461373.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10235097900088461373.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 918
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :918 after 1323
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1323 after 1916
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1916 after 273924
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :273924 after 795088
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :795088 after 9.68252e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.68252e+06 after 6.70724e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.70724e+08 after 2.19396e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.19396e+11 after 3.16572e+16
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.16572e+16 after 1.55224e+20
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.55224e+20 after 4.69598e+23
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.69598e+23 after 2.55004e+34
Detected timeout of ITS tools.
[2021-05-16 16:23:14] [INFO ] Flatten gal took : 27 ms
[2021-05-16 16:23:14] [INFO ] Applying decomposition
[2021-05-16 16:23:14] [INFO ] Flatten gal took : 25 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/graph642490909837853904.txt, -o, /tmp/graph642490909837853904.bin, -w, /tmp/graph642490909837853904.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/graph642490909837853904.bin, -l, -1, -v, -w, /tmp/graph642490909837853904.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 16:23:17] [INFO ] Decomposing Gal with order
[2021-05-16 16:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 16:23:17] [INFO ] Removed a total of 426 redundant transitions.
[2021-05-16 16:23:17] [INFO ] Flatten gal took : 45 ms
[2021-05-16 16:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 9 ms.
[2021-05-16 16:23:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9008365997974576051.gal : 6 ms
[2021-05-16 16:23:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8961967660404955331.prop : 86 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/ReachabilityCardinality9008365997974576051.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8961967660404955331.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/ReachabilityCardinality9008365997974576051.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8961967660404955331.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8961967660404955331.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 18432
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4287980183008520634
[2021-05-16 16:23:32] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4287980183008520634
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/ltsmin4287980183008520634]
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/ltsmin4287980183008520634] 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/ltsmin4287980183008520634] 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 6533 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3569 ms. (steps per millisecond=280 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3250099 steps, run timeout after 42653 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 3250099 steps, saw 2803492 distinct states, run finished after 42653 ms. (steps per millisecond=76 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 634 rows 754 cols
[2021-05-16 16:24:26] [INFO ] Computed 328 place invariants in 2 ms
[2021-05-16 16:24:26] [INFO ] [Real]Absence check using 328 positive place invariants in 51 ms returned sat
[2021-05-16 16:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:24:27] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-16 16:24:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:24:27] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2021-05-16 16:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:24:27] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-16 16:24:27] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-16 16:24:27] [INFO ] [Nat]Added 44 Read/Feed constraints in 12 ms returned sat
[2021-05-16 16:24:27] [INFO ] Computed and/alt/rep : 627/1744/627 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-16 16:24:38] [INFO ] Added : 600 causal constraints over 120 iterations in 11062 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
Finished Parikh walk after 620 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=124 )
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621182289866

--------------------
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-030B"
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-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205700815"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;