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-171624189800685.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-20a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 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 57K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20a-UpperBounds-00
FORMULA_NAME DES-PT-20a-UpperBounds-01
FORMULA_NAME DES-PT-20a-UpperBounds-02
FORMULA_NAME DES-PT-20a-UpperBounds-03
FORMULA_NAME DES-PT-20a-UpperBounds-04
FORMULA_NAME DES-PT-20a-UpperBounds-05
FORMULA_NAME DES-PT-20a-UpperBounds-06
FORMULA_NAME DES-PT-20a-UpperBounds-07
FORMULA_NAME DES-PT-20a-UpperBounds-08
FORMULA_NAME DES-PT-20a-UpperBounds-09
FORMULA_NAME DES-PT-20a-UpperBounds-10
FORMULA_NAME DES-PT-20a-UpperBounds-11
FORMULA_NAME DES-PT-20a-UpperBounds-12
FORMULA_NAME DES-PT-20a-UpperBounds-13
FORMULA_NAME DES-PT-20a-UpperBounds-14
FORMULA_NAME DES-PT-20a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716347057270

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 03:04:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:04:18] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-22 03:04:18] [INFO ] Transformed 195 places.
[2024-05-22 03:04:18] [INFO ] Transformed 152 transitions.
[2024-05-22 03:04:18] [INFO ] Found NUPN structural information;
[2024-05-22 03:04:18] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 138 rows 195 cols
[2024-05-22 03:04:18] [INFO ] Computed 59 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (228 resets) in 52 ms. (188 steps per ms)
FORMULA DES-PT-20a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (141 resets) in 46 ms. (638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-22 03:04:18] [INFO ] Invariant cache hit.
[2024-05-22 03:04:18] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-22 03:04:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-22 03:04:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:04:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-22 03:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:04:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-22 03:04:19] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 13 ms.
[2024-05-22 03:04:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 9 ms to minimize.
[2024-05-22 03:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 03:04:19] [INFO ] Added : 68 causal constraints over 14 iterations in 354 ms. Result :sat
Minimization took 67 ms.
[2024-05-22 03:04:19] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 03:04:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:04:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-22 03:04:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-22 03:04:19] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 9 ms.
[2024-05-22 03:04:20] [INFO ] Added : 107 causal constraints over 22 iterations in 393 ms. Result :sat
Minimization took 59 ms.
[2024-05-22 03:04:20] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-22 03:04:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-22 03:04:20] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-22 03:04:20] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-22 03:04:20] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:04:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:04:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-22 03:04:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:20] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-22 03:04:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2024-05-22 03:04:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 03:04:20] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2024-05-22 03:04:21] [INFO ] Added : 74 causal constraints over 15 iterations in 245 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 83 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 192/195 places, 134/138 transitions.
// Phase 1: matrix 134 rows 192 cols
[2024-05-22 03:04:21] [INFO ] Computed 60 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (13673 resets) in 1786 ms. (559 steps per ms)
BEST_FIRST walk for 3000001 steps (6820 resets) in 2448 ms. (1224 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-22 03:04:25] [INFO ] Invariant cache hit.
[2024-05-22 03:04:26] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-22 03:04:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:04:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-22 03:04:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:04:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 03:04:26] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-22 03:04:26] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-22 03:04:26] [INFO ] Added : 66 causal constraints over 14 iterations in 273 ms. Result :sat
Minimization took 48 ms.
[2024-05-22 03:04:26] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-22 03:04:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:04:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-22 03:04:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-22 03:04:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-22 03:04:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:04:26] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:04:26] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:04:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 240 ms
[2024-05-22 03:04:26] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-22 03:04:27] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 03:04:27] [INFO ] Added : 106 causal constraints over 22 iterations in 341 ms. Result :sat
Minimization took 55 ms.
[2024-05-22 03:04:27] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 03:04:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-22 03:04:27] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-22 03:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:04:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 03:04:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-22 03:04:27] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-22 03:04:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-22 03:04:27] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-22 03:04:27] [INFO ] Added : 71 causal constraints over 15 iterations in 168 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-22 03:04:28] [INFO ] Invariant cache hit.
[2024-05-22 03:04:28] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 03:04:28] [INFO ] Invariant cache hit.
[2024-05-22 03:04:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:04:28] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-22 03:04:28] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-22 03:04:28] [INFO ] Invariant cache hit.
[2024-05-22 03:04:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:04:30] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:04:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:04:32] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:04:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:04:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:04:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:04:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 261 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6717 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:04:50] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:04:50] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:04:51] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:04:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 396 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints]
After SMT, in 36823ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 36831ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37173 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (520 resets) in 757 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (97 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (87 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
[2024-05-22 03:05:05] [INFO ] Flatten gal took : 84 ms
BEST_FIRST walk for 40004 steps (85 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
[2024-05-22 03:05:05] [INFO ] Flatten gal took : 36 ms
[2024-05-22 03:05:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9735258239887038348.gal : 8 ms
BEST_FIRST walk for 40004 steps (86 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
[2024-05-22 03:05:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2797773336697508932.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/ReachabilityCardinality9735258239887038348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2797773336697508932.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/ReachabilityCardinality2797773336697508932.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :22 after 28
BEST_FIRST walk for 40004 steps (89 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :28 after 636
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :636 after 666
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :666 after 818
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :818 after 35952
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :35952 after 82924
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :82924 after 415672
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :4.51269e+08 after 6.76855e+08
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :7.06975e+08 after 7.07545e+08
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :5.58062e+09 after 7.96424e+09
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :8.25738e+09 after 9.28829e+09
Interrupted probabilistic random walk after 836259 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 6
Probabilistic random walk after 836259 steps, saw 119029 distinct states, run finished after 3015 ms. (steps per millisecond=277 ) properties seen :0
[2024-05-22 03:05:08] [INFO ] Invariant cache hit.
[2024-05-22 03:05:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/155 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/162 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 113/275 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 33/308 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/309 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 17/326 variables, 17/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 03:05:09] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/155 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 113/275 variables, 162/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 33/308 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 03:05:09] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/309 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 17/326 variables, 17/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 03:05:09] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1209ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :7.13581e+10 after 8.81372e+10
Parikh walk visited 0 properties in 1939 ms.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (538 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (85 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (88 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (92 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (96 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 954388 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 6
Probabilistic random walk after 954388 steps, saw 135605 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
[2024-05-22 03:05:15] [INFO ] Invariant cache hit.
[2024-05-22 03:05:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/155 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/162 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 113/275 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 33/308 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/309 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 17/326 variables, 17/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 03:05:15] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD size :1.77511e+11 after 1.77699e+11
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/155 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 113/275 variables, 162/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 33/308 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/309 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 17/326 variables, 17/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1135ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1506 ms.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-22 03:05:17] [INFO ] Invariant cache hit.
[2024-05-22 03:05:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 03:05:18] [INFO ] Invariant cache hit.
[2024-05-22 03:05:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:05:18] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-22 03:05:18] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-22 03:05:18] [INFO ] Invariant cache hit.
[2024-05-22 03:05:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:05:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:05:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:05:22] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:05:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:05:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:05:22] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-22 03:05:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 261 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6526 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 131072
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
SDD size :5.487e+11 after 5.96619e+11
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 131 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :9.40552e+11 after 1.00248e+12
[2024-05-22 03:05:39] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-05-22 03:05:39] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
[2024-05-22 03:05:40] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 03:05:47] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 396 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints]
After SMT, in 36583ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 36585ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36909 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 31 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 134 rows 192 cols
[2024-05-22 03:05:54] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 03:05:54] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 03:05:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-22 03:05:54] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 03:05:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 03:05:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-22 03:05:55] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 03:05:55] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 6 ms to minimize.
[2024-05-22 03:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-05-22 03:05:55] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 03:05:55] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 03:05:55] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:05:55] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:05:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7850286978811473918.gal : 4 ms
[2024-05-22 03:05:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9290748151384230757.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/ReachabilityCardinality7850286978811473918.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9290748151384230757.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/ReachabilityCardinality9290748151384230757.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :35 after 46
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :46 after 1144
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1144 after 1396
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1396 after 67806
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :67806 after 82448
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :82448 after 482568
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.77246e+08 after 8.77364e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.77364e+08 after 8.80678e+08
Detected timeout of ITS tools.
[2024-05-22 03:05:55] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:05:55] [INFO ] Applying decomposition
[2024-05-22 03:05:55] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5786409410940154566.txt' '-o' '/tmp/graph5786409410940154566.bin' '-w' '/tmp/graph5786409410940154566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5786409410940154566.bin' '-l' '-1' '-v' '-w' '/tmp/graph5786409410940154566.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:05:55] [INFO ] Decomposing Gal with order
[2024-05-22 03:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:05:55] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 03:05:56] [INFO ] Flatten gal took : 41 ms
[2024-05-22 03:05:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 03:05:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12411641938862391150.gal : 3 ms
[2024-05-22 03:05:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17827824684028822117.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/ReachabilityCardinality12411641938862391150.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17827824684028822117.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/ReachabilityCardinality17827824684028822117.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 7124
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7124 after 1.15806e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.15806e+08 after 1.95586e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.95586e+08 after 3.35614e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9.50892e+09 after 9.51118e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.29765e+12 after 1.33612e+12
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.90912e+10 after 3.90936e+10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.96119e+12,1.52451,58948,4817,1830,128833,4658,252,174047,219,21448,0
Total reachable state count : 3961190091904

Verifying 2 reachability properties.
Reachability property MAX1 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
MAX1,3.69814e+10,1.52961,59208,1158,482,128833,4658,252,174047,221,21448,0
Invariant property MIN1 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
MIN1,3.69814e+10,1.53207,59208,1158,482,128833,4658,254,174047,222,21448,0
ITS tools runner thread asked to quit. Dying gracefully.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.0107e+11 after 1.01109e+11
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :3.24541e+11 after 3.24608e+11
Detected timeout of ITS tools.
[2024-05-22 03:06:10] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:06:10] [INFO ] Applying decomposition
[2024-05-22 03:06:10] [INFO ] Flatten gal took : 9 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/graph1095597317922506624.txt' '-o' '/tmp/graph1095597317922506624.bin' '-w' '/tmp/graph1095597317922506624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1095597317922506624.bin' '-l' '-1' '-v' '-w' '/tmp/graph1095597317922506624.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:06:10] [INFO ] Decomposing Gal with order
[2024-05-22 03:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:06:10] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 03:06:10] [INFO ] Flatten gal took : 22 ms
[2024-05-22 03:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 03:06:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1610515004099899710.gal : 2 ms
[2024-05-22 03:06:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14352694397986943316.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1610515004099899710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14352694397986943316.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14352694397986943316.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 180
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :180 after 3552
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10748 after 7.11177e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.11177e+08 after 1.39132e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.68733e+11 after 9.17385e+11
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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.4988e+12,2.16278,81396,7702,1210,193252,2954,247,195336,218,8493,0
Total reachable state count : 2498803417382

Verifying 2 reachability properties.
Reachability property MAX1 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
MAX1,2.93133e+10,2.17107,81396,1391,474,193252,2954,249,195336,221,8493,0
Invariant property MIN1 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
MIN1,2.93133e+10,2.17325,81660,1391,474,193252,2954,253,195336,223,8493,0
Over-approximation ignoring read arcs solved -2 properties in 17689 ms.
FORMULA DES-PT-20a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 114172 ms.

BK_STOP 1716347172562

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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-20a"
export BK_EXAMINATION="UpperBounds"
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-20a, examination is UpperBounds"
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-171624189800685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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