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-165463872600190.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-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872600190
=====================================================================

--------------------
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 1654799188165

Running Version 202205111006
[2022-06-09 18:26:30] [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 18:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 18:26:31] [INFO ] Load time of PNML (sax parser for PT used): 1578 ms
[2022-06-09 18:26:31] [INFO ] Transformed 328 places.
[2022-06-09 18:26:31] [INFO ] Transformed 18744 transitions.
[2022-06-09 18:26:31] [INFO ] Found NUPN structural information;
[2022-06-09 18:26:31] [INFO ] Parsed PT model containing 328 places and 18744 transitions in 1906 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 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 1202 ms. (steps per millisecond=8 ) properties (out of 12) seen :1
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :1
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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
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
Running SMT prover for 10 properties.
[2022-06-09 18:26:34] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2022-06-09 18:26:34] [INFO ] Computed 10 place invariants in 43 ms
[2022-06-09 18:26:35] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-09 18:26:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 27 ms returned sat
[2022-06-09 18:26:37] [INFO ] After 2119ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2022-06-09 18:26:37] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2022-06-09 18:26:40] [INFO ] After 2686ms SMT Verify possible using 1147 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2022-06-09 18:26:41] [INFO ] Deduced a trap composed of 17 places in 882 ms of which 11 ms to minimize.
[2022-06-09 18:26:43] [INFO ] Deduced a trap composed of 16 places in 1227 ms of which 2 ms to minimize.
[2022-06-09 18:26:44] [INFO ] Deduced a trap composed of 18 places in 1068 ms of which 2 ms to minimize.
[2022-06-09 18:26:45] [INFO ] Deduced a trap composed of 16 places in 970 ms of which 2 ms to minimize.
[2022-06-09 18:26:46] [INFO ] Deduced a trap composed of 17 places in 1021 ms of which 2 ms to minimize.
[2022-06-09 18:26:46] [INFO ] Deduced a trap composed of 18 places in 443 ms of which 1 ms to minimize.
[2022-06-09 18:26:47] [INFO ] Deduced a trap composed of 17 places in 458 ms of which 1 ms to minimize.
[2022-06-09 18:26:47] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 0 ms to minimize.
[2022-06-09 18:26:48] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 2 ms to minimize.
[2022-06-09 18:26:48] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 1 ms to minimize.
[2022-06-09 18:26:49] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 0 ms to minimize.
[2022-06-09 18:26:49] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2022-06-09 18:26:50] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2022-06-09 18:26:50] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 0 ms to minimize.
[2022-06-09 18:26:50] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 0 ms to minimize.
[2022-06-09 18:26:51] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2022-06-09 18:26:51] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2022-06-09 18:26:51] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-09 18:26:51] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 11155 ms
[2022-06-09 18:26:52] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2022-06-09 18:26:52] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2022-06-09 18:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2022-06-09 18:26:53] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 1 ms to minimize.
[2022-06-09 18:26:54] [INFO ] Deduced a trap composed of 16 places in 533 ms of which 2 ms to minimize.
[2022-06-09 18:26:54] [INFO ] Deduced a trap composed of 16 places in 516 ms of which 1 ms to minimize.
[2022-06-09 18:26:55] [INFO ] Deduced a trap composed of 17 places in 410 ms of which 1 ms to minimize.
[2022-06-09 18:26:55] [INFO ] Deduced a trap composed of 16 places in 534 ms of which 1 ms to minimize.
[2022-06-09 18:26:56] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2022-06-09 18:26:56] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 0 ms to minimize.
[2022-06-09 18:26:56] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2022-06-09 18:26:57] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2022-06-09 18:26:57] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2022-06-09 18:26:57] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-06-09 18:26:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4630 ms
[2022-06-09 18:26:58] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 1 ms to minimize.
[2022-06-09 18:26:58] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 0 ms to minimize.
[2022-06-09 18:26:58] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 2 ms to minimize.
[2022-06-09 18:26:59] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 4 ms to minimize.
[2022-06-09 18:26:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1360 ms
[2022-06-09 18:26:59] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 1 ms to minimize.
[2022-06-09 18:26:59] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 0 ms to minimize.
[2022-06-09 18:27:00] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2022-06-09 18:27:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-09 18:27:00] [INFO ] After 25233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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 5 different solutions.
Parikh walk visited 0 properties in 2462 ms.
Support contains 65 out of 328 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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.27 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 321 transition count 1382
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 56 rules applied. Total rules applied 117 place count 288 transition count 1359
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 14 rules applied. Total rules applied 131 place count 284 transition count 1349
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 147 place count 274 transition count 1343
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 147 place count 274 transition count 1304
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 225 place count 235 transition count 1304
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 257 place count 203 transition count 1272
Iterating global reduction 4 with 32 rules applied. Total rules applied 289 place count 203 transition count 1272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 290 place count 203 transition count 1271
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 312 place count 181 transition count 1249
Iterating global reduction 5 with 22 rules applied. Total rules applied 334 place count 181 transition count 1249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 340 place count 181 transition count 1243
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 342 place count 179 transition count 1241
Iterating global reduction 6 with 2 rules applied. Total rules applied 344 place count 179 transition count 1241
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 345 place count 178 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 178 transition count 1240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 347 place count 178 transition count 1239
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 367 place count 168 transition count 1229
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 371 place count 168 transition count 1225
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 377 place count 162 transition count 1219
Iterating global reduction 8 with 6 rules applied. Total rules applied 383 place count 162 transition count 1219
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 386 place count 159 transition count 1216
Iterating global reduction 8 with 3 rules applied. Total rules applied 389 place count 159 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 391 place count 157 transition count 1214
Iterating global reduction 8 with 2 rules applied. Total rules applied 393 place count 157 transition count 1214
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 403 place count 157 transition count 1204
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 8 with 2 rules applied. Total rules applied 405 place count 156 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 406 place count 155 transition count 1202
Iterating global reduction 8 with 1 rules applied. Total rules applied 407 place count 155 transition count 1202
Free-agglomeration rule applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 420 place count 155 transition count 1189
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 433 place count 142 transition count 1189
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 435 place count 142 transition count 1187
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 441 place count 142 transition count 1187
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 446 place count 142 transition count 1182
Applied a total of 446 rules in 2479 ms. Remains 142 /328 variables (removed 186) and now considering 1182/1449 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/328 places, 1182/1449 transitions.
Interrupted random walk after 457931 steps, including 40 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 4
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
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1182 rows 142 cols
[2022-06-09 18:27:36] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-09 18:27:36] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 18:27:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-09 18:27:36] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 18:27:36] [INFO ] State equation strengthened by 1106 read => feed constraints.
[2022-06-09 18:27:37] [INFO ] After 264ms SMT Verify possible using 1106 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 18:27:37] [INFO ] Deduced a trap composed of 10 places in 478 ms of which 1 ms to minimize.
[2022-06-09 18:27:38] [INFO ] Deduced a trap composed of 7 places in 462 ms of which 0 ms to minimize.
[2022-06-09 18:27:38] [INFO ] Deduced a trap composed of 9 places in 406 ms of which 0 ms to minimize.
[2022-06-09 18:27:39] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 1 ms to minimize.
[2022-06-09 18:27:39] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 1 ms to minimize.
[2022-06-09 18:27:40] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 1 ms to minimize.
[2022-06-09 18:27:40] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2022-06-09 18:27:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 3186 ms
[2022-06-09 18:27:40] [INFO ] After 3506ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 18:27:40] [INFO ] After 3984ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA StigmergyCommit-PT-08a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 70479 ms.

BK_STOP 1654799260582

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-08a"
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-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 r294-smll-165463872600190"
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 ;