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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 79K 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-10b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-10b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716345112276

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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 02:31:53] [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 02:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:31:53] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-22 02:31:53] [INFO ] Transformed 320 places.
[2024-05-22 02:31:53] [INFO ] Transformed 271 transitions.
[2024-05-22 02:31:53] [INFO ] Found NUPN structural information;
[2024-05-22 02:31:53] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 02:31:54] [INFO ] Flatten gal took : 63 ms
[2024-05-22 02:31:54] [INFO ] Flatten gal took : 37 ms
[2024-05-22 02:31:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3072811998186906619.gal : 19 ms
RANDOM walk for 40000 steps (329 resets) in 1607 ms. (24 steps per ms) remains 6/16 properties
FORMULA DES-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 02:31:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8460063931559236282.prop : 3 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/ReachabilityCardinality3072811998186906619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8460063931559236282.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 ...328
Loading property file /tmp/ReachabilityCardinality8460063931559236282.prop.
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 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 15
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :19 after 89
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :89 after 227
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :227 after 3799
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3799 after 81955
BEST_FIRST walk for 40004 steps (57 resets) in 753 ms. (53 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :81955 after 244663
BEST_FIRST walk for 40003 steps (53 resets) in 819 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (45 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
// Phase 1: matrix 271 rows 320 cols
[2024-05-22 02:31:55] [INFO ] Computed 65 invariants in 32 ms
Problem DES-PT-10b-ReachabilityFireability-2024-08 is UNSAT
FORMULA DES-PT-10b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 152/279 variables, 39/166 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 152/318 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/319 variables, 25/343 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 40/383 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/384 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 271/591 variables, 320/705 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 0/705 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/591 variables, 0/705 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 705 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1468 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem DES-PT-10b-ReachabilityFireability-2024-00 is UNSAT
FORMULA DES-PT-10b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem DES-PT-10b-ReachabilityFireability-2024-04 is UNSAT
FORMULA DES-PT-10b-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 169/275 variables, 39/145 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 169/314 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:31:56] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 1/315 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/317 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 4/321 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/321 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 44/319 variables, 25/346 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 44/390 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 3 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:31:57] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 4/394 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:31:58] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 1/395 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/395 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/320 variables, 1/396 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 1/397 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/397 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 271/591 variables, 320/717 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 3/720 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/591 variables, 0/720 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:31:59] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/591 variables, 1/721 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/591 variables, 0/721 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-22 02:32:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 722 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5009 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 6625ms problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 309 transition count 259
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 303 transition count 259
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 303 transition count 251
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 295 transition count 251
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 45 place count 280 transition count 236
Iterating global reduction 2 with 15 rules applied. Total rules applied 60 place count 280 transition count 236
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 70 place count 270 transition count 226
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 270 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 91 place count 270 transition count 215
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 268 transition count 214
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 176 place count 227 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 226 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 226 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 182 place count 224 transition count 172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 224 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 223 transition count 171
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 223 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 222 transition count 170
Applied a total of 186 rules in 152 ms. Remains 222 /320 variables (removed 98) and now considering 170/271 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 222/320 places, 170/271 transitions.
RANDOM walk for 40000 steps (542 resets) in 688 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (93 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (92 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 990329 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 3
Probabilistic random walk after 990329 steps, saw 158247 distinct states, run finished after 3004 ms. (steps per millisecond=329 ) properties seen :0
// Phase 1: matrix 170 rows 222 cols
[2024-05-22 02:32:05] [INFO ] Computed 60 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/154 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/156 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/207 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/213 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 170/383 variables, 213/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/392 variables, 9/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/392 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 222/222 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 100/154 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/156 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 51/207 variables, 23/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 02:32:05] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/213 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 170/383 variables, 213/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 9/392 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/392 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 02:32:06] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/392 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/392 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 293 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 1709ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2150 ms.
Support contains 54 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 170/170 transitions.
Applied a total of 0 rules in 7 ms. Remains 222 /222 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 222/222 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 170/170 transitions.
Applied a total of 0 rules in 6 ms. Remains 222 /222 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-22 02:32:09] [INFO ] Invariant cache hit.
[2024-05-22 02:32:09] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-22 02:32:09] [INFO ] Invariant cache hit.
[2024-05-22 02:32:09] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-22 02:32:09] [INFO ] Redundant transitions in 5 ms returned []
Running 166 sub problems to find dead transitions.
[2024-05-22 02:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 4/222 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 166 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 170/392 variables, 222/282 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:11] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:32:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:32:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:32:12] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:32:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-22 02:32:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-22 02:32:12] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 7/289 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:32:13] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:15] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:32:16] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 2 ms to minimize.
[2024-05-22 02:32:16] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:32:16] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:32:16] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/392 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:32:17] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:18] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:32:18] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:32:18] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:32:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:32:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:32:18] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:20] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:32:20] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:32:21] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:32:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 9 ms to minimize.
[2024-05-22 02:32:21] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:32:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:32:21] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 15 (OVERLAPS) 0/392 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 319 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15570 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 4/222 variables, 35/59 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 170/392 variables, 222/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 166/485 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:32:29] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:32:29] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:32:29] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:32:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
[2024-05-22 02:32:32] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 6/491 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:37] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:32:37] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:32:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:32:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:32:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 02:32:39] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:32:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 7/498 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 02:32:48] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:32:49] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :244663 after 1.654e+08
[2024-05-22 02:32:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 501 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 53/53 constraints]
After SMT, in 45631ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 45634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45980 ms. Remains : 222/222 places, 170/170 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 02:32:55] [INFO ] Flatten gal took : 17 ms
[2024-05-22 02:32:55] [INFO ] Applying decomposition
[2024-05-22 02:32:55] [INFO ] Flatten gal took : 15 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/graph4062956792602711420.txt' '-o' '/tmp/graph4062956792602711420.bin' '-w' '/tmp/graph4062956792602711420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4062956792602711420.bin' '-l' '-1' '-v' '-w' '/tmp/graph4062956792602711420.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:32:55] [INFO ] Decomposing Gal with order
[2024-05-22 02:32:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:32:55] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 02:32:55] [INFO ] Flatten gal took : 53 ms
[2024-05-22 02:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-22 02:32:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16580841452151326904.gal : 7 ms
[2024-05-22 02:32:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10288223128191701838.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/ReachabilityCardinality16580841452151326904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10288223128191701838.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/ReachabilityCardinality10288223128191701838.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 169
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :169 after 636
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :636 after 25146
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :25146 after 2.50568e+09
Reachability property DES-PT-10b-ReachabilityFireability-2024-02 is true.
FORMULA DES-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.50568e+09 after 2.00511e+13
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.03639e+16 after 1.52785e+17
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.69476e+19 after 1.70507e+19
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.53351e+20 after 4.5476e+20
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.68866e+21,9.94613,213816,6538,648,452989,5369,707,526069,193,18312,0
Total reachable state count : 1688660095864521179392

Verifying 3 reachability properties.
Reachability property DES-PT-10b-ReachabilityFireability-2024-02 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-10b-ReachabilityFireability-2024-02,41472,10.1267,214076,111,49,452989,5369,965,526069,238,18312,33153
Reachability property DES-PT-10b-ReachabilityFireability-2024-09 is true.
FORMULA DES-PT-10b-ReachabilityFireability-2024-09 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-10b-ReachabilityFireability-2024-09,2.06367e+15,10.1305,214076,810,150,452989,5369,969,526069,240,18312,33153
Reachability property DES-PT-10b-ReachabilityFireability-2024-11 is true.
FORMULA DES-PT-10b-ReachabilityFireability-2024-11 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-10b-ReachabilityFireability-2024-11,4.99906e+15,10.132,214076,829,154,452989,5369,972,526069,241,18312,33153
All properties solved without resorting to model-checking.
Total runtime 72015 ms.

BK_STOP 1716345185530

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

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