fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912645500462
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
340.100 16655.00 43016.00 406.80 TFTTFFFTFFTFFTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 9.5K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 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-06a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679349550857

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-20 21:59:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 21:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:59:14] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2023-03-20 21:59:14] [INFO ] Transformed 256 places.
[2023-03-20 21:59:14] [INFO ] Transformed 2816 transitions.
[2023-03-20 21:59:14] [INFO ] Found NUPN structural information;
[2023-03-20 21:59:14] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 21:59:15] [INFO ] Flatten gal took : 168 ms
[2023-03-20 21:59:15] [INFO ] Flatten gal took : 78 ms
[2023-03-20 21:59:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17243551293903242694.gal : 64 ms
[2023-03-20 21:59:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15052110513144416966.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17243551293903242694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15052110513144416966.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15052110513144416966.prop.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1199 ms. (steps per millisecond=8 ) properties (out of 14) seen :5
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :9 after 27
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :27 after 33
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :33 after 81
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :81 after 281
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :1
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 21:59:16] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2023-03-20 21:59:16] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-20 21:59:17] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Reachability property StigmergyCommit-PT-06a-ReachabilityCardinality-15 is true.
[2023-03-20 21:59:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-20 21:59:17] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-20 21:59:17] [INFO ] State equation strengthened by 351 read => feed constraints.
[2023-03-20 21:59:18] [INFO ] After 373ms SMT Verify possible using 351 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-20 21:59:18] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 5 ms to minimize.
[2023-03-20 21:59:18] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2023-03-20 21:59:19] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-03-20 21:59:19] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 2 ms to minimize.
Invariant property StigmergyCommit-PT-06a-ReachabilityCardinality-06 does not hold.
[2023-03-20 21:59:19] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2023-03-20 21:59:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1188 ms
[2023-03-20 21:59:19] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 994 ms
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-20 21:59:20] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
Reachability property StigmergyCommit-PT-06a-ReachabilityCardinality-02 is true.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :470597 after 1.05911e+06
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-20 21:59:21] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1424 ms
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
Invariant property StigmergyCommit-PT-06a-ReachabilityCardinality-08 does not hold.
[2023-03-20 21:59:22] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
[2023-03-20 21:59:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2023-03-20 21:59:22] [INFO ] After 4658ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-20 21:59:22] [INFO ] After 5659ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 51 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 587/587 transitions.
Graph (complete) has 549 edges and 256 vertex of which 250 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 250 transition count 535
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 43 rules applied. Total rules applied 90 place count 225 transition count 517
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 221 transition count 513
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 104 place count 217 transition count 511
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 104 place count 217 transition count 479
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 168 place count 185 transition count 479
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 197 place count 156 transition count 450
Iterating global reduction 4 with 29 rules applied. Total rules applied 226 place count 156 transition count 450
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 245 place count 137 transition count 431
Iterating global reduction 4 with 19 rules applied. Total rules applied 264 place count 137 transition count 431
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 274 place count 137 transition count 421
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 276 place count 135 transition count 419
Iterating global reduction 5 with 2 rules applied. Total rules applied 278 place count 135 transition count 419
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 279 place count 134 transition count 418
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 134 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 281 place count 134 transition count 417
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 293 place count 128 transition count 411
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 296 place count 125 transition count 408
Iterating global reduction 6 with 3 rules applied. Total rules applied 299 place count 125 transition count 408
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 312 place count 125 transition count 395
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 313 place count 125 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 314 place count 124 transition count 394
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 325 place count 124 transition count 383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 336 place count 113 transition count 383
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 341 place count 113 transition count 383
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 346 place count 113 transition count 378
Applied a total of 346 rules in 410 ms. Remains 113 /256 variables (removed 143) and now considering 378/587 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 113/256 places, 378/587 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 378 rows 113 cols
[2023-03-20 21:59:23] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-20 21:59:23] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:59:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-20 21:59:24] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:59:24] [INFO ] State equation strengthened by 315 read => feed constraints.
[2023-03-20 21:59:24] [INFO ] After 102ms SMT Verify possible using 315 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 21:59:24] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-20 21:59:24] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-20 21:59:24] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-20 21:59:24] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2023-03-20 21:59:24] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 6 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-20 21:59:25] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1696 ms
[2023-03-20 21:59:26] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-20 21:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-20 21:59:26] [INFO ] After 1923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-20 21:59:26] [INFO ] After 2173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 34 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 23 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 12053 ms.
Invariant property StigmergyCommit-PT-06a-ReachabilityCardinality-04 does not hold.
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1.05911e+06 after 1.05992e+06

BK_STOP 1679349567512

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-06a"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06a, 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 r453-smll-167912645500462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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