fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872600222
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyCommit-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2958.804 164116.00 208708.00 1554.10 TTTTTFTTTTFFTTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 7.8K May 30 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 30 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 30 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 30 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 13K May 30 15:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 30 15:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 30 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 30 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 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 155M 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-10a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654817879847

Running Version 202205111006
[2022-06-09 23:38:02] [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 23:38:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 23:38:10] [INFO ] Load time of PNML (sax parser for PT used): 7859 ms
[2022-06-09 23:38:11] [INFO ] Transformed 400 places.
[2022-06-09 23:38:11] [INFO ] Transformed 136960 transitions.
[2022-06-09 23:38:11] [INFO ] Found NUPN structural information;
[2022-06-09 23:38:11] [INFO ] Parsed PT model containing 400 places and 136960 transitions in 9271 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5092 ms. (steps per millisecond=1 ) properties (out of 16) seen :2
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2022-06-09 23:38:19] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2022-06-09 23:38:19] [INFO ] Computed 12 place invariants in 92 ms
[2022-06-09 23:38:20] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-09 23:38:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2022-06-09 23:38:24] [INFO ] After 3471ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :8
[2022-06-09 23:38:26] [INFO ] State equation strengthened by 4247 read => feed constraints.
[2022-06-09 23:38:29] [INFO ] After 3348ms SMT Verify possible using 4247 Read/Feed constraints in natural domain returned unsat :6 sat :8
[2022-06-09 23:38:33] [INFO ] Deduced a trap composed of 16 places in 3720 ms of which 11 ms to minimize.
[2022-06-09 23:38:36] [INFO ] Deduced a trap composed of 17 places in 2289 ms of which 2 ms to minimize.
[2022-06-09 23:38:38] [INFO ] Deduced a trap composed of 17 places in 2050 ms of which 2 ms to minimize.
[2022-06-09 23:38:40] [INFO ] Deduced a trap composed of 17 places in 1848 ms of which 2 ms to minimize.
[2022-06-09 23:38:42] [INFO ] Deduced a trap composed of 17 places in 1706 ms of which 2 ms to minimize.
[2022-06-09 23:38:44] [INFO ] Deduced a trap composed of 17 places in 2128 ms of which 2 ms to minimize.
[2022-06-09 23:38:46] [INFO ] Deduced a trap composed of 17 places in 2149 ms of which 2 ms to minimize.
[2022-06-09 23:38:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-09 23:38:46] [INFO ] After 25935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 4185 ms.
Support contains 76 out of 400 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Graph (complete) has 993 edges and 400 vertex of which 389 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.80 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 389 transition count 4531
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 71 rules applied. Total rules applied 145 place count 348 transition count 4501
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 14 rules applied. Total rules applied 159 place count 343 transition count 4492
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 173 place count 334 transition count 4487
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 173 place count 334 transition count 4441
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 265 place count 288 transition count 4441
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 307 place count 246 transition count 4399
Iterating global reduction 4 with 42 rules applied. Total rules applied 349 place count 246 transition count 4399
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 384 place count 211 transition count 4364
Iterating global reduction 4 with 35 rules applied. Total rules applied 419 place count 211 transition count 4364
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 211 transition count 4355
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 431 place count 208 transition count 4352
Iterating global reduction 5 with 3 rules applied. Total rules applied 434 place count 208 transition count 4352
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 462 place count 194 transition count 4338
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 468 place count 194 transition count 4332
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 475 place count 187 transition count 4325
Iterating global reduction 6 with 7 rules applied. Total rules applied 482 place count 187 transition count 4325
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 486 place count 183 transition count 4321
Iterating global reduction 6 with 4 rules applied. Total rules applied 490 place count 183 transition count 4321
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 504 place count 183 transition count 4307
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 513 place count 183 transition count 4298
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 522 place count 174 transition count 4298
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 524 place count 174 transition count 4296
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 530 place count 174 transition count 4296
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 536 place count 174 transition count 4290
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 537 place count 174 transition count 4290
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 538 place count 174 transition count 4289
Applied a total of 538 rules in 25575 ms. Remains 174 /400 variables (removed 226) and now considering 4289/4615 (removed 326) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/400 places, 4289/4615 transitions.
Interrupted random walk after 60166 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=2 ) properties seen 3
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2814 ms. (steps per millisecond=355 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3908 ms. (steps per millisecond=255 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1894 ms. (steps per millisecond=527 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4289 rows 174 cols
[2022-06-09 23:39:58] [INFO ] Computed 10 place invariants in 29 ms
[2022-06-09 23:39:59] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 23:39:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 23:40:01] [INFO ] After 1981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 23:40:02] [INFO ] State equation strengthened by 4193 read => feed constraints.
[2022-06-09 23:40:03] [INFO ] After 1503ms SMT Verify possible using 4193 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-09 23:40:06] [INFO ] Deduced a trap composed of 6 places in 3140 ms of which 2 ms to minimize.
[2022-06-09 23:40:10] [INFO ] Deduced a trap composed of 11 places in 3031 ms of which 1 ms to minimize.
[2022-06-09 23:40:12] [INFO ] Deduced a trap composed of 7 places in 2555 ms of which 1 ms to minimize.
[2022-06-09 23:40:15] [INFO ] Deduced a trap composed of 9 places in 2266 ms of which 1 ms to minimize.
[2022-06-09 23:40:17] [INFO ] Deduced a trap composed of 8 places in 1836 ms of which 1 ms to minimize.
[2022-06-09 23:40:19] [INFO ] Deduced a trap composed of 6 places in 1571 ms of which 1 ms to minimize.
[2022-06-09 23:40:20] [INFO ] Deduced a trap composed of 9 places in 1615 ms of which 1 ms to minimize.
[2022-06-09 23:40:23] [INFO ] Deduced a trap composed of 11 places in 2026 ms of which 1 ms to minimize.
[2022-06-09 23:40:25] [INFO ] Deduced a trap composed of 12 places in 1946 ms of which 1 ms to minimize.
[2022-06-09 23:40:27] [INFO ] Deduced a trap composed of 13 places in 1936 ms of which 2 ms to minimize.
[2022-06-09 23:40:29] [INFO ] Deduced a trap composed of 13 places in 1653 ms of which 1 ms to minimize.
[2022-06-09 23:40:30] [INFO ] Deduced a trap composed of 10 places in 1380 ms of which 1 ms to minimize.
[2022-06-09 23:40:32] [INFO ] Deduced a trap composed of 11 places in 1351 ms of which 1 ms to minimize.
[2022-06-09 23:40:33] [INFO ] Deduced a trap composed of 11 places in 1069 ms of which 1 ms to minimize.
[2022-06-09 23:40:34] [INFO ] Deduced a trap composed of 12 places in 866 ms of which 1 ms to minimize.
[2022-06-09 23:40:35] [INFO ] Deduced a trap composed of 8 places in 854 ms of which 0 ms to minimize.
[2022-06-09 23:40:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 31955 ms
[2022-06-09 23:40:37] [INFO ] Deduced a trap composed of 12 places in 1331 ms of which 1 ms to minimize.
[2022-06-09 23:40:38] [INFO ] Deduced a trap composed of 9 places in 1078 ms of which 1 ms to minimize.
[2022-06-09 23:40:39] [INFO ] Deduced a trap composed of 11 places in 923 ms of which 1 ms to minimize.
[2022-06-09 23:40:40] [INFO ] Deduced a trap composed of 11 places in 679 ms of which 1 ms to minimize.
[2022-06-09 23:40:41] [INFO ] Deduced a trap composed of 11 places in 450 ms of which 0 ms to minimize.
[2022-06-09 23:40:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5602 ms
[2022-06-09 23:40:42] [INFO ] Deduced a trap composed of 7 places in 736 ms of which 1 ms to minimize.
[2022-06-09 23:40:43] [INFO ] Deduced a trap composed of 8 places in 483 ms of which 1 ms to minimize.
[2022-06-09 23:40:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1781 ms
[2022-06-09 23:40:43] [INFO ] After 41316ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 397 ms.
[2022-06-09 23:40:43] [INFO ] After 44782ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 109 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=5 )
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 21 ms.
All properties solved without resorting to model-checking.
Total runtime 161306 ms.

BK_STOP 1654818043963

--------------------
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-10a"
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-10a, 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-165463872600222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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