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.r294-smll-165463872500174.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 itstools
Input is StigmergyCommit-PT-07a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 6.0K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 5.4M 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-07a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654791503744

Running Version 202205111006
[2022-06-09 16:18:26] [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-09 16:18:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 16:18:27] [INFO ] Load time of PNML (sax parser for PT used): 935 ms
[2022-06-09 16:18:27] [INFO ] Transformed 292 places.
[2022-06-09 16:18:27] [INFO ] Transformed 7108 transitions.
[2022-06-09 16:18:27] [INFO ] Found NUPN structural information;
[2022-06-09 16:18:27] [INFO ] Parsed PT model containing 292 places and 7108 transitions in 1256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1471 ms. (steps per millisecond=6 ) properties (out of 14) seen :4
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-09 16:18:29] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2022-06-09 16:18:29] [INFO ] Computed 9 place invariants in 40 ms
[2022-06-09 16:18:30] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-09 16:18:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2022-06-09 16:18:31] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2022-06-09 16:18:31] [INFO ] State equation strengthened by 621 read => feed constraints.
[2022-06-09 16:18:32] [INFO ] After 852ms SMT Verify possible using 621 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2022-06-09 16:18:33] [INFO ] Deduced a trap composed of 17 places in 666 ms of which 12 ms to minimize.
[2022-06-09 16:18:33] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 1 ms to minimize.
[2022-06-09 16:18:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1205 ms
[2022-06-09 16:18:34] [INFO ] Deduced a trap composed of 18 places in 606 ms of which 2 ms to minimize.
[2022-06-09 16:18:34] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 2 ms to minimize.
[2022-06-09 16:18:35] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 2 ms to minimize.
[2022-06-09 16:18:35] [INFO ] Deduced a trap composed of 16 places in 411 ms of which 1 ms to minimize.
[2022-06-09 16:18:36] [INFO ] Deduced a trap composed of 17 places in 393 ms of which 1 ms to minimize.
[2022-06-09 16:18:36] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 2 ms to minimize.
[2022-06-09 16:18:36] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2022-06-09 16:18:37] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
[2022-06-09 16:18:37] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2022-06-09 16:18:37] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 1 ms to minimize.
[2022-06-09 16:18:38] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 0 ms to minimize.
[2022-06-09 16:18:38] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2022-06-09 16:18:38] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2022-06-09 16:18:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 4862 ms
[2022-06-09 16:18:39] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 1 ms to minimize.
[2022-06-09 16:18:39] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2022-06-09 16:18:39] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2022-06-09 16:18:39] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2022-06-09 16:18:40] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2022-06-09 16:18:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1250 ms
[2022-06-09 16:18:40] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 1 ms to minimize.
[2022-06-09 16:18:40] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 1 ms to minimize.
[2022-06-09 16:18:41] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 1 ms to minimize.
[2022-06-09 16:18:41] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 0 ms to minimize.
[2022-06-09 16:18:42] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2022-06-09 16:18:42] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 2 ms to minimize.
[2022-06-09 16:18:42] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2022-06-09 16:18:42] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 0 ms to minimize.
[2022-06-09 16:18:43] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2022-06-09 16:18:43] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2022-06-09 16:18:43] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2022-06-09 16:18:43] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2022-06-09 16:18:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 3787 ms
[2022-06-09 16:18:44] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2022-06-09 16:18:44] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2022-06-09 16:18:44] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-06-09 16:18:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 610 ms
[2022-06-09 16:18:44] [INFO ] After 13032ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-06-09 16:18:44] [INFO ] After 14271ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.14 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 284 transition count 815
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 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 1 with 78 rules applied. Total rules applied 146 place count 241 transition count 780
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 12 rules applied. Total rules applied 158 place count 234 transition count 775
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 166 place count 229 transition count 772
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 166 place count 229 transition count 719
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 272 place count 176 transition count 719
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 310 place count 138 transition count 681
Iterating global reduction 4 with 38 rules applied. Total rules applied 348 place count 138 transition count 681
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 386 place count 100 transition count 643
Iterating global reduction 4 with 38 rules applied. Total rules applied 424 place count 100 transition count 643
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Iterating post reduction 4 with 135 rules applied. Total rules applied 559 place count 100 transition count 508
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 565 place count 94 transition count 502
Iterating global reduction 5 with 6 rules applied. Total rules applied 571 place count 94 transition count 502
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 577 place count 88 transition count 496
Iterating global reduction 5 with 6 rules applied. Total rules applied 583 place count 88 transition count 496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 589 place count 88 transition count 490
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 617 place count 74 transition count 476
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 629 place count 74 transition count 464
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 636 place count 67 transition count 457
Iterating global reduction 7 with 7 rules applied. Total rules applied 643 place count 67 transition count 457
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 650 place count 60 transition count 450
Iterating global reduction 7 with 7 rules applied. Total rules applied 657 place count 60 transition count 450
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 662 place count 55 transition count 445
Iterating global reduction 7 with 5 rules applied. Total rules applied 667 place count 55 transition count 445
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 670 place count 55 transition count 442
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 671 place count 55 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 672 place count 54 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 673 place count 54 transition count 441
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 674 place count 54 transition count 440
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 675 place count 53 transition count 439
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 9 rules applied. Total rules applied 684 place count 52 transition count 431
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 692 place count 44 transition count 431
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 692 place count 44 transition count 427
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 700 place count 40 transition count 427
Performed 12 Post agglomeration using F-continuation condition with reduction of 365 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 724 place count 28 transition count 50
Drop transitions removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 742 place count 28 transition count 32
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 755 place count 20 transition count 27
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 760 place count 20 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 761 place count 20 transition count 21
Applied a total of 761 rules in 561 ms. Remains 20 /292 variables (removed 272) and now considering 21/890 (removed 869) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/292 places, 21/890 transitions.
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 19162 ms.

BK_STOP 1654791525559

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-07a"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-07a, 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 r294-smll-165463872500174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07a.tgz
mv StigmergyCommit-PT-07a 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 ;