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.r356-tall-171683760700254.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 ShieldIIPt-PT-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760700254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 83K 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 ShieldIIPt-PT-005B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716930169235

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 21:02:50] [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-28 21:02:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:02:50] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-28 21:02:50] [INFO ] Transformed 353 places.
[2024-05-28 21:02:50] [INFO ] Transformed 328 transitions.
[2024-05-28 21:02:50] [INFO ] Found NUPN structural information;
[2024-05-28 21:02:50] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1211 ms. (33 steps per ms) remains 1/13 properties
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 21:02:51] [INFO ] Flatten gal took : 135 ms
[2024-05-28 21:02:51] [INFO ] Flatten gal took : 38 ms
[2024-05-28 21:02:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2462889779685900303.gal : 26 ms
BEST_FIRST walk for 40004 steps (8 resets) in 684 ms. (58 steps per ms) remains 1/1 properties
[2024-05-28 21:02:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16760655418922924959.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/ReachabilityCardinality2462889779685900303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16760655418922924959.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/ReachabilityCardinality16760655418922924959.prop.
// Phase 1: matrix 328 rows 353 cols
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 77
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :77 after 1672
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1672 after 1.38945e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.38945e+06 after 2.19908e+10
[2024-05-28 21:02:51] [INFO ] Computed 46 invariants in 32 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.79223e+14 after 1.1441e+15
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 302/341 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 302/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/353 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 12/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 328/681 variables, 353/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/681 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 302/341 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 302/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:02:51] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 8 ms to minimize.
[2024-05-28 21:02:52] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-28 21:02:52] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-28 21:02:52] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/353 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 12/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 328/681 variables, 353/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:02:52] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 2 ms to minimize.
[2024-05-28 21:02:53] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 2 ms to minimize.
[2024-05-28 21:02:53] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/681 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 760 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1711 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 39 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 328/328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 353 transition count 266
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 64 rules applied. Total rules applied 126 place count 291 transition count 264
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 138 place count 290 transition count 253
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 149 place count 279 transition count 253
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 149 place count 279 transition count 231
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 193 place count 257 transition count 231
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 218 place count 232 transition count 206
Iterating global reduction 4 with 25 rules applied. Total rules applied 243 place count 232 transition count 206
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 243 place count 232 transition count 194
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 267 place count 220 transition count 194
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 395 place count 156 transition count 130
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 411 place count 148 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 412 place count 148 transition count 133
Applied a total of 412 rules in 101 ms. Remains 148 /353 variables (removed 205) and now considering 133/328 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 148/353 places, 133/328 transitions.
RANDOM walk for 40000 steps (8 resets) in 525 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1286428 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 1286428 steps, saw 880563 distinct states, run finished after 3013 ms. (steps per millisecond=426 ) properties seen :0
// Phase 1: matrix 133 rows 148 cols
[2024-05-28 21:02:57] [INFO ] Computed 46 invariants in 6 ms
[2024-05-28 21:02:57] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/146 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/148 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 133/281 variables, 148/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 23/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 148/148 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/146 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:02:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:02:57] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:02:57] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:02:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/148 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 133/281 variables, 148/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 23/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 148/148 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 39 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 148/148 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 133/133 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-28 21:02:57] [INFO ] Invariant cache hit.
[2024-05-28 21:02:57] [INFO ] Implicit Places using invariants in 98 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 147/148 places, 133/133 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 147 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 132
Applied a total of 2 rules in 22 ms. Remains 146 /147 variables (removed 1) and now considering 132/133 (removed 1) transitions.
// Phase 1: matrix 132 rows 146 cols
[2024-05-28 21:02:57] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:02:57] [INFO ] Implicit Places using invariants in 91 ms returned [128]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 145/148 places, 132/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 240 ms. Remains : 145/148 places, 132/133 transitions.
RANDOM walk for 40000 steps (8 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1451546 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 1
Probabilistic random walk after 1451546 steps, saw 998048 distinct states, run finished after 3001 ms. (steps per millisecond=483 ) properties seen :0
// Phase 1: matrix 132 rows 145 cols
[2024-05-28 21:03:01] [INFO ] Computed 44 invariants in 2 ms
[2024-05-28 21:03:01] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/143 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/145 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/277 variables, 145/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 21/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 145/145 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/143 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/145 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 132/277 variables, 145/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 21/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:03:01] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 145/145 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 841ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 39 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 132/132 transitions.
Applied a total of 0 rules in 12 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 145/145 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 132/132 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 21:03:02] [INFO ] Invariant cache hit.
[2024-05-28 21:03:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 21:03:02] [INFO ] Invariant cache hit.
[2024-05-28 21:03:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 21:03:02] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-28 21:03:02] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 21:03:02] [INFO ] Invariant cache hit.
[2024-05-28 21:03:02] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 21:03:02] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 2 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 4 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-28 21:03:03] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/277 variables, 145/208 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 21/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 21:03:05] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 230 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5704 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 145/145 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/277 variables, 145/209 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 21/230 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 131/361 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:03:10] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:03:10] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 368 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6533 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 145/145 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 27/27 constraints]
After SMT, in 12270ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 12277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12520 ms. Remains : 145/145 places, 132/132 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 329 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 10 place count 144 transition count 132
Applied a total of 10 rules in 16 ms. Remains 144 /145 variables (removed 1) and now considering 132/132 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 132 rows 144 cols
[2024-05-28 21:03:14] [INFO ] Computed 43 invariants in 3 ms
[2024-05-28 21:03:14] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:03:14] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2024-05-28 21:03:14] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:03:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-28 21:03:14] [INFO ] After 38ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 21:03:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
[2024-05-28 21:03:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:03:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:03:14] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-28 21:03:14] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 21:03:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 171 ms
TRAPS : Iteration 1
[2024-05-28 21:03:14] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:03:15] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:03:15] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:03:15] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:03:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5723520046227433050.gal : 10 ms
[2024-05-28 21:03:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13966480998027298604.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/ReachabilityCardinality5723520046227433050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13966480998027298604.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/ReachabilityCardinality13966480998027298604.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 435
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :435 after 67562
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :67562 after 68197
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :68197 after 249607
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :249607 after 1.23392e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.23392e+06 after 6.82181e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.82181e+06 after 1.02467e+10
Detected timeout of ITS tools.
[2024-05-28 21:03:30] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:03:30] [INFO ] Applying decomposition
[2024-05-28 21:03:30] [INFO ] Flatten gal took : 8 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/graph14323695112289654117.txt' '-o' '/tmp/graph14323695112289654117.bin' '-w' '/tmp/graph14323695112289654117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14323695112289654117.bin' '-l' '-1' '-v' '-w' '/tmp/graph14323695112289654117.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:03:30] [INFO ] Decomposing Gal with order
[2024-05-28 21:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:03:30] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-28 21:03:30] [INFO ] Flatten gal took : 111 ms
[2024-05-28 21:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 20 ms.
[2024-05-28 21:03:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality398948709881456950.gal : 6 ms
[2024-05-28 21:03:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8572544198863736033.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/ReachabilityCardinality398948709881456950.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8572544198863736033.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 ...306
Loading property file /tmp/ReachabilityCardinality8572544198863736033.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 5199
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5199 after 5199
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124753 after 306116
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :306116 after 5.65718e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.65718e+13 after 9.23448e+14
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31139 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 21:03:45] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:03:45] [INFO ] Applying decomposition
[2024-05-28 21:03:45] [INFO ] Flatten gal took : 12 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/graph7262020104820064769.txt' '-o' '/tmp/graph7262020104820064769.bin' '-w' '/tmp/graph7262020104820064769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7262020104820064769.bin' '-l' '-1' '-v' '-w' '/tmp/graph7262020104820064769.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:03:45] [INFO ] Decomposing Gal with order
[2024-05-28 21:03:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:03:45] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 21:03:45] [INFO ] Flatten gal took : 26 ms
[2024-05-28 21:03:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:03:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1612530395656649861.gal : 5 ms
[2024-05-28 21:03:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16950013873106153510.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/ReachabilityCardinality1612530395656649861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16950013873106153510.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/ReachabilityCardinality16950013873106153510.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 2181
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2181 after 2.72302e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3.13339e+13 after 1.11976e+16
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,3.77124e+30,23.4314,440664,2853,35,599567,320,749,2.21463e+06,55,892,0
Total reachable state count : 3771238132840753733237412462592

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-005B-ReachabilityCardinality-2024-01 does not hold.
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldIIPt-PT-005B-ReachabilityCardinality-2024-01

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-005B-ReachabilityCardinality-2024-01,0,23.5595,440664,1,0,599567,320,813,2.21463e+06,64,892,10888
All properties solved without resorting to model-checking.
Total runtime 79086 ms.

BK_STOP 1716930249484

--------------------
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="ShieldIIPt-PT-005B"
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 ShieldIIPt-PT-005B, 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 r356-tall-171683760700254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005B.tgz
mv ShieldIIPt-PT-005B 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 ;