Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761200478.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761200478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 528K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2023-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716980367153

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 10:59:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 10:59:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:59:28] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-29 10:59:28] [INFO ] Transformed 2043 places.
[2024-05-29 10:59:28] [INFO ] Transformed 1893 transitions.
[2024-05-29 10:59:28] [INFO ] Found NUPN structural information;
[2024-05-29 10:59:28] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1820 ms. (21 steps per ms) remains 3/13 properties
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 3/3 properties
[2024-05-29 10:59:29] [INFO ] Flatten gal took : 347 ms
BEST_FIRST walk for 40003 steps (8 resets) in 424 ms. (94 steps per ms) remains 3/3 properties
[2024-05-29 10:59:29] [INFO ] Flatten gal took : 182 ms
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 3/3 properties
[2024-05-29 10:59:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1223845512006579643.gal : 71 ms
[2024-05-29 10:59:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4386521029753410779.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/ReachabilityCardinality1223845512006579643.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4386521029753410779.prop' '--nowitness' '--gen-order' 'FOLLOW'

// Phase 1: matrix 1893 rows 2043 cols
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2024-05-29 10:59:30] [INFO ] Computed 331 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality4386521029753410779.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 990/1042 variables, 147/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 990/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1001/2043 variables, 184/1373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2043 variables, 1001/2374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2043 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1893/3936 variables, 2043/4417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3936 variables, 0/4417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3936 variables, 0/4417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3936/3936 variables, and 4417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1795 ms.
Refiners :[Domain max(s): 2043/2043 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2043/2043 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 990/1042 variables, 147/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 134
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 990/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :134 after 412
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :412 after 596
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :596 after 1.09114e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.09114e+08 after 3.78237e+15
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.78237e+15 after 1.08284e+33
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.08284e+33 after 5.69741e+70
[2024-05-29 10:59:32] [INFO ] Deduced a trap composed of 15 places in 341 ms of which 41 ms to minimize.
[2024-05-29 10:59:33] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 16 ms to minimize.
[2024-05-29 10:59:33] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-29 10:59:33] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 15 ms to minimize.
[2024-05-29 10:59:33] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-05-29 10:59:33] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-29 10:59:34] [INFO ] Deduced a trap composed of 39 places in 321 ms of which 31 ms to minimize.
[2024-05-29 10:59:34] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-05-29 10:59:34] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-29 10:59:34] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 15 ms to minimize.
[2024-05-29 10:59:35] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 3 ms to minimize.
[2024-05-29 10:59:35] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 12/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1042 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1001/2043 variables, 184/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2043 variables, 1001/2386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 10:59:36] [INFO ] Deduced a trap composed of 21 places in 402 ms of which 5 ms to minimize.
[2024-05-29 10:59:36] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 5 ms to minimize.
[2024-05-29 10:59:36] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 5 ms to minimize.
SMT process timed out in 7016ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2043 transition count 1693
Reduce places removed 200 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 205 rules applied. Total rules applied 405 place count 1843 transition count 1688
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 410 place count 1838 transition count 1688
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 410 place count 1838 transition count 1543
Deduced a syphon composed of 145 places in 3 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 700 place count 1693 transition count 1543
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 898 place count 1495 transition count 1345
Iterating global reduction 3 with 198 rules applied. Total rules applied 1096 place count 1495 transition count 1345
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 1096 place count 1495 transition count 1265
Deduced a syphon composed of 80 places in 24 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1256 place count 1415 transition count 1265
Performed 426 Post agglomeration using F-continuation condition.Transition count delta: 426
Deduced a syphon composed of 426 places in 1 ms
Reduce places removed 426 places and 0 transitions.
Iterating global reduction 3 with 852 rules applied. Total rules applied 2108 place count 989 transition count 839
Partial Free-agglomeration rule applied 251 times.
Drop transitions (Partial Free agglomeration) removed 251 transitions
Iterating global reduction 3 with 251 rules applied. Total rules applied 2359 place count 989 transition count 839
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2360 place count 988 transition count 838
Applied a total of 2360 rules in 811 ms. Remains 988 /2043 variables (removed 1055) and now considering 838/1893 (removed 1055) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 988/2043 places, 838/1893 transitions.
RANDOM walk for 40000 steps (9 resets) in 884 ms. (45 steps per ms) remains 1/3 properties
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 1/1 properties
// Phase 1: matrix 838 rows 988 cols
[2024-05-29 10:59:38] [INFO ] Computed 331 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 366/391 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/455 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/465 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 465/930 variables, 465/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 264/1194 variables, 144/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1194 variables, 38/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1194 variables, 2/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1194 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/1205 variables, 11/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1205 variables, 11/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1205 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1217 variables, 6/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1217 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1217 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1221 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 2/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1221 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 224/1445 variables, 122/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1445 variables, 25/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1445 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 12/1457 variables, 13/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1457 variables, 12/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1457 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 18/1475 variables, 9/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1475 variables, 16/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1475 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 149/1624 variables, 89/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1624 variables, 25/1145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1624 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 10/1634 variables, 8/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1634 variables, 6/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1634 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1642 variables, 4/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1642 variables, 2/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1642 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 2/1644 variables, 1/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1644 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 98/1742 variables, 57/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1742 variables, 9/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1742 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 8/1750 variables, 8/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1750 variables, 6/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1750 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 28/1778 variables, 11/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1778 variables, 7/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1778 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 44/1822 variables, 43/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1822 variables, 7/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1822 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/1826 variables, 4/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1826 variables, 1/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1826 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 0/1826 variables, 0/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1826/1826 variables, and 1319 constraints, problems are : Problem set: 0 solved, 1 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 321/321 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 988/988 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 366/391 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 64/455 variables, 22/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 10:59:39] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/465 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 465/930 variables, 465/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 10:59:40] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/930 variables, 9/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/930 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 264/1194 variables, 144/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1194 variables, 38/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1194 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1194 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:41] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 6 ms to minimize.
[2024-05-29 10:59:41] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 3 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 3 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 10:59:44] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1194 variables, 20/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:44] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1194 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1194 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/1205 variables, 11/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1205 variables, 11/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:44] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1205 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1205 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/1217 variables, 6/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1217 variables, 2/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1217 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/1221 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1221 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1221 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 224/1445 variables, 122/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1445 variables, 25/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 10 ms to minimize.
[2024-05-29 10:59:44] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1445 variables, 5/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1445 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 12/1457 variables, 13/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1457 variables, 12/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1457 variables, 6/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1457 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 18/1475 variables, 9/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1475 variables, 16/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1475 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 149/1624 variables, 89/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1624 variables, 25/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1624 variables, 4/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1624 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/1634 variables, 8/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1634 variables, 6/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1634 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 8/1642 variables, 4/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1642 variables, 2/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1642 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/1644 variables, 1/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1644 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 98/1742 variables, 57/1279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1742 variables, 9/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:47] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-29 10:59:47] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-29 10:59:47] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1742 variables, 3/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1742 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 8/1750 variables, 8/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1750 variables, 6/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1750 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 28/1778 variables, 11/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1778 variables, 7/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:48] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-29 10:59:48] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1778 variables, 2/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1778 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 44/1822 variables, 43/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1822 variables, 7/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:48] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-29 10:59:48] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-29 10:59:49] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-29 10:59:50] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 3 ms to minimize.
[2024-05-29 10:59:50] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-29 10:59:50] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-29 10:59:50] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-29 10:59:50] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-29 10:59:50] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1822 variables, 15/1390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1822 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 4/1826 variables, 4/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1826 variables, 1/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1826 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 0/1826 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1826/1826 variables, and 1395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12150 ms.
Refiners :[Positive P Invariants (semi-flows): 321/321 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 988/988 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 75/75 constraints]
After SMT, in 13011ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 546 ms.
Support contains 25 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 838/838 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 988 transition count 835
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 985 transition count 835
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 985 transition count 829
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 979 transition count 829
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 54 place count 961 transition count 811
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 961 transition count 811
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 959 transition count 809
Applied a total of 62 rules in 211 ms. Remains 959 /988 variables (removed 29) and now considering 809/838 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 959/988 places, 809/838 transitions.
RANDOM walk for 40000 steps (8 resets) in 689 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206759 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206759 steps, saw 145693 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 809 rows 959 cols
[2024-05-29 10:59:55] [INFO ] Computed 331 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/375 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/436 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/452 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 452/904 variables, 452/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/904 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 261/1165 variables, 144/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1165 variables, 39/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1165 variables, 4/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1165 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1172 variables, 7/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1172 variables, 7/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1172 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/1182 variables, 5/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1182 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1182 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1188 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1188 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1188 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1189 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1189 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1189 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 222/1411 variables, 122/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1411 variables, 27/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1411 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 9/1420 variables, 10/977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1420 variables, 9/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1420 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 10/1430 variables, 5/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1430 variables, 10/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1430 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/1438 variables, 4/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1438 variables, 6/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1438 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/1439 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1439 variables, 1/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1439 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 144/1583 variables, 88/1101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1583 variables, 27/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1583 variables, 1/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1583 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 5/1588 variables, 5/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1588 variables, 5/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1588 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 8/1596 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1596 variables, 2/1145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1596 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/1598 variables, 1/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1598 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 93/1691 variables, 53/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1691 variables, 12/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1691 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 4/1695 variables, 5/1216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1695 variables, 4/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1695 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 4/1699 variables, 2/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1699 variables, 4/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1699 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 47/1746 variables, 31/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1746 variables, 10/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1746 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 1/1747 variables, 1/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1747 variables, 1/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1747 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2/1749 variables, 1/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1749 variables, 2/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1749 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 17/1766 variables, 11/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1766 variables, 4/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1766 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/1768 variables, 2/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1768 variables, 1/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1768 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 0/1768 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1768/1768 variables, and 1290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 310/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 959/959 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/375 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:56] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:59:56] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-29 10:59:56] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 10:59:57] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 17/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 61/436 variables, 22/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/452 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 452/904 variables, 452/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-29 10:59:58] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/904 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/904 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 261/1165 variables, 144/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1165 variables, 39/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1165 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1165 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:59:59] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-29 10:59:59] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-29 10:59:59] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2024-05-29 10:59:59] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 10:59:59] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1165 variables, 5/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1165 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1172 variables, 7/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 7/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:00:00] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1172 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1172 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/1182 variables, 5/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1182 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1182 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1188 variables, 3/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1188 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1188 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/1189 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1189 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1189 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 222/1411 variables, 122/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1411 variables, 27/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1411 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 9/1420 variables, 10/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1420 variables, 9/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1420 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 10/1430 variables, 5/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1430 variables, 10/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1430 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 8/1438 variables, 4/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1438 variables, 6/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1438 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1/1439 variables, 1/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1439 variables, 1/1043 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1439 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 144/1583 variables, 88/1131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1583 variables, 27/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1583 variables, 1/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:00:01] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:00:01] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:00:01] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:00:01] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:00:01] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:00:02] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:00:02] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1583 variables, 7/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1583 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 5/1588 variables, 5/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1588 variables, 5/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1588 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 8/1596 variables, 4/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1596 variables, 2/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1596 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/1598 variables, 1/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1598 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 93/1691 variables, 53/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1691 variables, 12/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:00:02] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1691 variables, 1/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1691 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 4/1695 variables, 5/1254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1695 variables, 4/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1695 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 4/1699 variables, 2/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1699 variables, 4/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1699 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 47/1746 variables, 31/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1746 variables, 10/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:00:03] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:00:03] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/1746 variables, 2/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1746 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 1/1747 variables, 1/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1747 variables, 1/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1747 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 2/1749 variables, 1/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1749 variables, 2/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:00:03] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/1749 variables, 1/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1749 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 17/1766 variables, 11/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1766 variables, 4/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:00:03] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-29 11:00:04] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/1766 variables, 2/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1766 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/1768 variables, 2/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1768 variables, 1/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1768 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 0/1768 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1768/1768 variables, and 1333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7763 ms.
Refiners :[Positive P Invariants (semi-flows): 310/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 959/959 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 9085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 260 ms.
Support contains 25 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 809/809 transitions.
Applied a total of 0 rules in 69 ms. Remains 959 /959 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 959/959 places, 809/809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 809/809 transitions.
Applied a total of 0 rules in 61 ms. Remains 959 /959 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-29 11:00:04] [INFO ] Invariant cache hit.
[2024-05-29 11:00:05] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-29 11:00:05] [INFO ] Invariant cache hit.
[2024-05-29 11:00:06] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2024-05-29 11:00:06] [INFO ] Redundant transitions in 37 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-29 11:00:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/951 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/951 variables, 21/196 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-29 11:00:18] [INFO ] Deduced a trap composed of 7 places in 707 ms of which 1 ms to minimize.
[2024-05-29 11:00:19] [INFO ] Deduced a trap composed of 7 places in 713 ms of which 2 ms to minimize.
[2024-05-29 11:00:21] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:00:22] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-29 11:00:22] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 11:00:22] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 11:00:22] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:00:22] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 11:00:23] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 11:00:25] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 2 ms to minimize.
[2024-05-29 11:00:25] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 11:00:25] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:00:25] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 11:00:26] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:00:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:00:29] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/951 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-29 11:00:35] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/1768 variables, and 217 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 175/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/959 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/951 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/951 variables, 21/196 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/951 variables, 21/217 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-29 11:00:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:00:45] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/951 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-29 11:00:57] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:00:57] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:00:57] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/951 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/1768 variables, and 222 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 175/310 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/959 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 26/26 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62223 ms. Remains : 959/959 places, 809/809 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 11:01:07] [INFO ] Flatten gal took : 76 ms
[2024-05-29 11:01:07] [INFO ] Applying decomposition
[2024-05-29 11:01:07] [INFO ] Flatten gal took : 69 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/graph14834863797689620618.txt' '-o' '/tmp/graph14834863797689620618.bin' '-w' '/tmp/graph14834863797689620618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14834863797689620618.bin' '-l' '-1' '-v' '-w' '/tmp/graph14834863797689620618.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:01:07] [INFO ] Decomposing Gal with order
[2024-05-29 11:01:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:01:08] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-29 11:01:08] [INFO ] Flatten gal took : 217 ms
[2024-05-29 11:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2024-05-29 11:01:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12245120063239667015.gal : 26 ms
[2024-05-29 11:01:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17585270884549050096.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/ReachabilityCardinality12245120063239667015.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17585270884549050096.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17585270884549050096.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 6687
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6687 after 11919
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :11919 after 1.86278e+15
ITS-tools command line returned an error code 137
[2024-05-29 11:16:10] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3511869021213409341
[2024-05-29 11:16:10] [INFO ] Applying decomposition
[2024-05-29 11:16:10] [INFO ] Computing symmetric may disable matrix : 809 transitions.
[2024-05-29 11:16:10] [INFO ] Flatten gal took : 33 ms
[2024-05-29 11:16:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:16:10] [INFO ] Computing symmetric may enable matrix : 809 transitions.
[2024-05-29 11:16:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph4465757887710117062.txt' '-o' '/tmp/graph4465757887710117062.bin' '-w' '/tmp/graph4465757887710117062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4465757887710117062.bin' '-l' '-1' '-v' '-w' '/tmp/graph4465757887710117062.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:16:10] [INFO ] Decomposing Gal with order
[2024-05-29 11:16:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:16:10] [INFO ] Computing Do-Not-Accords matrix : 809 transitions.
[2024-05-29 11:16:10] [INFO ] Removed a total of 389 redundant transitions.
[2024-05-29 11:16:10] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:16:10] [INFO ] Flatten gal took : 71 ms
[2024-05-29 11:16:10] [INFO ] Built C files in 297ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3511869021213409341
Running compilation step : cd /tmp/ltsmin3511869021213409341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 11:16:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 713 labels/synchronizations in 54 ms.
[2024-05-29 11:16:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7584498651581871624.gal : 16 ms
[2024-05-29 11:16:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality124728308528279661.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/ReachabilityCardinality7584498651581871624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality124728308528279661.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality124728308528279661.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 594
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.08812e+08 after 9.75211e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.75211e+11 after 8.51172e+34
Compilation finished in 3027 ms.
Running link step : cd /tmp/ltsmin3511869021213409341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3511869021213409341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT030BReachabilityCardinality202305==true'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.51172e+34 after 5.69033e+36
Detected timeout of ITS tools.
[2024-05-29 11:41:44] [INFO ] Applying decomposition
[2024-05-29 11:41:44] [INFO ] Flatten gal took : 108 ms
[2024-05-29 11:41:44] [INFO ] Decomposing Gal with order
[2024-05-29 11:41:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:41:44] [INFO ] Removed a total of 651 redundant transitions.
[2024-05-29 11:41:44] [INFO ] Flatten gal took : 184 ms
[2024-05-29 11:41:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 960 labels/synchronizations in 261 ms.
[2024-05-29 11:41:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14111711771782010992.gal : 58 ms
[2024-05-29 11:41:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3814631958640293051.prop : 18 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/ReachabilityCardinality14111711771782010992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3814631958640293051.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/ReachabilityCardinality3814631958640293051.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 132
ITS-tools command line returned an error code 137
[2024-05-29 11:59:07] [INFO ] Flatten gal took : 163 ms
[2024-05-29 11:59:07] [INFO ] Input system was already deterministic with 809 transitions.
[2024-05-29 11:59:07] [INFO ] Transformed 959 places.
[2024-05-29 11:59:07] [INFO ] Transformed 809 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-29 11:59:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14262457587418723733.gal : 5 ms
[2024-05-29 11:59:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15279499159491215539.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14262457587418723733.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15279499159491215539.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 ...375
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality15279499159491215539.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 57
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :57 after 310
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :310 after 2698
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2698 after 4766
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4766 after 75346
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :75346 after 922814
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :922814 after 1.93878e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.93878e+07 after 3.2714e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.2714e+07 after 1.26578e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.26578e+11 after 2.00762e+11
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.00762e+11 after 4.2571e+14

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761200478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;