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.r092-tall-171624189800711.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 DES-PT-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800711
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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 DES-PT-30b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716352548219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 04:35:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:35:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:35:49] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 04:35:49] [INFO ] Transformed 399 places.
[2024-05-22 04:35:49] [INFO ] Transformed 350 transitions.
[2024-05-22 04:35:49] [INFO ] Found NUPN structural information;
[2024-05-22 04:35:49] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 04:35:50] [INFO ] Flatten gal took : 173 ms
[2024-05-22 04:35:50] [INFO ] Flatten gal took : 50 ms
RANDOM walk for 40000 steps (332 resets) in 1787 ms. (22 steps per ms) remains 6/16 properties
FORMULA DES-PT-30b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 04:35:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14630180273523914552.gal : 51 ms
BEST_FIRST walk for 40004 steps (42 resets) in 438 ms. (91 steps per ms) remains 6/6 properties
[2024-05-22 04:35:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12788023152609639665.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14630180273523914552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12788023152609639665.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12788023152609639665.prop.
BEST_FIRST walk for 40002 steps (48 resets) in 963 ms. (41 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 37
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :37 after 49
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :49 after 211
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :211 after 1116
BEST_FIRST walk for 40003 steps (46 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1116 after 25170
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :25170 after 753955
BEST_FIRST walk for 40003 steps (50 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
// Phase 1: matrix 350 rows 399 cols
[2024-05-22 04:35:50] [INFO ] Computed 65 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem DES-PT-30b-ReachabilityFireability-2024-08 is UNSAT
FORMULA DES-PT-30b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem DES-PT-30b-ReachabilityFireability-2024-10 is UNSAT
FORMULA DES-PT-30b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 205/349 variables, 38/183 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 205/388 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/352 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/392 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/392 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 46/398 variables, 24/416 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 46/462 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/462 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/399 variables, 1/463 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 1/464 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/464 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 350/749 variables, 399/863 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/749 variables, 0/863 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/749 variables, 0/863 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 863 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2860 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/95 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem DES-PT-30b-ReachabilityFireability-2024-00 is UNSAT
FORMULA DES-PT-30b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 234/328 variables, 36/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 234/365 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/365 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/339 variables, 3/368 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 11/379 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/379 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 59/398 variables, 24/403 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 59/462 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 04:35:54] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 20 ms to minimize.
[2024-05-22 04:35:54] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-22 04:35:54] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:35:55] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 04:35:55] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 5/467 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/467 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/399 variables, 1/468 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 1/469 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 04:35:55] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/399 variables, 1/470 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :753955 after 2.30969e+07
At refinement iteration 16 (INCLUDED_ONLY) 0/399 variables, 0/470 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 350/749 variables, 399/869 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/749 variables, 3/872 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 04:35:58] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 3 ms to minimize.
[2024-05-22 04:35:58] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 874 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5007 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 8056ms problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 389 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 389 transition count 332
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 376 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 375 transition count 331
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 30 place count 375 transition count 325
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 42 place count 369 transition count 325
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 58 place count 353 transition count 309
Iterating global reduction 3 with 16 rules applied. Total rules applied 74 place count 353 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 353 transition count 308
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 352 transition count 308
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 343 transition count 299
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 343 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 103 place count 343 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 342 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 104 place count 342 transition count 289
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 341 transition count 289
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 224 place count 282 transition count 230
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 280 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 280 transition count 230
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 280 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 233 place count 278 transition count 228
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 278 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 277 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 276 transition count 227
Applied a total of 236 rules in 239 ms. Remains 276 /399 variables (removed 123) and now considering 227/350 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 276/399 places, 227/350 transitions.
RANDOM walk for 40000 steps (915 resets) in 646 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (164 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (144 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (201 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1022958 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 3
Probabilistic random walk after 1022958 steps, saw 166645 distinct states, run finished after 3004 ms. (steps per millisecond=340 ) properties seen :0
// Phase 1: matrix 227 rows 276 cols
[2024-05-22 04:36:02] [INFO ] Computed 59 invariants in 12 ms
[2024-05-22 04:36:02] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 77/130 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/144 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 100/244 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/247 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 227/474 variables, 247/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/503 variables, 29/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 337 constraints, problems are : Problem set: 0 solved, 3 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/276 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 77/130 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/144 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 100/244 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:03] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/247 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 227/474 variables, 247/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 29/503 variables, 29/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-05-22 04:36:05] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:36:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-22 04:36:05] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 3 ms to minimize.
[2024-05-22 04:36:06] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-22 04:36:06] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/503 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:07] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:09] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/503 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/503 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 04:36:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/503 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/503 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/503 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 355 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9297 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/276 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 15/15 constraints]
After SMT, in 9999ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3358 ms.
Support contains 53 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 227/227 transitions.
Applied a total of 0 rules in 10 ms. Remains 276 /276 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 276/276 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 227/227 transitions.
Applied a total of 0 rules in 10 ms. Remains 276 /276 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-05-22 04:36:16] [INFO ] Invariant cache hit.
[2024-05-22 04:36:16] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 04:36:16] [INFO ] Invariant cache hit.
[2024-05-22 04:36:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:36:16] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-22 04:36:16] [INFO ] Redundant transitions in 8 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-22 04:36:16] [INFO ] Invariant cache hit.
[2024-05-22 04:36:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 3/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 227/503 variables, 276/335 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 04:36:24] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 04:36:24] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.30969e+07 after 1.91391e+08
At refinement iteration 10 (OVERLAPS) 0/503 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 339 constraints, problems are : Problem set: 0 solved, 224 unsolved in 13327 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/276 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 3/276 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 227/503 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 224/563 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 04:36:40] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:36:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:36:41] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-22 04:36:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-22 04:36:44] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:36:45] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:36:45] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-22 04:36:45] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 04:36:50] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 9/572 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 572 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/276 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 11/11 constraints]
After SMT, in 43457ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 43461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43892 ms. Remains : 276/276 places, 227/227 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-22 04:36:59] [INFO ] Invariant cache hit.
[2024-05-22 04:36:59] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 04:37:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 04:37:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-22 04:37:00] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 04:37:00] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 04:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
TRAPS : Iteration 1
[2024-05-22 04:37:00] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-22 04:37:00] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-22 04:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-22 04:37:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:37:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:37:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-05-22 04:37:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
TRAPS : Iteration 2
[2024-05-22 04:37:01] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:37:01] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 04:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2024-05-22 04:37:01] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 04:37:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 3
[2024-05-22 04:37:02] [INFO ] After 1921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 04:37:02] [INFO ] After 2272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-22 04:37:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 04:37:02] [INFO ] Flatten gal took : 18 ms
[2024-05-22 04:37:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18027403439413158910.gal : 4 ms
[2024-05-22 04:37:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7817567559455452955.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/ReachabilityCardinality18027403439413158910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7817567559455452955.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7817567559455452955.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 27
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :27 after 52
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :52 after 127
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :127 after 1856
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1856 after 34938
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :34938 after 64857
Detected timeout of ITS tools.
[2024-05-22 04:37:17] [INFO ] Flatten gal took : 19 ms
[2024-05-22 04:37:17] [INFO ] Applying decomposition
[2024-05-22 04:37:17] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18406362769386747831.txt' '-o' '/tmp/graph18406362769386747831.bin' '-w' '/tmp/graph18406362769386747831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18406362769386747831.bin' '-l' '-1' '-v' '-w' '/tmp/graph18406362769386747831.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:37:17] [INFO ] Decomposing Gal with order
[2024-05-22 04:37:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:37:17] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 04:37:17] [INFO ] Flatten gal took : 48 ms
[2024-05-22 04:37:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 9 ms.
[2024-05-22 04:37:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12793609649705658858.gal : 5 ms
[2024-05-22 04:37:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13003553487324342710.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/ReachabilityCardinality12793609649705658858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13003553487324342710.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality13003553487324342710.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 2131
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :11523 after 2.556e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :8.32752e+07 after 4.86665e+10
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4.86665e+10 after 1.00053e+11
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.00053e+11 after 1.68567e+11
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.68567e+11 after 2.54265e+11
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.54265e+11 after 4.4268e+11
Reachability property DES-PT-30b-ReachabilityFireability-2024-13 is true.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32767 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 04:37:32] [INFO ] Flatten gal took : 18 ms
[2024-05-22 04:37:32] [INFO ] Applying decomposition
[2024-05-22 04:37:32] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4605066056031527442.txt' '-o' '/tmp/graph4605066056031527442.bin' '-w' '/tmp/graph4605066056031527442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4605066056031527442.bin' '-l' '-1' '-v' '-w' '/tmp/graph4605066056031527442.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:37:32] [INFO ] Decomposing Gal with order
[2024-05-22 04:37:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:37:32] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-22 04:37:32] [INFO ] Flatten gal took : 30 ms
[2024-05-22 04:37:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-22 04:37:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5761300987636418182.gal : 5 ms
[2024-05-22 04:37:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11346812264286462242.prop : 0 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/ReachabilityCardinality5761300987636418182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11346812264286462242.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality11346812264286462242.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :13 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 1099
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1099 after 3.55456e+06
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3.55456e+06 after 2.84447e+07
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6.85946e+07 after 4.36962e+15
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4.36962e+15 after 5.81199e+17
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5.81199e+17 after 1.02913e+18
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.02913e+18 after 1.58884e+18
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.58884e+18 after 2.70825e+18
Reachability property DES-PT-30b-ReachabilityFireability-2024-13 is true.
FORMULA DES-PT-30b-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-30b-ReachabilityFireability-2024-05 is true.
FORMULA DES-PT-30b-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.05885e+21 after 9.16948e+21
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.96792e+22,8.46717,157564,12945,2430,326759,23831,811,548867,353,118895,0
Total reachable state count : 19679194767205820526592

Verifying 3 reachability properties.
Reachability property DES-PT-30b-ReachabilityFireability-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityFireability-2024-05,3.18505e+08,8.52095,157824,173,141,326759,23831,948,548867,377,118895,16514
Reachability property DES-PT-30b-ReachabilityFireability-2024-06 is true.
FORMULA DES-PT-30b-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityFireability-2024-06,1.22099e+12,8.56364,157824,209,229,326759,23831,1043,548867,396,118895,26406
Reachability property DES-PT-30b-ReachabilityFireability-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityFireability-2024-13,2.4553e+14,8.56472,157824,603,182,326759,23831,1049,548867,400,118895,26406
All properties solved without resorting to model-checking.
Total runtime 112169 ms.

BK_STOP 1716352661501

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityFireability"
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 DES-PT-30b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189800711"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;