Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531600118.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531600118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 359K May 18 16:43 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-03b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-03b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716985266209

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 12:21:07] [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]
[2024-05-29 12:21:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:21:07] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-29 12:21:07] [INFO ] Transformed 1231 places.
[2024-05-29 12:21:07] [INFO ] Transformed 1476 transitions.
[2024-05-29 12:21:07] [INFO ] Found NUPN structural information;
[2024-05-29 12:21:07] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (517 resets) in 1434 ms. (27 steps per ms) remains 10/14 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (108 resets) in 284 ms. (140 steps per ms) remains 10/10 properties
[2024-05-29 12:21:08] [INFO ] Flatten gal took : 289 ms
BEST_FIRST walk for 40004 steps (109 resets) in 768 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (107 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
[2024-05-29 12:21:08] [INFO ] Flatten gal took : 151 ms
BEST_FIRST walk for 40004 steps (109 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (105 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
[2024-05-29 12:21:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8757840918095811275.gal : 77 ms
[2024-05-29 12:21:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2111465752110632013.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8757840918095811275.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2111465752110632013.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (106 resets) in 153 ms. (259 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (108 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (112 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (106 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality2111465752110632013.prop.
BEST_FIRST walk for 40002 steps (110 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
// Phase 1: matrix 1476 rows 1231 cols
[2024-05-29 12:21:08] [INFO ] Computed 5 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :11 after 16
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :19 after 22
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :22 after 99
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :99 after 119
At refinement iteration 2 (OVERLAPS) 1148/1212 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :119 after 176
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :176 after 5681
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 1148/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :5681 after 119571
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 19/1231 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1231 variables, 19/1236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1231 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Reachability property StigmergyCommit-PT-03b-ReachabilityCardinality-2024-12 is true.
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property StigmergyCommit-PT-03b-ReachabilityCardinality-2024-03 does not hold.
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :119571 after 165294
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :165294 after 197125
At refinement iteration 8 (OVERLAPS) 1476/2707 variables, 1231/2467 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2707 variables, 0/2467 constraints. Problems are: Problem set: 2 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :197125 after 4.08348e+06
At refinement iteration 10 (OVERLAPS) 0/2707 variables, 0/2467 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2707/2707 variables, and 2467 constraints, problems are : Problem set: 2 solved, 8 unsolved in 2236 ms.
Refiners :[Domain max(s): 1231/1231 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1231/1231 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1151/1212 variables, 4/65 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 1151/1216 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-29 12:21:11] [INFO ] Deduced a trap composed of 489 places in 451 ms of which 54 ms to minimize.
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 397 places in 289 ms of which 5 ms to minimize.
[2024-05-29 12:21:12] [INFO ] Deduced a trap composed of 396 places in 416 ms of which 16 ms to minimize.
[2024-05-29 12:21:13] [INFO ] Deduced a trap composed of 398 places in 323 ms of which 6 ms to minimize.
[2024-05-29 12:21:13] [INFO ] Deduced a trap composed of 396 places in 270 ms of which 5 ms to minimize.
[2024-05-29 12:21:13] [INFO ] Deduced a trap composed of 398 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:21:14] [INFO ] Deduced a trap composed of 398 places in 300 ms of which 6 ms to minimize.
[2024-05-29 12:21:14] [INFO ] Deduced a trap composed of 398 places in 248 ms of which 4 ms to minimize.
[2024-05-29 12:21:14] [INFO ] Deduced a trap composed of 398 places in 296 ms of which 6 ms to minimize.
[2024-05-29 12:21:15] [INFO ] Deduced a trap composed of 398 places in 293 ms of which 5 ms to minimize.
[2024-05-29 12:21:15] [INFO ] Deduced a trap composed of 396 places in 233 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 11/1227 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-29 12:21:15] [INFO ] Deduced a trap composed of 397 places in 287 ms of which 6 ms to minimize.
[2024-05-29 12:21:16] [INFO ] Deduced a trap composed of 396 places in 294 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/2707 variables, and 1229 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5016 ms.
Refiners :[Domain max(s): 1212/1231 constraints, Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/1231 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 13/13 constraints]
After SMT, in 7436ms problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1109 edges and 1231 vertex of which 76 / 1231 are part of one of the 12 SCC in 6 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 1656 edges and 1167 vertex of which 1159 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 783 transitions
Trivial Post-agglo rules discarded 783 transitions
Performed 783 trivial Post agglomeration. Transition count delta: 783
Iterating post reduction 0 with 787 rules applied. Total rules applied 789 place count 1159 transition count 604
Reduce places removed 783 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 796 rules applied. Total rules applied 1585 place count 376 transition count 591
Reduce places removed 6 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 51 rules applied. Total rules applied 1636 place count 370 transition count 546
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 1681 place count 325 transition count 546
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1681 place count 325 transition count 493
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1787 place count 272 transition count 493
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1820 place count 239 transition count 460
Iterating global reduction 4 with 33 rules applied. Total rules applied 1853 place count 239 transition count 460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1853 place count 239 transition count 459
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1855 place count 238 transition count 459
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1870 place count 223 transition count 322
Iterating global reduction 4 with 15 rules applied. Total rules applied 1885 place count 223 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1888 place count 223 transition count 319
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1890 place count 221 transition count 317
Iterating global reduction 5 with 2 rules applied. Total rules applied 1892 place count 221 transition count 317
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1894 place count 219 transition count 315
Iterating global reduction 5 with 2 rules applied. Total rules applied 1896 place count 219 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1898 place count 219 transition count 313
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1938 place count 199 transition count 293
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1939 place count 199 transition count 292
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1942 place count 196 transition count 289
Iterating global reduction 7 with 3 rules applied. Total rules applied 1945 place count 196 transition count 289
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1947 place count 194 transition count 287
Iterating global reduction 7 with 2 rules applied. Total rules applied 1949 place count 194 transition count 287
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1951 place count 192 transition count 285
Iterating global reduction 7 with 2 rules applied. Total rules applied 1953 place count 192 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1959 place count 189 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1961 place count 189 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1963 place count 189 transition count 282
Free-agglomeration rule applied 40 times.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2003 place count 189 transition count 242
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 2043 place count 149 transition count 242
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2045 place count 147 transition count 240
Iterating global reduction 9 with 2 rules applied. Total rules applied 2047 place count 147 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 2066 place count 147 transition count 221
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2068 place count 147 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2069 place count 147 transition count 220
Applied a total of 2069 rules in 198 ms. Remains 147 /1231 variables (removed 1084) and now considering 220/1476 (removed 1256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 147/1231 places, 220/1476 transitions.
RANDOM walk for 40000 steps (1231 resets) in 758 ms. (52 steps per ms) remains 5/8 properties
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (262 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (240 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (266 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (267 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (252 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
// Phase 1: matrix 220 rows 147 cols
[2024-05-29 12:21:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 12:21:16] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 12:21:17] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/147 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 220/367 variables, 147/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 70/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 223 constraints, problems are : Problem set: 0 solved, 5 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 147/147 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 12:21:17] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:21:17] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/147 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 220/367 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 70/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/367 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 230 constraints, problems are : Problem set: 0 solved, 5 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 147/147 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 1582 steps, including 129 resets, run visited all 1 properties in 3 ms. (steps per millisecond=527 )
FORMULA StigmergyCommit-PT-03b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 31 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 10500 ms.

BK_STOP 1716985277826

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-03b"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03b, 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 r400-tall-171690531600118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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