Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063900279.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DES-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063900279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 73K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-00
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-01
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-02
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-03
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-04
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-05
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-06
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-07
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-08
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-09
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-10
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-11
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-12
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-13
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-14
FORMULA_NAME DES-PT-05b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748678930942

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-31 08:08:52] [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]
[2025-05-31 08:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:08:53] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-05-31 08:08:53] [INFO ] Transformed 300 places.
[2025-05-31 08:08:53] [INFO ] Transformed 251 transitions.
[2025-05-31 08:08:53] [INFO ] Found NUPN structural information;
[2025-05-31 08:08:53] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-05b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (333 resets) in 1848 ms. (21 steps per ms) remains 4/15 properties
FORMULA DES-PT-05b-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (40 resets) in 678 ms. (58 steps per ms) remains 4/4 properties
[2025-05-31 08:08:54] [INFO ] Flatten gal took : 208 ms
BEST_FIRST walk for 40003 steps (50 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
[2025-05-31 08:08:54] [INFO ] Flatten gal took : 86 ms
[2025-05-31 08:08:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14933360562454260503.gal : 86 ms
[2025-05-31 08:08:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2855586638378856645.prop : 6 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14933360562454260503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2855586638378856645.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (44 resets) in 923 ms. (43 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2855586638378856645.prop.
BEST_FIRST walk for 40002 steps (38 resets) in 687 ms. (58 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :19 after 89
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :89 after 314
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :314 after 4679
// Phase 1: matrix 251 rows 300 cols
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4679 after 56171
[2025-05-31 08:08:54] [INFO ] Computed 65 invariants in 38 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 149/258 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 149/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 42/300 variables, 24/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 42/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 251/551 variables, 300/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/551 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 665 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3101 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem DES-PT-05b-ReachabilityFireability-2025-00 is UNSAT
FORMULA DES-PT-05b-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem DES-PT-05b-ReachabilityFireability-2025-06 is UNSAT
FORMULA DES-PT-05b-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 149/258 variables, 40/149 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 149/298 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/299 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 42/300 variables, 24/323 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 42/365 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:08:58] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/366 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/366 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 251/551 variables, 300/666 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 0/666 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:00] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/551 variables, 1/667 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:00] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 1/668 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/668 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/551 variables, 0/668 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 668 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4527 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7794ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 1619 ms.
Support contains 91 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 251/251 transitions.
Graph (complete) has 561 edges and 300 vertex of which 291 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 291 transition count 243
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 286 transition count 240
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 283 transition count 240
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 17 place count 283 transition count 234
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 29 place count 277 transition count 234
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 42 place count 264 transition count 221
Iterating global reduction 3 with 13 rules applied. Total rules applied 55 place count 264 transition count 221
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 64 place count 255 transition count 212
Iterating global reduction 3 with 9 rules applied. Total rules applied 73 place count 255 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 80 place count 255 transition count 205
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 150 place count 220 transition count 170
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 220 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 158 place count 216 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 216 transition count 165
Applied a total of 159 rules in 154 ms. Remains 216 /300 variables (removed 84) and now considering 165/251 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 216/300 places, 165/251 transitions.
RANDOM walk for 40000 steps (543 resets) in 795 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 761527 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 2
Probabilistic random walk after 761527 steps, saw 114555 distinct states, run finished after 3014 ms. (steps per millisecond=252 ) properties seen :0
// Phase 1: matrix 165 rows 216 cols
[2025-05-31 08:09:07] [INFO ] Computed 59 invariants in 14 ms
[2025-05-31 08:09:07] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/160 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/203 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/209 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 165/374 variables, 209/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/381 variables, 7/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/381 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 216/216 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/160 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:08] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:08] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:08] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:08] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/203 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/209 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 165/374 variables, 209/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:09] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 7/381 variables, 7/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/381 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 284 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 216/216 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2199ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 972 ms.
Support contains 91 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 165/165 transitions.
Applied a total of 0 rules in 11 ms. Remains 216 /216 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 216/216 places, 165/165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 165/165 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2025-05-31 08:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:09:11] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-31 08:09:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:09:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 08:09:11] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:09:11] [INFO ] Redundant transitions in 7 ms returned []
Running 164 sub problems to find dead transitions.
[2025-05-31 08:09:11] [INFO ] Invariant cache hit.
[2025-05-31 08:09:11] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:13] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:13] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:13] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:14] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:14] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:14] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:15] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:15] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :56171 after 2.77292e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:16] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:17] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 165/381 variables, 216/289 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:19] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:19] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:19] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:19] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:19] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:20] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:24] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:24] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:24] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:30] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:30] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/381 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 19 (OVERLAPS) 0/381 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 308 constraints, problems are : Problem set: 0 solved, 164 unsolved in 25475 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 216/216 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 165/381 variables, 216/303 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 164/470 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:41] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:41] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:43] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:43] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:45] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:47] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:47] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:47] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:09:55] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 12/482 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 55554ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 55558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56104 ms. Remains : 216/216 places, 165/165 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 462 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 215 /216 variables (removed 1) and now considering 165/165 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 165 rows 215 cols
[2025-05-31 08:10:07] [INFO ] Computed 58 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 08:10:07] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 08:10:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 16 ms returned sat
[2025-05-31 08:10:07] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 11 ms returned sat
[2025-05-31 08:10:07] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:10:07] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:10:07] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:10:07] [INFO ] Flatten gal took : 37 ms
[2025-05-31 08:10:07] [INFO ] Flatten gal took : 23 ms
[2025-05-31 08:10:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6802186634353408731.gal : 10 ms
[2025-05-31 08:10:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4105108374688380300.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6802186634353408731.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4105108374688380300.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4105108374688380300.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 351
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :351 after 18845
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :18845 after 23586
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :23586 after 32978
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32978 after 95658
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :95658 after 2.57491e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.57491e+06 after 8.49645e+06
Detected timeout of ITS tools.
[2025-05-31 08:10:22] [INFO ] Flatten gal took : 19 ms
[2025-05-31 08:10:22] [INFO ] Applying decomposition
[2025-05-31 08:10:22] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12422074928697243854.txt' '-o' '/tmp/graph12422074928697243854.bin' '-w' '/tmp/graph12422074928697243854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12422074928697243854.bin' '-l' '-1' '-v' '-w' '/tmp/graph12422074928697243854.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:10:22] [INFO ] Decomposing Gal with order
[2025-05-31 08:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:10:23] [INFO ] Removed a total of 35 redundant transitions.
[2025-05-31 08:10:23] [INFO ] Flatten gal took : 91 ms
[2025-05-31 08:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 19 ms.
[2025-05-31 08:10:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5294908114827776104.gal : 10 ms
[2025-05-31 08:10:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13306082365489820664.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5294908114827776104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13306082365489820664.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13306082365489820664.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 3030
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3030 after 3.91104e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.91104e+06 after 1.01296e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31244 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 08:10:38] [INFO ] Flatten gal took : 23 ms
[2025-05-31 08:10:38] [INFO ] Applying decomposition
[2025-05-31 08:10:38] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13221734150895385706.txt' '-o' '/tmp/graph13221734150895385706.bin' '-w' '/tmp/graph13221734150895385706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13221734150895385706.bin' '-l' '-1' '-v' '-w' '/tmp/graph13221734150895385706.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:10:38] [INFO ] Decomposing Gal with order
[2025-05-31 08:10:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:10:38] [INFO ] Removed a total of 33 redundant transitions.
[2025-05-31 08:10:38] [INFO ] Flatten gal took : 40 ms
[2025-05-31 08:10:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-05-31 08:10:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14931416579247660353.gal : 9 ms
[2025-05-31 08:10:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3519834284799820343.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14931416579247660353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3519834284799820343.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3519834284799820343.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 8729
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8729 after 324613
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :324613 after 1.1605e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1605e+09 after 2.20986e+13
Invariant property DES-PT-05b-ReachabilityFireability-2025-13 does not hold.
FORMULA DES-PT-05b-ReachabilityFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-05b-ReachabilityFireability-2025-12 is true.
FORMULA DES-PT-05b-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,2.39489e+20,706.093,171320,9144,281,215652,1818,726,1.23112e+06,133,5012,0
Total reachable state count : 239489206572649815936

Verifying 2 reachability properties.
Reachability property DES-PT-05b-ReachabilityFireability-2025-12 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-05b-ReachabilityFireability-2025-12,7.34903e+10,710.217,171320,516,129,215652,1818,1013,1.23112e+06,168,5012,0
Invariant property DES-PT-05b-ReachabilityFireability-2025-13 does not hold.

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-05b-ReachabilityFireability-2025-13,8.16045e+15,1312.47,171320,1691,145,215652,1818,1196,1.23112e+06,177,5012,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 1419330 ms.

BK_STOP 1748680352161

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-05b"
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-5832"
echo " Executing tool itstools"
echo " Input is DES-PT-05b, 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 r058-smll-174854063900279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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