Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.0K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 9.9K May 30 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 30 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 17M May 29 12:20 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 StigmergyCommit-PT-08a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654720868677

Running Version 0
[2022-06-08 20:41:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 20:41:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:41:13] [INFO ] Load time of PNML (sax parser for PT used): 1387 ms
[2022-06-08 20:41:13] [INFO ] Transformed 328 places.
[2022-06-08 20:41:13] [INFO ] Transformed 18744 transitions.
[2022-06-08 20:41:13] [INFO ] Found NUPN structural information;
[2022-06-08 20:41:13] [INFO ] Parsed PT model containing 328 places and 18744 transitions in 1651 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 12) seen :2
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) 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 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 74 ms. (steps per millisecond=135 ) 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 26 ms. (steps per millisecond=384 ) 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 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-08 20:41:14] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2022-06-08 20:41:14] [INFO ] Computed 10 place invariants in 53 ms
[2022-06-08 20:41:15] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2022-06-08 20:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:15] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2022-06-08 20:41:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:16] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-08 20:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:16] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-06-08 20:41:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:16] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-06-08 20:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:17] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2022-06-08 20:41:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-08 20:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:18] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2022-06-08 20:41:18] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2022-06-08 20:41:18] [INFO ] [Nat]Added 1147 Read/Feed constraints in 391 ms returned sat
[2022-06-08 20:41:19] [INFO ] Deduced a trap composed of 17 places in 629 ms of which 21 ms to minimize.
[2022-06-08 20:41:20] [INFO ] Deduced a trap composed of 17 places in 607 ms of which 3 ms to minimize.
[2022-06-08 20:41:20] [INFO ] Deduced a trap composed of 16 places in 427 ms of which 2 ms to minimize.
[2022-06-08 20:41:21] [INFO ] Deduced a trap composed of 18 places in 550 ms of which 4 ms to minimize.
[2022-06-08 20:41:22] [INFO ] Deduced a trap composed of 16 places in 435 ms of which 2 ms to minimize.
[2022-06-08 20:41:22] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2022-06-08 20:41:23] [INFO ] Deduced a trap composed of 2 places in 634 ms of which 1 ms to minimize.
[2022-06-08 20:41: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 2
[2022-06-08 20:41:23] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-06-08 20:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:23] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-06-08 20:41:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:24] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-08 20:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:24] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-06-08 20:41:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-06-08 20:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:25] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-06-08 20:41:25] [INFO ] [Nat]Added 1147 Read/Feed constraints in 512 ms returned sat
[2022-06-08 20:41:26] [INFO ] Deduced a trap composed of 17 places in 558 ms of which 1 ms to minimize.
[2022-06-08 20:41:26] [INFO ] Deduced a trap composed of 17 places in 500 ms of which 1 ms to minimize.
[2022-06-08 20:41:27] [INFO ] Deduced a trap composed of 16 places in 417 ms of which 0 ms to minimize.
[2022-06-08 20:41:27] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 1 ms to minimize.
[2022-06-08 20:41:28] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 0 ms to minimize.
[2022-06-08 20:41:28] [INFO ] Deduced a trap composed of 16 places in 342 ms of which 1 ms to minimize.
[2022-06-08 20:41:29] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 1 ms to minimize.
[2022-06-08 20:41:29] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2022-06-08 20:41:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-08 20:41:29] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-06-08 20:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:30] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2022-06-08 20:41:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-08 20:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:30] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2022-06-08 20:41:31] [INFO ] [Nat]Added 1147 Read/Feed constraints in 426 ms returned sat
[2022-06-08 20:41:31] [INFO ] Deduced a trap composed of 17 places in 632 ms of which 1 ms to minimize.
[2022-06-08 20:41:32] [INFO ] Deduced a trap composed of 19 places in 500 ms of which 1 ms to minimize.
[2022-06-08 20:41:33] [INFO ] Deduced a trap composed of 16 places in 416 ms of which 1 ms to minimize.
[2022-06-08 20:41:33] [INFO ] Deduced a trap composed of 17 places in 512 ms of which 2 ms to minimize.
[2022-06-08 20:41:34] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 0 ms to minimize.
[2022-06-08 20:41:34] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 9 ms to minimize.
[2022-06-08 20:41:35] [INFO ] Deduced a trap composed of 16 places in 324 ms of which 2 ms to minimize.
[2022-06-08 20:41:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-08 20:41:35] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-08 20:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:36] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2022-06-08 20:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:36] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-08 20:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:36] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2022-06-08 20:41:37] [INFO ] [Real]Added 1147 Read/Feed constraints in 577 ms returned sat
[2022-06-08 20:41:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-06-08 20:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:37] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2022-06-08 20:41:38] [INFO ] [Nat]Added 1147 Read/Feed constraints in 608 ms returned sat
[2022-06-08 20:41:39] [INFO ] Deduced a trap composed of 17 places in 530 ms of which 0 ms to minimize.
[2022-06-08 20:41:39] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 1 ms to minimize.
[2022-06-08 20:41:40] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 0 ms to minimize.
[2022-06-08 20:41:40] [INFO ] Deduced a trap composed of 16 places in 392 ms of which 1 ms to minimize.
[2022-06-08 20:41:41] [INFO ] Deduced a trap composed of 17 places in 370 ms of which 0 ms to minimize.
[2022-06-08 20:41:41] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 0 ms to minimize.
[2022-06-08 20:41:42] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 0 ms to minimize.
[2022-06-08 20:41:42] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2022-06-08 20:41:42] [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
[2022-06-08 20:41:42] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2022-06-08 20:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:43] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2022-06-08 20:41:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-08 20:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:43] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2022-06-08 20:41:44] [INFO ] [Nat]Added 1147 Read/Feed constraints in 518 ms returned sat
[2022-06-08 20:41:44] [INFO ] Deduced a trap composed of 16 places in 562 ms of which 1 ms to minimize.
[2022-06-08 20:41:45] [INFO ] Deduced a trap composed of 16 places in 462 ms of which 1 ms to minimize.
[2022-06-08 20:41:45] [INFO ] Deduced a trap composed of 16 places in 397 ms of which 1 ms to minimize.
[2022-06-08 20:41:46] [INFO ] Deduced a trap composed of 16 places in 315 ms of which 1 ms to minimize.
[2022-06-08 20:41:46] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 21 ms to minimize.
[2022-06-08 20:41:47] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2022-06-08 20:41:47] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 2 ms to minimize.
[2022-06-08 20:41:47] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2022-06-08 20:41:48] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2022-06-08 20:41:48] [INFO ] Deduced a trap composed of 2 places in 591 ms of which 2 ms to minimize.
[2022-06-08 20:41: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 8
[2022-06-08 20:41:48] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-08 20:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:49] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-06-08 20:41:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:41:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-08 20:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:41:49] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2022-06-08 20:41:50] [INFO ] [Nat]Added 1147 Read/Feed constraints in 905 ms returned sat
[2022-06-08 20:41:51] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 1 ms to minimize.
[2022-06-08 20:41:51] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 0 ms to minimize.
[2022-06-08 20:41:52] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2022-06-08 20:41:53] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 0 ms to minimize.
[2022-06-08 20:41:53] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 0 ms to minimize.
[2022-06-08 20:41:54] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 0 ms to minimize.
[2022-06-08 20:41:54] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 1 ms to minimize.
[2022-06-08 20:41:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 74 out of 328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 321 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.38 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 321 transition count 1384
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 111 place count 290 transition count 1363
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 15 rules applied. Total rules applied 126 place count 286 transition count 1352
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 144 place count 275 transition count 1345
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 144 place count 275 transition count 1312
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 210 place count 242 transition count 1312
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 239 place count 213 transition count 1283
Iterating global reduction 4 with 29 rules applied. Total rules applied 268 place count 213 transition count 1283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 269 place count 213 transition count 1282
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 287 place count 195 transition count 1264
Iterating global reduction 5 with 18 rules applied. Total rules applied 305 place count 195 transition count 1264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 310 place count 195 transition count 1259
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 194 transition count 1258
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 194 transition count 1258
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 332 place count 184 transition count 1248
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 335 place count 184 transition count 1245
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 341 place count 178 transition count 1239
Iterating global reduction 7 with 6 rules applied. Total rules applied 347 place count 178 transition count 1239
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 349 place count 176 transition count 1237
Iterating global reduction 7 with 2 rules applied. Total rules applied 351 place count 176 transition count 1237
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 353 place count 174 transition count 1235
Iterating global reduction 7 with 2 rules applied. Total rules applied 355 place count 174 transition count 1235
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 365 place count 174 transition count 1225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 367 place count 173 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 368 place count 172 transition count 1223
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 172 transition count 1223
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 383 place count 172 transition count 1209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 397 place count 158 transition count 1209
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 398 place count 158 transition count 1208
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 403 place count 158 transition count 1208
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 407 place count 158 transition count 1204
Applied a total of 407 rules in 2728 ms. Remains 158 /328 variables (removed 170) and now considering 1204/1449 (removed 245) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/328 places, 1204/1449 transitions.
[2022-06-08 20:41:58] [INFO ] Flatten gal took : 465 ms
[2022-06-08 20:41:58] [INFO ] Flatten gal took : 205 ms
[2022-06-08 20:41:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10569371463461659670.gal : 73 ms
[2022-06-08 20:41:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18311512253459986383.prop : 2 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/ReachabilityCardinality10569371463461659670.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18311512253459986383.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/ReachabilityCardinality10569371463461659670.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18311512253459986383.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18311512253459986383.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :11 after 49
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :49 after 121
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :121 after 1201
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1201 after 12241
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :12241 after 66721
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :66721 after 372001
Reachability property StigmergyCommit-PT-08a-ReachabilityCardinality-02 is true.
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.592e+06 after 3.64852e+06
Detected timeout of ITS tools.
[2022-06-08 20:42:13] [INFO ] Flatten gal took : 313 ms
[2022-06-08 20:42:13] [INFO ] Applying decomposition
[2022-06-08 20:42:14] [INFO ] Flatten gal took : 235 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/graph2707117802363522726.txt, -o, /tmp/graph2707117802363522726.bin, -w, /tmp/graph2707117802363522726.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/graph2707117802363522726.bin, -l, -1, -v, -w, /tmp/graph2707117802363522726.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 20:42:14] [INFO ] Decomposing Gal with order
[2022-06-08 20:42:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:42:15] [INFO ] Removed a total of 9355 redundant transitions.
[2022-06-08 20:42:15] [INFO ] Flatten gal took : 754 ms
[2022-06-08 20:42:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 259 ms.
[2022-06-08 20:42:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality720955788761773957.gal : 25 ms
[2022-06-08 20:42:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7673379290306118292.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/ReachabilityCardinality720955788761773957.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7673379290306118292.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/ReachabilityCardinality720955788761773957.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7673379290306118292.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7673379290306118292.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :13 after 17
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :17 after 17
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :17 after 3.744e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9655071827474066412
[2022-06-08 20:42:31] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9655071827474066412
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/ltsmin9655071827474066412]
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/ltsmin9655071827474066412] 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/ltsmin9655071827474066412] 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)
Interrupted random walk after 460629 steps, including 21 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen :{0=1, 1=1, 3=1}
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1280 ms. (steps per millisecond=781 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1285 ms. (steps per millisecond=778 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1204 rows 158 cols
[2022-06-08 20:43:05] [INFO ] Computed 9 place invariants in 12 ms
[2022-06-08 20:43:05] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2022-06-08 20:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:43:05] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-06-08 20:43:06] [INFO ] State equation strengthened by 1118 read => feed constraints.
[2022-06-08 20:43:06] [INFO ] [Real]Added 1118 Read/Feed constraints in 353 ms returned sat
[2022-06-08 20:43:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:43:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-08 20:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:43:07] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2022-06-08 20:43:07] [INFO ] [Nat]Added 1118 Read/Feed constraints in 222 ms returned sat
[2022-06-08 20:43:08] [INFO ] Deduced a trap composed of 7 places in 890 ms of which 1 ms to minimize.
[2022-06-08 20:43:08] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 2 ms to minimize.
[2022-06-08 20:43:09] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 0 ms to minimize.
[2022-06-08 20:43:09] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 2 ms to minimize.
[2022-06-08 20:43:09] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2022-06-08 20:43:10] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2022-06-08 20:43:10] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2022-06-08 20:43:10] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2022-06-08 20:43:11] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2022-06-08 20:43:11] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 0 ms to minimize.
[2022-06-08 20:43:11] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2022-06-08 20:43:11] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2022-06-08 20:43:12] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-06-08 20:43:12] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2022-06-08 20:43:12] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2022-06-08 20:43:12] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2022-06-08 20:43:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 5359 ms
[2022-06-08 20:43:12] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-08 20:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:43:13] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2022-06-08 20:43:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:43:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-06-08 20:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:43:13] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-06-08 20:43:13] [INFO ] [Nat]Added 1118 Read/Feed constraints in 325 ms returned sat
[2022-06-08 20:43:14] [INFO ] Deduced a trap composed of 9 places in 477 ms of which 0 ms to minimize.
[2022-06-08 20:43:14] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 0 ms to minimize.
[2022-06-08 20:43:15] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 1 ms to minimize.
[2022-06-08 20:43:15] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 3 ms to minimize.
[2022-06-08 20:43:15] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2022-06-08 20:43:16] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2022-06-08 20:43:16] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2022-06-08 20:43:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 2580 ms
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1654720997492

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="StigmergyCommit-PT-08a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is StigmergyCommit-PT-08a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r305-smll-165463878400071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08a.tgz
mv StigmergyCommit-PT-08a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;