MCC'2024- Execution of r290-tajo-171654447200469

About the Execution of ITS-Tools for PolyORBNT-PT-S05J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.928	2565991.00	3051441.00	2569.00	1 1 1 61 4 1 ? 4 1 1 1 1 1 1 1 10	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200469.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716931219448

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 21:20:20] [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-28 21:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:20:21] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-28 21:20:21] [INFO ] Transformed 909 places.
[2024-05-28 21:20:21] [INFO ] Transformed 1970 transitions.
[2024-05-28 21:20:21] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 21:20:21] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 21:20:21] [INFO ] Computed 142 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[245, 87, 262, 61, 1399, 245, 262, 305, 245, 364, 1, 25, 65, 245, 10]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (678 resets) in 198 ms. (50 steps per ms)
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (1577 resets) in 404 ms. (296 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 4, 1, 3, 4, 1, 1, 1, 1, 1] Max Struct:[245, 87, 262, 1399, 245, 262, 305, 245, 364, 25, 65, 245]
[2024-05-28 21:20:21] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 21:20:21] [INFO ] Invariant cache hit.
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned unsat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 25 ms returned unsat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 24 ms returned unsat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 36 ms returned unsat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive place invariants in 19 ms returned sat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 29 ms returned unsat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 21:20:22] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 29 ms returned sat
[2024-05-28 21:20:23] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-28 21:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:20:23] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-05-28 21:20:23] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 45 ms returned sat
[2024-05-28 21:20:24] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2024-05-28 21:20:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:20:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 413 ms returned sat
[2024-05-28 21:20:25] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 193 ms.
[2024-05-28 21:20:26] [INFO ] Added : 16 causal constraints over 4 iterations in 861 ms. Result :sat
Minimization took 605 ms.
[2024-05-28 21:20:27] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 21:20:27] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned sat
[2024-05-28 21:20:27] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2024-05-28 21:20:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:20:28] [INFO ] [Nat]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-05-28 21:20:28] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 73 ms returned sat
[2024-05-28 21:20:30] [INFO ] [Nat]Absence check using state equation in 1885 ms returned unknown
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 20 ms returned unsat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned unsat
[2024-05-28 21:20:30] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 21:20:31] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 4, 1, 3, 4, 1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 4, 1, 262, 305, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[262, 305]
Support contains 306 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 12 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 383 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 21:20:31] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 21:20:31] [INFO ] Computed 137 invariants in 56 ms
[2024-05-28 21:20:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 21:20:57] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 9 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 5 ms to minimize.
[2024-05-28 21:21:11] [INFO ] Deduced a trap composed of 195 places in 332 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 43515ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43574ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43987 ms. Remains : 770/909 places, 1181/1315 transitions.
[2024-05-28 21:21:15] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:21:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[136, 305]
RANDOM walk for 1000000 steps (52177 resets) in 11075 ms. (90 steps per ms)
BEST_FIRST walk for 1725099 steps (5806 resets) in 6603 ms. (261 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[136, 305]
[2024-05-28 21:21:32] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:21:32] [INFO ] Invariant cache hit.
[2024-05-28 21:21:32] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-28 21:21:32] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 23 ms returned sat
[2024-05-28 21:21:33] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-28 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:21:33] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-28 21:21:33] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 31 ms returned sat
[2024-05-28 21:21:34] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2024-05-28 21:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:21:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 155 ms returned sat
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 214 places in 587 ms of which 8 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 703 ms
[2024-05-28 21:21:35] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 136 ms.
[2024-05-28 21:21:35] [INFO ] Added : 9 causal constraints over 2 iterations in 450 ms. Result :sat
Minimization took 3016 ms.
[2024-05-28 21:21:39] [INFO ] [Real]Absence check using 111 positive place invariants in 19 ms returned sat
[2024-05-28 21:21:39] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-28 21:21:39] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-05-28 21:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:21:39] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 21:21:39] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 41 ms returned sat
[2024-05-28 21:21:49] [INFO ] [Nat]Absence check using state equation in 9348 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[136, 305]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[136, 305]
Support contains 306 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 72 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 49 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 21:21:49] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:21:49] [INFO ] Invariant cache hit.
[2024-05-28 21:21:50] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-05-28 21:21:50] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:21:50] [INFO ] Invariant cache hit.
[2024-05-28 21:21:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:21:58] [INFO ] Implicit Places using invariants and state equation in 7352 ms returned []
Implicit Place search using SMT with State Equation took 8564 ms to find 0 implicit places.
[2024-05-28 21:21:58] [INFO ] Redundant transitions in 75 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 21:21:58] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:21:58] [INFO ] Invariant cache hit.
[2024-05-28 21:21:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1947 variables, and 137 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-05-28 21:22:36] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-05-28 21:22:55] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 3 ms to minimize.
[2024-05-28 21:22:59] [INFO ] Deduced a trap composed of 226 places in 384 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 2/135 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 63317ms problems are : Problem set: 95 solved, 1080 unsolved
Search for dead transitions found 95 dead transitions in 63336ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1086/1181 transitions.
Applied a total of 0 rules in 26 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:23:01] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72140 ms. Remains : 770/770 places, 1086/1181 transitions.
[2024-05-28 21:23:01] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 21:23:01] [INFO ] Computed 137 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[136, 305]
RANDOM walk for 1000000 steps (52054 resets) in 11606 ms. (86 steps per ms)
BEST_FIRST walk for 1738876 steps (5955 resets) in 6961 ms. (249 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[136, 305]
[2024-05-28 21:23:20] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:23:20] [INFO ] Invariant cache hit.
[2024-05-28 21:23:20] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 21:23:20] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 33 ms returned sat
[2024-05-28 21:23:20] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2024-05-28 21:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:23:21] [INFO ] [Nat]Absence check using 111 positive place invariants in 54 ms returned sat
[2024-05-28 21:23:21] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 93 ms returned sat
[2024-05-28 21:23:22] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2024-05-28 21:23:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2024-05-28 21:23:22] [INFO ] Deduced a trap composed of 251 places in 352 ms of which 5 ms to minimize.
[2024-05-28 21:23:22] [INFO ] Deduced a trap composed of 251 places in 357 ms of which 5 ms to minimize.
[2024-05-28 21:23:23] [INFO ] Deduced a trap composed of 246 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:23:23] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:23:24] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:23:24] [INFO ] Deduced a trap composed of 267 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:23:24] [INFO ] Deduced a trap composed of 239 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 254 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 257 places in 325 ms of which 4 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 260 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 242 places in 352 ms of which 5 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 248 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 242 places in 338 ms of which 5 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 242 places in 375 ms of which 6 ms to minimize.
[2024-05-28 21:23:28] [INFO ] Deduced a trap composed of 248 places in 363 ms of which 6 ms to minimize.
[2024-05-28 21:23:28] [INFO ] Deduced a trap composed of 239 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:23:29] [INFO ] Deduced a trap composed of 246 places in 434 ms of which 6 ms to minimize.
[2024-05-28 21:23:29] [INFO ] Deduced a trap composed of 257 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:23:31] [INFO ] Deduced a trap composed of 279 places in 387 ms of which 4 ms to minimize.
[2024-05-28 21:23:31] [INFO ] Deduced a trap composed of 249 places in 372 ms of which 6 ms to minimize.
[2024-05-28 21:23:31] [INFO ] Deduced a trap composed of 252 places in 364 ms of which 5 ms to minimize.
[2024-05-28 21:23:32] [INFO ] Deduced a trap composed of 248 places in 394 ms of which 7 ms to minimize.
[2024-05-28 21:23:32] [INFO ] Deduced a trap composed of 245 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:23:33] [INFO ] Deduced a trap composed of 246 places in 341 ms of which 4 ms to minimize.
[2024-05-28 21:23:33] [INFO ] Deduced a trap composed of 264 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:23:34] [INFO ] Deduced a trap composed of 233 places in 461 ms of which 20 ms to minimize.
[2024-05-28 21:23:34] [INFO ] Deduced a trap composed of 251 places in 408 ms of which 8 ms to minimize.
[2024-05-28 21:23:35] [INFO ] Deduced a trap composed of 245 places in 420 ms of which 5 ms to minimize.
[2024-05-28 21:23:36] [INFO ] Deduced a trap composed of 248 places in 345 ms of which 4 ms to minimize.
[2024-05-28 21:23:36] [INFO ] Deduced a trap composed of 257 places in 380 ms of which 5 ms to minimize.
[2024-05-28 21:23:37] [INFO ] Deduced a trap composed of 236 places in 388 ms of which 4 ms to minimize.
[2024-05-28 21:23:37] [INFO ] Deduced a trap composed of 243 places in 364 ms of which 4 ms to minimize.
[2024-05-28 21:23:38] [INFO ] Deduced a trap composed of 234 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:23:38] [INFO ] Deduced a trap composed of 261 places in 374 ms of which 5 ms to minimize.
[2024-05-28 21:23:40] [INFO ] Deduced a trap composed of 246 places in 451 ms of which 8 ms to minimize.
[2024-05-28 21:23:40] [INFO ] Deduced a trap composed of 257 places in 498 ms of which 20 ms to minimize.
[2024-05-28 21:23:41] [INFO ] Deduced a trap composed of 245 places in 493 ms of which 18 ms to minimize.
[2024-05-28 21:23:42] [INFO ] Deduced a trap composed of 255 places in 501 ms of which 32 ms to minimize.
[2024-05-28 21:23:42] [INFO ] Deduced a trap composed of 236 places in 505 ms of which 32 ms to minimize.
[2024-05-28 21:23:43] [INFO ] Deduced a trap composed of 251 places in 564 ms of which 33 ms to minimize.
[2024-05-28 21:23:44] [INFO ] Deduced a trap composed of 246 places in 485 ms of which 19 ms to minimize.
[2024-05-28 21:23:44] [INFO ] Deduced a trap composed of 231 places in 499 ms of which 32 ms to minimize.
[2024-05-28 21:23:45] [INFO ] Deduced a trap composed of 238 places in 499 ms of which 8 ms to minimize.
[2024-05-28 21:23:46] [INFO ] Deduced a trap composed of 253 places in 394 ms of which 4 ms to minimize.
[2024-05-28 21:23:46] [INFO ] Deduced a trap composed of 260 places in 336 ms of which 4 ms to minimize.
[2024-05-28 21:23:47] [INFO ] Deduced a trap composed of 284 places in 401 ms of which 5 ms to minimize.
[2024-05-28 21:23:47] [INFO ] Deduced a trap composed of 248 places in 482 ms of which 8 ms to minimize.
[2024-05-28 21:23:48] [INFO ] Deduced a trap composed of 273 places in 381 ms of which 6 ms to minimize.
[2024-05-28 21:23:49] [INFO ] Deduced a trap composed of 245 places in 356 ms of which 19 ms to minimize.
[2024-05-28 21:23:49] [INFO ] Deduced a trap composed of 236 places in 370 ms of which 5 ms to minimize.
[2024-05-28 21:23:51] [INFO ] Deduced a trap composed of 254 places in 371 ms of which 6 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 230 places in 366 ms of which 5 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 247 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 259 places in 340 ms of which 5 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 240 places in 386 ms of which 6 ms to minimize.
[2024-05-28 21:23:58] [INFO ] Deduced a trap composed of 241 places in 400 ms of which 5 ms to minimize.
[2024-05-28 21:23:59] [INFO ] Deduced a trap composed of 250 places in 376 ms of which 5 ms to minimize.
[2024-05-28 21:24:03] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 41782 ms
[2024-05-28 21:24:04] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 21:24:04] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2024-05-28 21:24:04] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-28 21:24:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:24:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-28 21:24:05] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 22 ms returned sat
[2024-05-28 21:24:15] [INFO ] [Nat]Absence check using state equation in 10057 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[136, 305]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[136, 305]
Support contains 306 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 41 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:24:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:24:15] [INFO ] Invariant cache hit.
[2024-05-28 21:24:16] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-05-28 21:24:16] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:24:16] [INFO ] Invariant cache hit.
[2024-05-28 21:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:24:25] [INFO ] Implicit Places using invariants and state equation in 9335 ms returned []
Implicit Place search using SMT with State Equation took 10498 ms to find 0 implicit places.
[2024-05-28 21:24:25] [INFO ] Redundant transitions in 13 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:24:25] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:24:25] [INFO ] Invariant cache hit.
[2024-05-28 21:24:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:24:38] [INFO ] Deduced a trap composed of 281 places in 390 ms of which 6 ms to minimize.
[2024-05-28 21:24:38] [INFO ] Deduced a trap composed of 242 places in 294 ms of which 6 ms to minimize.
[2024-05-28 21:24:39] [INFO ] Deduced a trap composed of 209 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:24:39] [INFO ] Deduced a trap composed of 206 places in 325 ms of which 5 ms to minimize.
[2024-05-28 21:24:39] [INFO ] Deduced a trap composed of 209 places in 334 ms of which 6 ms to minimize.
[2024-05-28 21:24:40] [INFO ] Deduced a trap composed of 204 places in 360 ms of which 5 ms to minimize.
[2024-05-28 21:24:40] [INFO ] Deduced a trap composed of 203 places in 368 ms of which 6 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 197 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 209 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:24:41] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 21:24:42] [INFO ] Deduced a trap composed of 206 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:24:42] [INFO ] Deduced a trap composed of 197 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:24:42] [INFO ] Deduced a trap composed of 201 places in 318 ms of which 4 ms to minimize.
[2024-05-28 21:24:43] [INFO ] Deduced a trap composed of 206 places in 277 ms of which 4 ms to minimize.
[2024-05-28 21:24:43] [INFO ] Deduced a trap composed of 199 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:24:43] [INFO ] Deduced a trap composed of 197 places in 313 ms of which 4 ms to minimize.
[2024-05-28 21:24:44] [INFO ] Deduced a trap composed of 204 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:24:44] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 6 ms to minimize.
[2024-05-28 21:24:44] [INFO ] Deduced a trap composed of 197 places in 352 ms of which 5 ms to minimize.
[2024-05-28 21:24:45] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:24:46] [INFO ] Deduced a trap composed of 240 places in 317 ms of which 6 ms to minimize.
[2024-05-28 21:24:47] [INFO ] Deduced a trap composed of 248 places in 340 ms of which 5 ms to minimize.
[2024-05-28 21:24:48] [INFO ] Deduced a trap composed of 211 places in 313 ms of which 5 ms to minimize.
[2024-05-28 21:24:48] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:24:48] [INFO ] Deduced a trap composed of 240 places in 317 ms of which 5 ms to minimize.
[2024-05-28 21:24:48] [INFO ] Deduced a trap composed of 265 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:24:49] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:24:49] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:24:50] [INFO ] Deduced a trap composed of 196 places in 389 ms of which 4 ms to minimize.
[2024-05-28 21:24:50] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:24:51] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:24:51] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:24:51] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:24:52] [INFO ] Deduced a trap composed of 206 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:24:52] [INFO ] Deduced a trap composed of 209 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:24:52] [INFO ] Deduced a trap composed of 206 places in 274 ms of which 3 ms to minimize.
[2024-05-28 21:24:53] [INFO ] Deduced a trap composed of 196 places in 395 ms of which 6 ms to minimize.
[2024-05-28 21:24:53] [INFO ] Deduced a trap composed of 199 places in 355 ms of which 6 ms to minimize.
[2024-05-28 21:24:54] [INFO ] Deduced a trap composed of 196 places in 410 ms of which 6 ms to minimize.
[2024-05-28 21:24:54] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:25:08] [INFO ] Deduced a trap composed of 149 places in 378 ms of which 5 ms to minimize.
[2024-05-28 21:25:08] [INFO ] Deduced a trap composed of 149 places in 377 ms of which 5 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 136 places in 308 ms of which 3 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 140 places in 353 ms of which 4 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 136 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 246 places in 372 ms of which 5 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 188 places in 321 ms of which 4 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:25:11] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:25:11] [INFO ] Deduced a trap composed of 147 places in 318 ms of which 4 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 210 places in 378 ms of which 4 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 208 places in 300 ms of which 5 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 202 places in 344 ms of which 4 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 213 places in 339 ms of which 4 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 212 places in 317 ms of which 4 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 206 places in 358 ms of which 5 ms to minimize.
[2024-05-28 21:25:14] [INFO ] Deduced a trap composed of 203 places in 380 ms of which 5 ms to minimize.
[2024-05-28 21:25:15] [INFO ] Deduced a trap composed of 240 places in 378 ms of which 5 ms to minimize.
[2024-05-28 21:25:15] [INFO ] Deduced a trap composed of 242 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:25:16] [INFO ] Deduced a trap composed of 239 places in 331 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62295ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72867 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40002 steps (2068 resets) in 2307 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (135 resets) in 336 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (136 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
[2024-05-28 21:25:29] [INFO ] Flatten gal took : 303 ms
BEST_FIRST walk for 40004 steps (132 resets) in 719 ms. (55 steps per ms) remains 4/4 properties
[2024-05-28 21:25:29] [INFO ] Flatten gal took : 174 ms
[2024-05-28 21:25:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13559576604229636640.gal : 62 ms
[2024-05-28 21:25:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10239684205865541793.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13559576604229636640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10239684205865541793.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (129 resets) in 566 ms. (70 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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10239684205865541793.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 32
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :32 after 69
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :69 after 80
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :80 after 95
Interrupted probabilistic random walk after 85663 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 4
Probabilistic random walk after 85663 steps, saw 25731 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-28 21:25:32] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:25:32] [INFO ] Invariant cache hit.
[2024-05-28 21:25:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/367 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/655 variables, 48/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/695 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 73/768 variables, 26/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/367 variables, 61/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/655 variables, 48/109 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/695 variables, 1/110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 73/768 variables, 26/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 21:25:36] [INFO ] Deduced a trap composed of 242 places in 1149 ms of which 9 ms to minimize.
[2024-05-28 21:25:36] [INFO ] Deduced a trap composed of 242 places in 569 ms of which 14 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 236 places in 353 ms of which 6 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 242 places in 303 ms of which 4 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 227 places in 279 ms of which 3 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 230 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:25:38] [INFO ] Deduced a trap composed of 254 places in 448 ms of which 33 ms to minimize.
[2024-05-28 21:25:38] [INFO ] Deduced a trap composed of 257 places in 327 ms of which 20 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 224 places in 600 ms of which 4 ms to minimize.
[2024-05-28 21:25:40] [INFO ] Deduced a trap composed of 227 places in 1163 ms of which 4 ms to minimize.
SMT process timed out in 7998ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 306 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 60 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:25:40] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:25:40] [INFO ] Invariant cache hit.
[2024-05-28 21:25:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:25:54] [INFO ] Deduced a trap composed of 281 places in 443 ms of which 8 ms to minimize.
[2024-05-28 21:25:54] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:25:55] [INFO ] Deduced a trap composed of 209 places in 355 ms of which 4 ms to minimize.
[2024-05-28 21:25:55] [INFO ] Deduced a trap composed of 206 places in 377 ms of which 32 ms to minimize.
[2024-05-28 21:25:56] [INFO ] Deduced a trap composed of 209 places in 440 ms of which 6 ms to minimize.
[2024-05-28 21:25:56] [INFO ] Deduced a trap composed of 204 places in 478 ms of which 17 ms to minimize.
[2024-05-28 21:25:57] [INFO ] Deduced a trap composed of 203 places in 439 ms of which 7 ms to minimize.
[2024-05-28 21:25:57] [INFO ] Deduced a trap composed of 197 places in 443 ms of which 20 ms to minimize.
[2024-05-28 21:25:58] [INFO ] Deduced a trap composed of 209 places in 464 ms of which 8 ms to minimize.
[2024-05-28 21:25:58] [INFO ] Deduced a trap composed of 196 places in 407 ms of which 7 ms to minimize.
[2024-05-28 21:25:59] [INFO ] Deduced a trap composed of 206 places in 432 ms of which 8 ms to minimize.
[2024-05-28 21:25:59] [INFO ] Deduced a trap composed of 197 places in 428 ms of which 7 ms to minimize.
[2024-05-28 21:26:00] [INFO ] Deduced a trap composed of 201 places in 368 ms of which 4 ms to minimize.
[2024-05-28 21:26:00] [INFO ] Deduced a trap composed of 206 places in 416 ms of which 7 ms to minimize.
[2024-05-28 21:26:01] [INFO ] Deduced a trap composed of 199 places in 392 ms of which 7 ms to minimize.
[2024-05-28 21:26:01] [INFO ] Deduced a trap composed of 197 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:26:01] [INFO ] Deduced a trap composed of 204 places in 382 ms of which 7 ms to minimize.
[2024-05-28 21:26:02] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 21:26:02] [INFO ] Deduced a trap composed of 197 places in 423 ms of which 7 ms to minimize.
[2024-05-28 21:26:02] [INFO ] Deduced a trap composed of 201 places in 342 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 152 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 258 places in 339 ms of which 6 ms to minimize.
[2024-05-28 21:26:14] [INFO ] Deduced a trap composed of 206 places in 438 ms of which 9 ms to minimize.
[2024-05-28 21:26:14] [INFO ] Deduced a trap composed of 245 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:26:15] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 21:26:15] [INFO ] Deduced a trap composed of 243 places in 308 ms of which 5 ms to minimize.
[2024-05-28 21:26:15] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:26:16] [INFO ] Deduced a trap composed of 201 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:26:17] [INFO ] Deduced a trap composed of 197 places in 304 ms of which 4 ms to minimize.
[2024-05-28 21:26:17] [INFO ] Deduced a trap composed of 212 places in 411 ms of which 5 ms to minimize.
[2024-05-28 21:26:18] [INFO ] Deduced a trap composed of 214 places in 456 ms of which 32 ms to minimize.
[2024-05-28 21:26:18] [INFO ] Deduced a trap composed of 209 places in 340 ms of which 4 ms to minimize.
[2024-05-28 21:26:19] [INFO ] Deduced a trap composed of 207 places in 344 ms of which 5 ms to minimize.
[2024-05-28 21:26:19] [INFO ] Deduced a trap composed of 208 places in 376 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 21:26:19] [INFO ] Flatten gal took : 136 ms
[2024-05-28 21:26:19] [INFO ] Applying decomposition
[2024-05-28 21:26:19] [INFO ] Flatten gal took : 113 ms
[2024-05-28 21:26:20] [INFO ] Deduced a trap composed of 255 places in 379 ms of which 5 ms to minimize.
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/graph757239914465587882.txt' '-o' '/tmp/graph757239914465587882.bin' '-w' '/tmp/graph757239914465587882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph757239914465587882.bin' '-l' '-1' '-v' '-w' '/tmp/graph757239914465587882.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:26:20] [INFO ] Decomposing Gal with order
[2024-05-28 21:26:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:26:20] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 4 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 256 places in 267 ms of which 5 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Removed a total of 910 redundant transitions.
[2024-05-28 21:26:21] [INFO ] Flatten gal took : 880 ms
[2024-05-28 21:26:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 40 ms.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 203 places in 286 ms of which 5 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17050941885991589951.gal : 32 ms
[2024-05-28 21:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2361466017333072497.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/ReachabilityCardinality17050941885991589951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2361466017333072497.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 235 places in 278 ms of which 4 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2361466017333072497.prop.
[2024-05-28 21:26:22] [INFO ] Deduced a trap composed of 204 places in 341 ms of which 5 ms to minimize.
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 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 70
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :70 after 82
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :82 after 95
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :95 after 152
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 40/40 constraints]
After SMT, in 42824ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 42853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42931 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2080 resets) in 974 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 554 ms. (72 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :152 after 656
Interrupted probabilistic random walk after 126013 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 126013 steps, saw 37439 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-28 21:26:27] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:26:27] [INFO ] Invariant cache hit.
[2024-05-28 21:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/367 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/655 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/695 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 73/768 variables, 26/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/367 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/655 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/695 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 73/768 variables, 26/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:26:29] [INFO ] Deduced a trap composed of 242 places in 307 ms of which 5 ms to minimize.
[2024-05-28 21:26:29] [INFO ] Deduced a trap composed of 242 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 236 places in 297 ms of which 4 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 6 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 227 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 254 places in 274 ms of which 5 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 257 places in 278 ms of which 5 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:26:32] [INFO ] Deduced a trap composed of 227 places in 270 ms of which 4 ms to minimize.
[2024-05-28 21:26:32] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:26:32] [INFO ] Deduced a trap composed of 272 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:26:33] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:26:33] [INFO ] Deduced a trap composed of 254 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:26:33] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 4 ms to minimize.
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 5 ms to minimize.
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 248 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:26:35] [INFO ] Deduced a trap composed of 249 places in 317 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:26:35] [INFO ] Deduced a trap composed of 236 places in 275 ms of which 4 ms to minimize.
[2024-05-28 21:26:35] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 243 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 245 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 251 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 233 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 248 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:26:38] [INFO ] Deduced a trap composed of 251 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:26:38] [INFO ] Deduced a trap composed of 248 places in 264 ms of which 5 ms to minimize.
[2024-05-28 21:26:38] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:26:38] [INFO ] Deduced a trap composed of 248 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:26:39] [INFO ] Deduced a trap composed of 239 places in 328 ms of which 6 ms to minimize.
[2024-05-28 21:26:39] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:26:39] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 5 ms to minimize.
[2024-05-28 21:26:40] [INFO ] Deduced a trap composed of 230 places in 315 ms of which 5 ms to minimize.
[2024-05-28 21:26:40] [INFO ] Deduced a trap composed of 239 places in 466 ms of which 7 ms to minimize.
[2024-05-28 21:26:41] [INFO ] Deduced a trap composed of 252 places in 447 ms of which 20 ms to minimize.
[2024-05-28 21:26:41] [INFO ] Deduced a trap composed of 260 places in 354 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :656 after 16272
[2024-05-28 21:26:45] [INFO ] Deduced a trap composed of 248 places in 688 ms of which 18 ms to minimize.
[2024-05-28 21:26:46] [INFO ] Deduced a trap composed of 236 places in 634 ms of which 7 ms to minimize.
[2024-05-28 21:26:46] [INFO ] Deduced a trap composed of 263 places in 393 ms of which 6 ms to minimize.
[2024-05-28 21:26:47] [INFO ] Deduced a trap composed of 245 places in 335 ms of which 6 ms to minimize.
[2024-05-28 21:26:47] [INFO ] Deduced a trap composed of 263 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:26:47] [INFO ] Deduced a trap composed of 233 places in 318 ms of which 5 ms to minimize.
[2024-05-28 21:26:48] [INFO ] Deduced a trap composed of 224 places in 364 ms of which 5 ms to minimize.
[2024-05-28 21:26:48] [INFO ] Deduced a trap composed of 255 places in 402 ms of which 6 ms to minimize.
[2024-05-28 21:26:49] [INFO ] Deduced a trap composed of 245 places in 356 ms of which 6 ms to minimize.
[2024-05-28 21:26:49] [INFO ] Deduced a trap composed of 252 places in 375 ms of which 5 ms to minimize.
[2024-05-28 21:26:50] [INFO ] Deduced a trap composed of 244 places in 345 ms of which 5 ms to minimize.
[2024-05-28 21:26:50] [INFO ] Deduced a trap composed of 224 places in 368 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:26:55] [INFO ] Deduced a trap composed of 133 places in 395 ms of which 5 ms to minimize.
[2024-05-28 21:26:55] [INFO ] Deduced a trap composed of 251 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:26:56] [INFO ] Deduced a trap composed of 260 places in 281 ms of which 5 ms to minimize.
[2024-05-28 21:26:56] [INFO ] Deduced a trap composed of 242 places in 330 ms of which 6 ms to minimize.
[2024-05-28 21:26:56] [INFO ] Deduced a trap composed of 254 places in 314 ms of which 6 ms to minimize.
[2024-05-28 21:26:57] [INFO ] Deduced a trap composed of 248 places in 327 ms of which 6 ms to minimize.
[2024-05-28 21:26:57] [INFO ] Deduced a trap composed of 236 places in 373 ms of which 5 ms to minimize.
[2024-05-28 21:26:58] [INFO ] Deduced a trap composed of 251 places in 381 ms of which 5 ms to minimize.
[2024-05-28 21:26:58] [INFO ] Deduced a trap composed of 248 places in 355 ms of which 5 ms to minimize.
[2024-05-28 21:26:59] [INFO ] Deduced a trap composed of 248 places in 396 ms of which 5 ms to minimize.
[2024-05-28 21:27:01] [INFO ] Deduced a trap composed of 133 places in 378 ms of which 5 ms to minimize.
[2024-05-28 21:27:01] [INFO ] Deduced a trap composed of 133 places in 360 ms of which 5 ms to minimize.
[2024-05-28 21:27:02] [INFO ] Deduced a trap composed of 245 places in 376 ms of which 6 ms to minimize.
[2024-05-28 21:27:02] [INFO ] Deduced a trap composed of 242 places in 349 ms of which 5 ms to minimize.
[2024-05-28 21:27:03] [INFO ] Deduced a trap composed of 245 places in 334 ms of which 5 ms to minimize.
[2024-05-28 21:27:03] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:27:03] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 3 ms to minimize.
[2024-05-28 21:27:03] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:27:04] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:27:04] [INFO ] Deduced a trap composed of 269 places in 251 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:27:04] [INFO ] Deduced a trap composed of 230 places in 337 ms of which 5 ms to minimize.
[2024-05-28 21:27:05] [INFO ] Deduced a trap composed of 252 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:27:05] [INFO ] Deduced a trap composed of 268 places in 344 ms of which 4 ms to minimize.
[2024-05-28 21:27:06] [INFO ] Deduced a trap composed of 273 places in 393 ms of which 5 ms to minimize.
[2024-05-28 21:27:06] [INFO ] Deduced a trap composed of 268 places in 368 ms of which 5 ms to minimize.
[2024-05-28 21:27:07] [INFO ] Deduced a trap composed of 247 places in 362 ms of which 5 ms to minimize.
[2024-05-28 21:27:07] [INFO ] Deduced a trap composed of 250 places in 385 ms of which 5 ms to minimize.
[2024-05-28 21:27:08] [INFO ] Deduced a trap composed of 243 places in 348 ms of which 6 ms to minimize.
[2024-05-28 21:27:08] [INFO ] Deduced a trap composed of 249 places in 377 ms of which 10 ms to minimize.
[2024-05-28 21:27:09] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 5 ms to minimize.
[2024-05-28 21:27:09] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 5 ms to minimize.
[2024-05-28 21:27:10] [INFO ] Deduced a trap composed of 242 places in 383 ms of which 6 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 266 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 239 places in 369 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 251 places in 380 ms of which 5 ms to minimize.
[2024-05-28 21:27:14] [INFO ] Deduced a trap composed of 248 places in 358 ms of which 6 ms to minimize.
SMT process timed out in 47068ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 306 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:27:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:27:14] [INFO ] Invariant cache hit.
[2024-05-28 21:27:15] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-28 21:27:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:27:15] [INFO ] Invariant cache hit.
[2024-05-28 21:27:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:27:24] [INFO ] Implicit Places using invariants and state equation in 8754 ms returned []
Implicit Place search using SMT with State Equation took 10021 ms to find 0 implicit places.
[2024-05-28 21:27:24] [INFO ] Redundant transitions in 13 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:27:24] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:27:24] [INFO ] Invariant cache hit.
[2024-05-28 21:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:27:37] [INFO ] Deduced a trap composed of 281 places in 350 ms of which 4 ms to minimize.
[2024-05-28 21:27:38] [INFO ] Deduced a trap composed of 242 places in 303 ms of which 5 ms to minimize.
[2024-05-28 21:27:38] [INFO ] Deduced a trap composed of 209 places in 320 ms of which 6 ms to minimize.
[2024-05-28 21:27:38] [INFO ] Deduced a trap composed of 206 places in 309 ms of which 5 ms to minimize.
[2024-05-28 21:27:39] [INFO ] Deduced a trap composed of 209 places in 339 ms of which 5 ms to minimize.
[2024-05-28 21:27:39] [INFO ] Deduced a trap composed of 204 places in 282 ms of which 3 ms to minimize.
[2024-05-28 21:27:40] [INFO ] Deduced a trap composed of 203 places in 342 ms of which 4 ms to minimize.
[2024-05-28 21:27:40] [INFO ] Deduced a trap composed of 197 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:27:40] [INFO ] Deduced a trap composed of 209 places in 306 ms of which 5 ms to minimize.
[2024-05-28 21:27:41] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:27:41] [INFO ] Deduced a trap composed of 206 places in 313 ms of which 4 ms to minimize.
[2024-05-28 21:27:41] [INFO ] Deduced a trap composed of 197 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:27:42] [INFO ] Deduced a trap composed of 201 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:27:42] [INFO ] Deduced a trap composed of 206 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:27:42] [INFO ] Deduced a trap composed of 199 places in 226 ms of which 4 ms to minimize.
[2024-05-28 21:27:43] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:27:43] [INFO ] Deduced a trap composed of 204 places in 346 ms of which 4 ms to minimize.
[2024-05-28 21:27:43] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
[2024-05-28 21:27:44] [INFO ] Deduced a trap composed of 197 places in 325 ms of which 5 ms to minimize.
[2024-05-28 21:27:44] [INFO ] Deduced a trap composed of 201 places in 413 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:27:46] [INFO ] Deduced a trap composed of 240 places in 329 ms of which 4 ms to minimize.
[2024-05-28 21:27:47] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:27:47] [INFO ] Deduced a trap composed of 211 places in 248 ms of which 3 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 240 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 265 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 233 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:27:49] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:27:49] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:27:50] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:27:50] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:27:50] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:27:51] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:27:51] [INFO ] Deduced a trap composed of 206 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:27:51] [INFO ] Deduced a trap composed of 209 places in 302 ms of which 4 ms to minimize.
[2024-05-28 21:27:51] [INFO ] Deduced a trap composed of 206 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:27:52] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 6 ms to minimize.
[2024-05-28 21:27:52] [INFO ] Deduced a trap composed of 199 places in 329 ms of which 5 ms to minimize.
[2024-05-28 21:27:53] [INFO ] Deduced a trap composed of 196 places in 362 ms of which 6 ms to minimize.
[2024-05-28 21:27:53] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 149 places in 365 ms of which 4 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 149 places in 347 ms of which 5 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 136 places in 316 ms of which 4 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 140 places in 393 ms of which 5 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 136 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 246 places in 338 ms of which 4 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 188 places in 294 ms of which 3 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 242 places in 345 ms of which 4 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 147 places in 264 ms of which 3 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 210 places in 393 ms of which 4 ms to minimize.
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 208 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 202 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 213 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:28:12] [INFO ] Deduced a trap composed of 212 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:28:12] [INFO ] Deduced a trap composed of 206 places in 341 ms of which 4 ms to minimize.
[2024-05-28 21:28:13] [INFO ] Deduced a trap composed of 203 places in 366 ms of which 4 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 240 places in 387 ms of which 6 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 242 places in 356 ms of which 5 ms to minimize.
[2024-05-28 21:28:15] [INFO ] Deduced a trap composed of 239 places in 396 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62423ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72510 ms. Remains : 770/770 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 4] Max Struct:[136, 305]
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2024-05-28 21:28:26] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:28:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (504 resets) in 94 ms. (105 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 21:28:26] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:28:26] [INFO ] Invariant cache hit.
[2024-05-28 21:28:27] [INFO ] [Real]Absence check using 111 positive place invariants in 35 ms returned sat
[2024-05-28 21:28:27] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2024-05-28 21:28:27] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-05-28 21:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:28:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 79 ms returned sat
[2024-05-28 21:28:27] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2024-05-28 21:28:28] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2024-05-28 21:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:28:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2024-05-28 21:28:29] [INFO ] Deduced a trap composed of 251 places in 378 ms of which 5 ms to minimize.
[2024-05-28 21:28:29] [INFO ] Deduced a trap composed of 251 places in 300 ms of which 5 ms to minimize.
[2024-05-28 21:28:29] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:28:30] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:28:30] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:28:30] [INFO ] Deduced a trap composed of 267 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:28:30] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 3 ms to minimize.
[2024-05-28 21:28:31] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:28:31] [INFO ] Deduced a trap composed of 254 places in 309 ms of which 4 ms to minimize.
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 257 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 260 places in 381 ms of which 5 ms to minimize.
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 242 places in 409 ms of which 5 ms to minimize.
[2024-05-28 21:28:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 42 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:28:33] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:28:33] [INFO ] Invariant cache hit.
[2024-05-28 21:28:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 281 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 242 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 209 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 206 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 209 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 204 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:28:48] [INFO ] Deduced a trap composed of 203 places in 269 ms of which 3 ms to minimize.
[2024-05-28 21:28:48] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:28:48] [INFO ] Deduced a trap composed of 209 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 206 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:28:49] [INFO ] Deduced a trap composed of 201 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 206 places in 270 ms of which 6 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 199 places in 287 ms of which 4 ms to minimize.
[2024-05-28 21:28:50] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 5 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 204 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:28:51] [INFO ] Deduced a trap composed of 197 places in 295 ms of which 4 ms to minimize.
[2024-05-28 21:28:52] [INFO ] Deduced a trap composed of 201 places in 262 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:28:53] [INFO ] Deduced a trap composed of 240 places in 311 ms of which 5 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 9 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 211 places in 299 ms of which 5 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 240 places in 277 ms of which 5 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 265 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 233 places in 293 ms of which 4 ms to minimize.
SMT process timed out in 23230ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 23246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23292 ms. Remains : 770/770 places, 1086/1086 transitions.
[2024-05-28 21:28:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:28:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (52006 resets) in 6564 ms. (152 steps per ms)
BEST_FIRST walk for 1000001 steps (3383 resets) in 1570 ms. (636 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 21:29:04] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:29:04] [INFO ] Invariant cache hit.
[2024-05-28 21:29:04] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 21:29:04] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 33 ms returned sat
[2024-05-28 21:29:05] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2024-05-28 21:29:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:29:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-28 21:29:05] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 24 ms returned sat
[2024-05-28 21:29:06] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2024-05-28 21:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:29:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2024-05-28 21:29:06] [INFO ] Deduced a trap composed of 251 places in 330 ms of which 5 ms to minimize.
[2024-05-28 21:29:06] [INFO ] Deduced a trap composed of 251 places in 349 ms of which 6 ms to minimize.
[2024-05-28 21:29:07] [INFO ] Deduced a trap composed of 246 places in 373 ms of which 6 ms to minimize.
[2024-05-28 21:29:07] [INFO ] Deduced a trap composed of 242 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:29:08] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:29:08] [INFO ] Deduced a trap composed of 267 places in 327 ms of which 5 ms to minimize.
[2024-05-28 21:29:08] [INFO ] Deduced a trap composed of 239 places in 326 ms of which 5 ms to minimize.
[2024-05-28 21:29:09] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:29:09] [INFO ] Deduced a trap composed of 254 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:29:09] [INFO ] Deduced a trap composed of 257 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:29:10] [INFO ] Deduced a trap composed of 260 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:29:10] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:29:10] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:29:11] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:29:11] [INFO ] Deduced a trap composed of 242 places in 340 ms of which 4 ms to minimize.
[2024-05-28 21:29:12] [INFO ] Deduced a trap composed of 248 places in 329 ms of which 5 ms to minimize.
[2024-05-28 21:29:12] [INFO ] Deduced a trap composed of 239 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:29:13] [INFO ] Deduced a trap composed of 246 places in 320 ms of which 3 ms to minimize.
[2024-05-28 21:29:13] [INFO ] Deduced a trap composed of 257 places in 288 ms of which 3 ms to minimize.
[2024-05-28 21:29:14] [INFO ] Deduced a trap composed of 279 places in 309 ms of which 4 ms to minimize.
[2024-05-28 21:29:14] [INFO ] Deduced a trap composed of 249 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 252 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 245 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 264 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:29:16] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:29:17] [INFO ] Deduced a trap composed of 251 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:29:17] [INFO ] Deduced a trap composed of 245 places in 309 ms of which 4 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 248 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 257 places in 287 ms of which 3 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 3 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 243 places in 331 ms of which 5 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:29:20] [INFO ] Deduced a trap composed of 261 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:29:21] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:29:21] [INFO ] Deduced a trap composed of 257 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:29:22] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 5 ms to minimize.
[2024-05-28 21:29:22] [INFO ] Deduced a trap composed of 255 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:29:22] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 251 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:29:23] [INFO ] Deduced a trap composed of 246 places in 310 ms of which 3 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 231 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:29:24] [INFO ] Deduced a trap composed of 253 places in 293 ms of which 4 ms to minimize.
[2024-05-28 21:29:25] [INFO ] Deduced a trap composed of 260 places in 273 ms of which 3 ms to minimize.
[2024-05-28 21:29:25] [INFO ] Deduced a trap composed of 284 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:29:25] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:29:26] [INFO ] Deduced a trap composed of 273 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:29:26] [INFO ] Deduced a trap composed of 245 places in 331 ms of which 5 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 236 places in 336 ms of which 5 ms to minimize.
[2024-05-28 21:29:29] [INFO ] Deduced a trap composed of 254 places in 348 ms of which 3 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 247 places in 336 ms of which 5 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 259 places in 319 ms of which 5 ms to minimize.
[2024-05-28 21:29:32] [INFO ] Deduced a trap composed of 240 places in 338 ms of which 4 ms to minimize.
[2024-05-28 21:29:35] [INFO ] Deduced a trap composed of 241 places in 364 ms of which 5 ms to minimize.
[2024-05-28 21:29:36] [INFO ] Deduced a trap composed of 250 places in 287 ms of which 3 ms to minimize.
[2024-05-28 21:29:40] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 34483 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 53 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 41 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:29:40] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:29:40] [INFO ] Invariant cache hit.
[2024-05-28 21:29:42] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2024-05-28 21:29:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:29:42] [INFO ] Invariant cache hit.
[2024-05-28 21:29:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:29:54] [INFO ] Implicit Places using invariants and state equation in 12447 ms returned []
Implicit Place search using SMT with State Equation took 13819 ms to find 0 implicit places.
[2024-05-28 21:29:54] [INFO ] Redundant transitions in 13 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:29:54] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:29:54] [INFO ] Invariant cache hit.
[2024-05-28 21:29:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:30:07] [INFO ] Deduced a trap composed of 281 places in 314 ms of which 4 ms to minimize.
[2024-05-28 21:30:07] [INFO ] Deduced a trap composed of 242 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 209 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 206 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:30:08] [INFO ] Deduced a trap composed of 209 places in 272 ms of which 4 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 204 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 203 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:30:09] [INFO ] Deduced a trap composed of 197 places in 336 ms of which 4 ms to minimize.
[2024-05-28 21:30:10] [INFO ] Deduced a trap composed of 209 places in 357 ms of which 6 ms to minimize.
[2024-05-28 21:30:10] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:30:10] [INFO ] Deduced a trap composed of 206 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:30:11] [INFO ] Deduced a trap composed of 197 places in 319 ms of which 6 ms to minimize.
[2024-05-28 21:30:11] [INFO ] Deduced a trap composed of 201 places in 285 ms of which 3 ms to minimize.
[2024-05-28 21:30:11] [INFO ] Deduced a trap composed of 206 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:30:12] [INFO ] Deduced a trap composed of 199 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:30:12] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:30:12] [INFO ] Deduced a trap composed of 204 places in 314 ms of which 5 ms to minimize.
[2024-05-28 21:30:13] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:30:13] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:30:13] [INFO ] Deduced a trap composed of 201 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:30:14] [INFO ] Deduced a trap composed of 240 places in 311 ms of which 5 ms to minimize.
[2024-05-28 21:30:16] [INFO ] Deduced a trap composed of 248 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:30:16] [INFO ] Deduced a trap composed of 211 places in 302 ms of which 5 ms to minimize.
[2024-05-28 21:30:16] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 21:30:16] [INFO ] Deduced a trap composed of 240 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:30:17] [INFO ] Deduced a trap composed of 265 places in 215 ms of which 4 ms to minimize.
[2024-05-28 21:30:17] [INFO ] Deduced a trap composed of 233 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:30:17] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:30:18] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:30:18] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:30:19] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:30:19] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:30:19] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:30:20] [INFO ] Deduced a trap composed of 206 places in 343 ms of which 4 ms to minimize.
[2024-05-28 21:30:20] [INFO ] Deduced a trap composed of 209 places in 302 ms of which 4 ms to minimize.
[2024-05-28 21:30:20] [INFO ] Deduced a trap composed of 206 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:30:21] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:30:21] [INFO ] Deduced a trap composed of 199 places in 333 ms of which 4 ms to minimize.
[2024-05-28 21:30:21] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 3 ms to minimize.
[2024-05-28 21:30:22] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:30:38] [INFO ] Deduced a trap composed of 149 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:30:39] [INFO ] Deduced a trap composed of 149 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:30:39] [INFO ] Deduced a trap composed of 136 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:30:39] [INFO ] Deduced a trap composed of 140 places in 324 ms of which 4 ms to minimize.
[2024-05-28 21:30:40] [INFO ] Deduced a trap composed of 136 places in 321 ms of which 4 ms to minimize.
[2024-05-28 21:30:40] [INFO ] Deduced a trap composed of 246 places in 342 ms of which 4 ms to minimize.
[2024-05-28 21:30:40] [INFO ] Deduced a trap composed of 188 places in 333 ms of which 4 ms to minimize.
[2024-05-28 21:30:41] [INFO ] Deduced a trap composed of 239 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:30:41] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:30:41] [INFO ] Deduced a trap composed of 147 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:30:42] [INFO ] Deduced a trap composed of 210 places in 384 ms of which 4 ms to minimize.
[2024-05-28 21:30:42] [INFO ] Deduced a trap composed of 208 places in 271 ms of which 4 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 202 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 213 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 212 places in 262 ms of which 5 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 206 places in 265 ms of which 3 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 203 places in 303 ms of which 4 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 240 places in 379 ms of which 5 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 242 places in 346 ms of which 5 ms to minimize.
[2024-05-28 21:30:46] [INFO ] Deduced a trap composed of 239 places in 359 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 63334ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77241 ms. Remains : 770/770 places, 1086/1086 transitions.
[2024-05-28 21:30:58] [INFO ] Flatten gal took : 106 ms
[2024-05-28 21:30:58] [INFO ] Flatten gal took : 106 ms
[2024-05-28 21:30:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11415048112537961250.gal : 26 ms
[2024-05-28 21:30:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10551181986915541776.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/ReachabilityCardinality11415048112537961250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10551181986915541776.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2086 resets) in 1227 ms. (32 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10551181986915541776.prop.
BEST_FIRST walk for 40004 steps (130 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
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 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 69
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :69 after 80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :80 after 95
Interrupted probabilistic random walk after 102423 steps, run timeout after 3013 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 102423 steps, saw 30837 distinct states, run finished after 3013 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-28 21:31:01] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:31:01] [INFO ] Invariant cache hit.
[2024-05-28 21:31:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 1 solved, 1 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 21:31:03] [INFO ] Deduced a trap composed of 233 places in 642 ms of which 19 ms to minimize.
[2024-05-28 21:31:03] [INFO ] Deduced a trap composed of 269 places in 465 ms of which 18 ms to minimize.
[2024-05-28 21:31:04] [INFO ] Deduced a trap composed of 246 places in 293 ms of which 4 ms to minimize.
[2024-05-28 21:31:04] [INFO ] Deduced a trap composed of 242 places in 414 ms of which 8 ms to minimize.
[2024-05-28 21:31:05] [INFO ] Deduced a trap composed of 236 places in 413 ms of which 29 ms to minimize.
[2024-05-28 21:31:05] [INFO ] Deduced a trap composed of 239 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:31:05] [INFO ] Deduced a trap composed of 254 places in 322 ms of which 4 ms to minimize.
[2024-05-28 21:31:06] [INFO ] Deduced a trap composed of 254 places in 320 ms of which 4 ms to minimize.
[2024-05-28 21:31:06] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:31:06] [INFO ] Deduced a trap composed of 236 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:31:07] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:31:07] [INFO ] Deduced a trap composed of 254 places in 329 ms of which 3 ms to minimize.
[2024-05-28 21:31:07] [INFO ] Deduced a trap composed of 239 places in 287 ms of which 4 ms to minimize.
SMT process timed out in 6097ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:31:07] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:31:07] [INFO ] Invariant cache hit.
[2024-05-28 21:31:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:31:22] [INFO ] Deduced a trap composed of 281 places in 331 ms of which 4 ms to minimize.
[2024-05-28 21:31:22] [INFO ] Deduced a trap composed of 242 places in 366 ms of which 4 ms to minimize.
[2024-05-28 21:31:23] [INFO ] Deduced a trap composed of 209 places in 314 ms of which 4 ms to minimize.
[2024-05-28 21:31:23] [INFO ] Deduced a trap composed of 206 places in 332 ms of which 4 ms to minimize.
[2024-05-28 21:31:24] [INFO ] Deduced a trap composed of 209 places in 324 ms of which 4 ms to minimize.
[2024-05-28 21:31:24] [INFO ] Deduced a trap composed of 204 places in 322 ms of which 4 ms to minimize.
[2024-05-28 21:31:24] [INFO ] Deduced a trap composed of 203 places in 324 ms of which 4 ms to minimize.
[2024-05-28 21:31:25] [INFO ] Deduced a trap composed of 197 places in 324 ms of which 4 ms to minimize.
[2024-05-28 21:31:25] [INFO ] Deduced a trap composed of 209 places in 314 ms of which 4 ms to minimize.
[2024-05-28 21:31:25] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:31:26] [INFO ] Deduced a trap composed of 206 places in 327 ms of which 4 ms to minimize.
[2024-05-28 21:31:26] [INFO ] Deduced a trap composed of 197 places in 325 ms of which 5 ms to minimize.
[2024-05-28 21:31:26] [INFO ] Deduced a trap composed of 201 places in 324 ms of which 4 ms to minimize.
[2024-05-28 21:31:27] [INFO ] Deduced a trap composed of 206 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:31:27] [INFO ] Deduced a trap composed of 199 places in 536 ms of which 4 ms to minimize.
[2024-05-28 21:31:28] [INFO ] Deduced a trap composed of 197 places in 722 ms of which 5 ms to minimize.
[2024-05-28 21:31:29] [INFO ] Deduced a trap composed of 204 places in 628 ms of which 5 ms to minimize.
[2024-05-28 21:31:29] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 4 ms to minimize.
[2024-05-28 21:31:29] [INFO ] Deduced a trap composed of 197 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:31:30] [INFO ] Deduced a trap composed of 201 places in 393 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 152 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:31:40] [INFO ] Deduced a trap composed of 258 places in 432 ms of which 8 ms to minimize.
[2024-05-28 21:31:41] [INFO ] Deduced a trap composed of 206 places in 415 ms of which 18 ms to minimize.
[2024-05-28 21:31:41] [INFO ] Deduced a trap composed of 245 places in 460 ms of which 32 ms to minimize.
[2024-05-28 21:31:42] [INFO ] Deduced a trap composed of 196 places in 388 ms of which 7 ms to minimize.
[2024-05-28 21:31:42] [INFO ] Deduced a trap composed of 243 places in 462 ms of which 6 ms to minimize.
[2024-05-28 21:31:43] [INFO ] Deduced a trap composed of 236 places in 490 ms of which 31 ms to minimize.
[2024-05-28 21:31:44] [INFO ] Deduced a trap composed of 201 places in 466 ms of which 7 ms to minimize.
[2024-05-28 21:31:44] [INFO ] Deduced a trap composed of 197 places in 543 ms of which 31 ms to minimize.
[2024-05-28 21:31:45] [INFO ] Deduced a trap composed of 212 places in 506 ms of which 6 ms to minimize.
[2024-05-28 21:31:45] [INFO ] Deduced a trap composed of 214 places in 400 ms of which 7 ms to minimize.
[2024-05-28 21:31:46] [INFO ] Deduced a trap composed of 209 places in 496 ms of which 31 ms to minimize.
[2024-05-28 21:31:46] [INFO ] Deduced a trap composed of 207 places in 422 ms of which 7 ms to minimize.
[2024-05-28 21:31:47] [INFO ] Deduced a trap composed of 208 places in 444 ms of which 7 ms to minimize.
[2024-05-28 21:31:48] [INFO ] Deduced a trap composed of 255 places in 511 ms of which 18 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 21:31:48] [INFO ] Flatten gal took : 40 ms
[2024-05-28 21:31:48] [INFO ] Applying decomposition
[2024-05-28 21:31:48] [INFO ] Flatten gal took : 91 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/graph13877486731344788900.txt' '-o' '/tmp/graph13877486731344788900.bin' '-w' '/tmp/graph13877486731344788900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13877486731344788900.bin' '-l' '-1' '-v' '-w' '/tmp/graph13877486731344788900.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:31:48] [INFO ] Decomposing Gal with order
[2024-05-28 21:31:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:31:49] [INFO ] Deduced a trap composed of 242 places in 813 ms of which 22 ms to minimize.
[2024-05-28 21:31:49] [INFO ] Removed a total of 1237 redundant transitions.
[2024-05-28 21:31:49] [INFO ] Flatten gal took : 353 ms
[2024-05-28 21:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 520 labels/synchronizations in 149 ms.
[2024-05-28 21:31:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11827517909090397514.gal : 76 ms
[2024-05-28 21:31:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3543268044751714660.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/ReachabilityCardinality11827517909090397514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3543268044751714660.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/ReachabilityCardinality3543268044751714660.prop.
[2024-05-28 21:31:50] [INFO ] Deduced a trap composed of 256 places in 757 ms of which 4 ms to minimize.
[2024-05-28 21:31:50] [INFO ] Deduced a trap composed of 239 places in 523 ms of which 41 ms to minimize.
SMT process timed out in 42706ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 42718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42751 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2091 resets) in 464 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (132 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 126521 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 1
Probabilistic random walk after 126521 steps, saw 37586 distinct states, run finished after 3013 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-28 21:31:53] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:31:53] [INFO ] Invariant cache hit.
[2024-05-28 21:31:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:31:55] [INFO ] Deduced a trap composed of 233 places in 314 ms of which 3 ms to minimize.
[2024-05-28 21:31:55] [INFO ] Deduced a trap composed of 269 places in 304 ms of which 5 ms to minimize.
[2024-05-28 21:31:55] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 5 ms to minimize.
[2024-05-28 21:31:56] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:31:56] [INFO ] Deduced a trap composed of 236 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:31:56] [INFO ] Deduced a trap composed of 239 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:31:56] [INFO ] Deduced a trap composed of 254 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:31:57] [INFO ] Deduced a trap composed of 254 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:31:57] [INFO ] Deduced a trap composed of 254 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:31:57] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:31:57] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:31:58] [INFO ] Deduced a trap composed of 254 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:31:58] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:31:58] [INFO ] Deduced a trap composed of 254 places in 296 ms of which 3 ms to minimize.
[2024-05-28 21:31:58] [INFO ] Deduced a trap composed of 233 places in 231 ms of which 4 ms to minimize.
[2024-05-28 21:31:59] [INFO ] Deduced a trap composed of 242 places in 303 ms of which 4 ms to minimize.
[2024-05-28 21:31:59] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 4 ms to minimize.
[2024-05-28 21:31:59] [INFO ] Deduced a trap composed of 218 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:32:00] [INFO ] Deduced a trap composed of 241 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:32:00] [INFO ] Deduced a trap composed of 258 places in 313 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:32:00] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:32:00] [INFO ] Deduced a trap composed of 241 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:32:01] [INFO ] Deduced a trap composed of 251 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:32:01] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:32:01] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:32:01] [INFO ] Deduced a trap composed of 240 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:32:02] [INFO ] Deduced a trap composed of 251 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:32:02] [INFO ] Deduced a trap composed of 236 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:32:02] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:32:03] [INFO ] Deduced a trap composed of 246 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:32:03] [INFO ] Deduced a trap composed of 236 places in 285 ms of which 3 ms to minimize.
[2024-05-28 21:32:03] [INFO ] Deduced a trap composed of 265 places in 279 ms of which 4 ms to minimize.
[2024-05-28 21:32:04] [INFO ] Deduced a trap composed of 250 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:32:04] [INFO ] Deduced a trap composed of 256 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:32:04] [INFO ] Deduced a trap composed of 248 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:32:04] [INFO ] Deduced a trap composed of 248 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:32:05] [INFO ] Deduced a trap composed of 254 places in 271 ms of which 3 ms to minimize.
[2024-05-28 21:32:05] [INFO ] Deduced a trap composed of 272 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:32:05] [INFO ] Deduced a trap composed of 251 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:32:06] [INFO ] Deduced a trap composed of 257 places in 247 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:32:06] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 3 ms to minimize.
[2024-05-28 21:32:06] [INFO ] Deduced a trap composed of 239 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:32:07] [INFO ] Deduced a trap composed of 231 places in 266 ms of which 3 ms to minimize.
[2024-05-28 21:32:07] [INFO ] Deduced a trap composed of 260 places in 287 ms of which 4 ms to minimize.
[2024-05-28 21:32:07] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:32:08] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 5 ms to minimize.
[2024-05-28 21:32:09] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 5 ms to minimize.
[2024-05-28 21:32:09] [INFO ] Deduced a trap composed of 236 places in 300 ms of which 4 ms to minimize.
[2024-05-28 21:32:09] [INFO ] Deduced a trap composed of 218 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:32:10] [INFO ] Deduced a trap composed of 246 places in 320 ms of which 5 ms to minimize.
[2024-05-28 21:32:10] [INFO ] Deduced a trap composed of 248 places in 316 ms of which 5 ms to minimize.
[2024-05-28 21:32:11] [INFO ] Deduced a trap composed of 242 places in 388 ms of which 6 ms to minimize.
[2024-05-28 21:32:11] [INFO ] Deduced a trap composed of 227 places in 457 ms of which 20 ms to minimize.
[2024-05-28 21:32:12] [INFO ] Deduced a trap composed of 251 places in 465 ms of which 32 ms to minimize.
[2024-05-28 21:32:13] [INFO ] Deduced a trap composed of 254 places in 319 ms of which 5 ms to minimize.
[2024-05-28 21:32:13] [INFO ] Deduced a trap composed of 230 places in 336 ms of which 4 ms to minimize.
[2024-05-28 21:32:14] [INFO ] Deduced a trap composed of 239 places in 300 ms of which 4 ms to minimize.
[2024-05-28 21:32:14] [INFO ] Deduced a trap composed of 242 places in 343 ms of which 4 ms to minimize.
[2024-05-28 21:32:14] [INFO ] Deduced a trap composed of 242 places in 293 ms of which 4 ms to minimize.
[2024-05-28 21:32:16] [INFO ] Deduced a trap composed of 248 places in 368 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:32:17] [INFO ] Deduced a trap composed of 260 places in 299 ms of which 4 ms to minimize.
[2024-05-28 21:32:17] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 3 ms to minimize.
[2024-05-28 21:32:17] [INFO ] Deduced a trap composed of 257 places in 304 ms of which 4 ms to minimize.
[2024-05-28 21:32:18] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:32:18] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 3 ms to minimize.
[2024-05-28 21:32:18] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:32:18] [INFO ] Deduced a trap composed of 245 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:32:19] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:32:19] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:32:19] [INFO ] Deduced a trap composed of 233 places in 305 ms of which 3 ms to minimize.
[2024-05-28 21:32:20] [INFO ] Deduced a trap composed of 273 places in 336 ms of which 4 ms to minimize.
[2024-05-28 21:32:21] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 5 ms to minimize.
[2024-05-28 21:32:21] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 3 ms to minimize.
[2024-05-28 21:32:21] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:32:22] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:32:22] [INFO ] Deduced a trap composed of 257 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:32:22] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 3 ms to minimize.
[2024-05-28 21:32:22] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:32:23] [INFO ] Deduced a trap composed of 268 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:32:23] [INFO ] Deduced a trap composed of 236 places in 289 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:32:23] [INFO ] Deduced a trap composed of 233 places in 283 ms of which 4 ms to minimize.
[2024-05-28 21:32:24] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:32:24] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:32:25] [INFO ] Deduced a trap composed of 257 places in 309 ms of which 5 ms to minimize.
[2024-05-28 21:32:26] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:32:26] [INFO ] Deduced a trap composed of 224 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:32:27] [INFO ] Deduced a trap composed of 250 places in 290 ms of which 3 ms to minimize.
[2024-05-28 21:32:27] [INFO ] Deduced a trap composed of 242 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:32:27] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:32:27] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 5 ms to minimize.
[2024-05-28 21:32:28] [INFO ] Deduced a trap composed of 247 places in 283 ms of which 4 ms to minimize.
[2024-05-28 21:32:28] [INFO ] Deduced a trap composed of 242 places in 277 ms of which 3 ms to minimize.
[2024-05-28 21:32:29] [INFO ] Deduced a trap composed of 224 places in 309 ms of which 4 ms to minimize.
[2024-05-28 21:32:31] [INFO ] Deduced a trap composed of 239 places in 357 ms of which 5 ms to minimize.
[2024-05-28 21:32:31] [INFO ] Deduced a trap composed of 218 places in 309 ms of which 4 ms to minimize.
[2024-05-28 21:32:31] [INFO ] Deduced a trap composed of 231 places in 352 ms of which 5 ms to minimize.
[2024-05-28 21:32:32] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:32:32] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:32:32] [INFO ] Deduced a trap composed of 254 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:32:32] [INFO ] Deduced a trap composed of 239 places in 245 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:32:33] [INFO ] Deduced a trap composed of 246 places in 311 ms of which 3 ms to minimize.
[2024-05-28 21:32:34] [INFO ] Deduced a trap composed of 263 places in 298 ms of which 5 ms to minimize.
[2024-05-28 21:32:34] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 5 ms to minimize.
[2024-05-28 21:32:34] [INFO ] Deduced a trap composed of 260 places in 304 ms of which 4 ms to minimize.
[2024-05-28 21:32:35] [INFO ] Deduced a trap composed of 218 places in 355 ms of which 4 ms to minimize.
[2024-05-28 21:32:35] [INFO ] Deduced a trap composed of 224 places in 299 ms of which 5 ms to minimize.
[2024-05-28 21:32:36] [INFO ] Deduced a trap composed of 236 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:32:39] [INFO ] Deduced a trap composed of 261 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:32:39] [INFO ] Deduced a trap composed of 260 places in 300 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1852 variables, and 246 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 109/109 constraints]
After SMT, in 45931ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 57 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Detected timeout of ITS tools.
Applied a total of 0 rules in 44 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:32:39] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:32:39] [INFO ] Invariant cache hit.
[2024-05-28 21:32:41] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2024-05-28 21:32:41] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:32:41] [INFO ] Invariant cache hit.
[2024-05-28 21:32:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:32:53] [INFO ] Implicit Places using invariants and state equation in 12069 ms returned []
Implicit Place search using SMT with State Equation took 13359 ms to find 0 implicit places.
[2024-05-28 21:32:53] [INFO ] Redundant transitions in 37 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:32:53] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:32:53] [INFO ] Invariant cache hit.
[2024-05-28 21:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:33:06] [INFO ] Deduced a trap composed of 281 places in 330 ms of which 4 ms to minimize.
[2024-05-28 21:33:07] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:33:07] [INFO ] Deduced a trap composed of 209 places in 277 ms of which 3 ms to minimize.
[2024-05-28 21:33:07] [INFO ] Deduced a trap composed of 206 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:33:08] [INFO ] Deduced a trap composed of 209 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:33:08] [INFO ] Deduced a trap composed of 204 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:33:08] [INFO ] Deduced a trap composed of 203 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:33:08] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:33:09] [INFO ] Deduced a trap composed of 209 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:33:09] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 4 ms to minimize.
[2024-05-28 21:33:09] [INFO ] Deduced a trap composed of 206 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:33:10] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 3 ms to minimize.
[2024-05-28 21:33:10] [INFO ] Deduced a trap composed of 201 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:33:10] [INFO ] Deduced a trap composed of 206 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:33:11] [INFO ] Deduced a trap composed of 199 places in 292 ms of which 4 ms to minimize.
[2024-05-28 21:33:11] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:33:11] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:33:11] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:33:12] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:33:12] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:33:13] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:33:15] [INFO ] Deduced a trap composed of 248 places in 362 ms of which 5 ms to minimize.
[2024-05-28 21:33:15] [INFO ] Deduced a trap composed of 211 places in 332 ms of which 5 ms to minimize.
[2024-05-28 21:33:15] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:33:15] [INFO ] Deduced a trap composed of 240 places in 228 ms of which 3 ms to minimize.
[2024-05-28 21:33:16] [INFO ] Deduced a trap composed of 265 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:33:16] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:33:16] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:33:18] [INFO ] Deduced a trap composed of 196 places in 432 ms of which 5 ms to minimize.
[2024-05-28 21:33:18] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 4 ms to minimize.
[2024-05-28 21:33:18] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:33:19] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:33:19] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:33:19] [INFO ] Deduced a trap composed of 206 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:33:19] [INFO ] Deduced a trap composed of 209 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:33:20] [INFO ] Deduced a trap composed of 206 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:33:20] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
[2024-05-28 21:33:21] [INFO ] Deduced a trap composed of 199 places in 257 ms of which 4 ms to minimize.
[2024-05-28 21:33:21] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 3 ms to minimize.
[2024-05-28 21:33:21] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:33:37] [INFO ] Deduced a trap composed of 149 places in 384 ms of which 6 ms to minimize.
[2024-05-28 21:33:37] [INFO ] Deduced a trap composed of 149 places in 338 ms of which 5 ms to minimize.
[2024-05-28 21:33:37] [INFO ] Deduced a trap composed of 136 places in 376 ms of which 5 ms to minimize.
[2024-05-28 21:33:38] [INFO ] Deduced a trap composed of 140 places in 373 ms of which 4 ms to minimize.
[2024-05-28 21:33:38] [INFO ] Deduced a trap composed of 136 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:33:39] [INFO ] Deduced a trap composed of 246 places in 373 ms of which 5 ms to minimize.
[2024-05-28 21:33:39] [INFO ] Deduced a trap composed of 188 places in 345 ms of which 4 ms to minimize.
[2024-05-28 21:33:39] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:33:40] [INFO ] Deduced a trap composed of 242 places in 305 ms of which 4 ms to minimize.
[2024-05-28 21:33:40] [INFO ] Deduced a trap composed of 147 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:33:40] [INFO ] Deduced a trap composed of 210 places in 339 ms of which 4 ms to minimize.
[2024-05-28 21:33:41] [INFO ] Deduced a trap composed of 208 places in 292 ms of which 5 ms to minimize.
[2024-05-28 21:33:41] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:33:41] [INFO ] Deduced a trap composed of 213 places in 317 ms of which 4 ms to minimize.
[2024-05-28 21:33:42] [INFO ] Deduced a trap composed of 212 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:33:42] [INFO ] Deduced a trap composed of 206 places in 334 ms of which 4 ms to minimize.
[2024-05-28 21:33:43] [INFO ] Deduced a trap composed of 203 places in 292 ms of which 3 ms to minimize.
[2024-05-28 21:33:44] [INFO ] Deduced a trap composed of 240 places in 394 ms of which 5 ms to minimize.
[2024-05-28 21:33:44] [INFO ] Deduced a trap composed of 242 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:33:44] [INFO ] Deduced a trap composed of 239 places in 405 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 63496ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76974 ms. Remains : 770/770 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06 in 329996 ms.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[305]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[305]
[2024-05-28 21:33:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:33:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[305]
RANDOM walk for 10000 steps (541 resets) in 151 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (36 resets) in 82 ms. (120 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[305]
[2024-05-28 21:33:57] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:33:57] [INFO ] Invariant cache hit.
[2024-05-28 21:33:57] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 21:33:57] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 31 ms returned sat
[2024-05-28 21:33:57] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2024-05-28 21:33:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:33:58] [INFO ] [Nat]Absence check using 111 positive place invariants in 19 ms returned sat
[2024-05-28 21:33:58] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 21:33:59] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2024-05-28 21:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:33:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 21:34:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1018 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[305]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[305]
Support contains 305 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 27 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:34:00] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:34:00] [INFO ] Invariant cache hit.
[2024-05-28 21:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 281 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 4 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 209 places in 292 ms of which 4 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 206 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 209 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 204 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 203 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 209 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:34:17] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:34:17] [INFO ] Deduced a trap composed of 206 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:34:17] [INFO ] Deduced a trap composed of 197 places in 318 ms of which 4 ms to minimize.
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 201 places in 295 ms of which 4 ms to minimize.
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 206 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 199 places in 349 ms of which 4 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 204 places in 239 ms of which 3 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 21:34:19] [INFO ] Deduced a trap composed of 197 places in 357 ms of which 5 ms to minimize.
[2024-05-28 21:34:20] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:34:21] [INFO ] Deduced a trap composed of 240 places in 327 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 (/ 1.0 3.0))
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 timeout
0.0)
(s40 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 153 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:34:26] [INFO ] Deduced a trap composed of 196 places in 380 ms of which 5 ms to minimize.
[2024-05-28 21:34:26] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:34:27] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 3 ms to minimize.
[2024-05-28 21:34:27] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:34:27] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:34:28] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:34:28] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:34:28] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 21:34:28] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:34:29] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:34:29] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 3 ms to minimize.
[2024-05-28 21:34:29] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:34:29] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:34:30] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:34:30] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:34:30] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 21:34:31] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:34:31] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:34:31] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:34:31] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 173 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 41/41 constraints]
After SMT, in 42798ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 42811ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42840 ms. Remains : 770/770 places, 1086/1086 transitions.
[2024-05-28 21:34:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:34:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[305]
RANDOM walk for 1000000 steps (52236 resets) in 10476 ms. (95 steps per ms)
BEST_FIRST walk for 941835 steps (3145 resets) in 5001 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[305]
[2024-05-28 21:34:58] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:34:58] [INFO ] Invariant cache hit.
[2024-05-28 21:34:58] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 21:34:58] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2024-05-28 21:34:59] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-05-28 21:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:34:59] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 21:34:59] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 27 ms returned sat
[2024-05-28 21:35:09] [INFO ] [Nat]Absence check using state equation in 10192 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[305]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[305]
Support contains 305 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 19 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:35:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:35:09] [INFO ] Invariant cache hit.
[2024-05-28 21:35:10] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2024-05-28 21:35:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:35:10] [INFO ] Invariant cache hit.
[2024-05-28 21:35:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:35:20] [INFO ] Implicit Places using invariants and state equation in 9537 ms returned []
Implicit Place search using SMT with State Equation took 10623 ms to find 0 implicit places.
[2024-05-28 21:35:20] [INFO ] Redundant transitions in 36 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:35:20] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:35:20] [INFO ] Invariant cache hit.
[2024-05-28 21:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:35:33] [INFO ] Deduced a trap composed of 281 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:35:33] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 4 ms to minimize.
[2024-05-28 21:35:34] [INFO ] Deduced a trap composed of 209 places in 328 ms of which 4 ms to minimize.
[2024-05-28 21:35:34] [INFO ] Deduced a trap composed of 206 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:35:34] [INFO ] Deduced a trap composed of 209 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:35:35] [INFO ] Deduced a trap composed of 204 places in 263 ms of which 4 ms to minimize.
[2024-05-28 21:35:35] [INFO ] Deduced a trap composed of 203 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:35:35] [INFO ] Deduced a trap composed of 197 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:35:36] [INFO ] Deduced a trap composed of 209 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:35:36] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:35:36] [INFO ] Deduced a trap composed of 206 places in 283 ms of which 4 ms to minimize.
[2024-05-28 21:35:37] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 3 ms to minimize.
[2024-05-28 21:35:37] [INFO ] Deduced a trap composed of 201 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:35:37] [INFO ] Deduced a trap composed of 206 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:35:38] [INFO ] Deduced a trap composed of 199 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:35:38] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:35:38] [INFO ] Deduced a trap composed of 204 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:35:38] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:35:39] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 3 ms to minimize.
[2024-05-28 21:35:39] [INFO ] Deduced a trap composed of 201 places in 258 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:35:40] [INFO ] Deduced a trap composed of 240 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:35:41] [INFO ] Deduced a trap composed of 248 places in 264 ms of which 3 ms to minimize.
[2024-05-28 21:35:42] [INFO ] Deduced a trap composed of 211 places in 236 ms of which 3 ms to minimize.
[2024-05-28 21:35:42] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:35:42] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 4 ms to minimize.
[2024-05-28 21:35:42] [INFO ] Deduced a trap composed of 265 places in 278 ms of which 4 ms to minimize.
[2024-05-28 21:35:43] [INFO ] Deduced a trap composed of 233 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:35:43] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 3 ms to minimize.
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:35:44] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 3 ms to minimize.
[2024-05-28 21:35:45] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:35:45] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 3 ms to minimize.
[2024-05-28 21:35:45] [INFO ] Deduced a trap composed of 206 places in 249 ms of which 3 ms to minimize.
[2024-05-28 21:35:45] [INFO ] Deduced a trap composed of 209 places in 259 ms of which 4 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 206 places in 240 ms of which 3 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 199 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:36:04] [INFO ] Deduced a trap composed of 149 places in 348 ms of which 5 ms to minimize.
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 149 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 136 places in 292 ms of which 4 ms to minimize.
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 140 places in 309 ms of which 4 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 136 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 246 places in 412 ms of which 6 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 188 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:36:07] [INFO ] Deduced a trap composed of 239 places in 351 ms of which 6 ms to minimize.
[2024-05-28 21:36:07] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:36:07] [INFO ] Deduced a trap composed of 147 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 210 places in 312 ms of which 4 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 208 places in 308 ms of which 4 ms to minimize.
[2024-05-28 21:36:08] [INFO ] Deduced a trap composed of 202 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:36:09] [INFO ] Deduced a trap composed of 213 places in 279 ms of which 5 ms to minimize.
[2024-05-28 21:36:09] [INFO ] Deduced a trap composed of 212 places in 373 ms of which 5 ms to minimize.
[2024-05-28 21:36:10] [INFO ] Deduced a trap composed of 206 places in 350 ms of which 5 ms to minimize.
[2024-05-28 21:36:10] [INFO ] Deduced a trap composed of 203 places in 369 ms of which 6 ms to minimize.
[2024-05-28 21:36:11] [INFO ] Deduced a trap composed of 240 places in 385 ms of which 6 ms to minimize.
[2024-05-28 21:36:11] [INFO ] Deduced a trap composed of 242 places in 288 ms of which 4 ms to minimize.
[2024-05-28 21:36:12] [INFO ] Deduced a trap composed of 239 places in 405 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62784ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62801ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73496 ms. Remains : 770/770 places, 1086/1086 transitions.
[2024-05-28 21:36:23] [INFO ] Flatten gal took : 217 ms
[2024-05-28 21:36:23] [INFO ] Flatten gal took : 252 ms
[2024-05-28 21:36:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18159160215073763672.gal : 21 ms
[2024-05-28 21:36:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17926322532130968255.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/ReachabilityCardinality18159160215073763672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17926322532130968255.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2117 resets) in 2291 ms. (17 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17926322532130968255.prop.
BEST_FIRST walk for 40003 steps (153 resets) in 914 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 707 ms. (56 steps per ms) remains 2/2 properties
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 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 69
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :69 after 80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :80 after 95
Interrupted probabilistic random walk after 84764 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 2
Probabilistic random walk after 84764 steps, saw 25464 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-28 21:36:27] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:36:27] [INFO ] Invariant cache hit.
[2024-05-28 21:36:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/366 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/654 variables, 48/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/694 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/768 variables, 26/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/366 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/654 variables, 48/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/694 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/768 variables, 26/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1851 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1852/1852 variables, and 909 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3590 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5592ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 305 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 20 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:36:33] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:36:33] [INFO ] Invariant cache hit.
[2024-05-28 21:36:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:36:45] [INFO ] Deduced a trap composed of 281 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:36:45] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 4 ms to minimize.
[2024-05-28 21:36:46] [INFO ] Deduced a trap composed of 209 places in 255 ms of which 4 ms to minimize.
[2024-05-28 21:36:46] [INFO ] Deduced a trap composed of 206 places in 225 ms of which 4 ms to minimize.
[2024-05-28 21:36:46] [INFO ] Deduced a trap composed of 209 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:36:46] [INFO ] Deduced a trap composed of 204 places in 238 ms of which 3 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 203 places in 278 ms of which 3 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 197 places in 267 ms of which 4 ms to minimize.
[2024-05-28 21:36:47] [INFO ] Deduced a trap composed of 209 places in 248 ms of which 4 ms to minimize.
[2024-05-28 21:36:48] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:36:48] [INFO ] Deduced a trap composed of 206 places in 436 ms of which 15 ms to minimize.
[2024-05-28 21:36:48] [INFO ] Deduced a trap composed of 197 places in 287 ms of which 4 ms to minimize.
[2024-05-28 21:36:49] [INFO ] Deduced a trap composed of 201 places in 271 ms of which 3 ms to minimize.
[2024-05-28 21:36:49] [INFO ] Deduced a trap composed of 206 places in 268 ms of which 4 ms to minimize.
[2024-05-28 21:36:49] [INFO ] Deduced a trap composed of 199 places in 296 ms of which 4 ms to minimize.
[2024-05-28 21:36:49] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:36:50] [INFO ] Deduced a trap composed of 204 places in 241 ms of which 3 ms to minimize.
[2024-05-28 21:36:50] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 21:36:50] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:36:51] [INFO ] Deduced a trap composed of 201 places in 270 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:36:52] [INFO ] Deduced a trap composed of 240 places in 296 ms of which 5 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 248 places in 235 ms of which 4 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 211 places in 247 ms of which 4 ms to minimize.
[2024-05-28 21:36:53] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 4 ms to minimize.
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 265 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 4 ms to minimize.
[2024-05-28 21:36:55] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2024-05-28 21:36:56] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
SMT process timed out in 22792ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22824 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2068 resets) in 722 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (143 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 161868 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 161868 steps, saw 47447 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-28 21:36:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:36:59] [INFO ] Invariant cache hit.
[2024-05-28 21:36:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/366 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/654 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/694 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/768 variables, 26/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/366 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/654 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/694 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/768 variables, 26/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1851 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1851 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1852/1852 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9362 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10408ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-07 in 193040 ms.
[2024-05-28 21:37:09] [INFO ] Flatten gal took : 77 ms
[2024-05-28 21:37:09] [INFO ] Applying decomposition
[2024-05-28 21:37:09] [INFO ] Flatten gal took : 49 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/graph8023512990198784489.txt' '-o' '/tmp/graph8023512990198784489.bin' '-w' '/tmp/graph8023512990198784489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8023512990198784489.bin' '-l' '-1' '-v' '-w' '/tmp/graph8023512990198784489.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:10] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:10] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-28 21:37:10] [INFO ] Flatten gal took : 259 ms
[2024-05-28 21:37:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 486 labels/synchronizations in 68 ms.
[2024-05-28 21:37:10] [INFO ] Time to serialize gal into /tmp/UpperBounds12877356181079027737.gal : 33 ms
[2024-05-28 21:37:10] [INFO ] Time to serialize properties into /tmp/UpperBounds4578344250262894285.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/UpperBounds12877356181079027737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4578344250262894285.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 ...284
Loading property file /tmp/UpperBounds4578344250262894285.prop.
ITS-tools command line returned an error code 137
[2024-05-28 21:47:13] [INFO ] Flatten gal took : 59 ms
[2024-05-28 21:47:13] [INFO ] Time to serialize gal into /tmp/UpperBounds3898948911162712080.gal : 9 ms
[2024-05-28 21:47:13] [INFO ] Time to serialize properties into /tmp/UpperBounds9661034925705699687.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/UpperBounds3898948911162712080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9661034925705699687.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 ...304
Loading property file /tmp/UpperBounds9661034925705699687.prop.
ITS-tools command line returned an error code 137
[2024-05-28 21:54:33] [INFO ] Flatten gal took : 53 ms
[2024-05-28 21:54:33] [INFO ] Input system was already deterministic with 1086 transitions.
[2024-05-28 21:54:33] [INFO ] Transformed 770 places.
[2024-05-28 21:54:33] [INFO ] Transformed 1086 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 21:55:03] [INFO ] Time to serialize gal into /tmp/UpperBounds2607341997035918442.gal : 26 ms
[2024-05-28 21:55:03] [INFO ] Time to serialize properties into /tmp/UpperBounds7849582137359640753.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2607341997035918442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7849582137359640753.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7849582137359640753.prop.
ITS-tools command line returned an error code 137
Total runtime 2564508 ms.

BK_STOP 1716933785439

--------------------
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="PolyORBNT-PT-S05J60"
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 PolyORBNT-PT-S05J60, 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 r290-tajo-171654447200469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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