About the Execution of ITS-Tools for ShieldPPPs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.871 | 3600000.00 | 12762201.00 | 5839.80 | ?T???TT?FTTF?TTT | normal |
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-171683761100463.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-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100463
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 349K 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-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716975630121
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 09:40:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 09:40:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 09:40:31] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-29 09:40:31] [INFO ] Transformed 1363 places.
[2024-05-29 09:40:31] [INFO ] Transformed 1263 transitions.
[2024-05-29 09:40:31] [INFO ] Found NUPN structural information;
[2024-05-29 09:40:31] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 1429 ms. (27 steps per ms) remains 7/16 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 7/7 properties
[2024-05-29 09:40:32] [INFO ] Flatten gal took : 174 ms
[2024-05-29 09:40:32] [INFO ] Flatten gal took : 92 ms
[2024-05-29 09:40:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13442335810927007261.gal : 63 ms
BEST_FIRST walk for 40003 steps (8 resets) in 867 ms. (46 steps per ms) remains 7/7 properties
[2024-05-29 09:40:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15714819494058223654.prop : 4 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/ReachabilityCardinality13442335810927007261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15714819494058223654.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality15714819494058223654.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 919 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
// Phase 1: matrix 1263 rows 1363 cols
[2024-05-29 09:40:33] [INFO ] Computed 221 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
At refinement iteration 2 (OVERLAPS) 1088/1317 variables, 210/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 370
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :370 after 438
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :438 after 586
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :586 after 1.09114e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.09114e+08 after 2.32761e+14
At refinement iteration 3 (INCLUDED_ONLY) 0/1317 variables, 1088/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :2.32761e+14 after 1.24355e+32
At refinement iteration 4 (INCLUDED_ONLY) 0/1317 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 46/1363 variables, 11/1538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 46/1584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.24355e+32 after 3.12792e+55
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :3.12792e+55 after 3.12792e+55
At refinement iteration 8 (OVERLAPS) 1263/2626 variables, 1363/2947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :3.12792e+55 after 3.12792e+55
At refinement iteration 9 (INCLUDED_ONLY) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2626/2626 variables, and 2947 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2277 ms.
Refiners :[Domain max(s): 1363/1363 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1363/1363 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1088/1317 variables, 210/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1317 variables, 1088/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 09:40:36] [INFO ] Deduced a trap composed of 19 places in 437 ms of which 64 ms to minimize.
[2024-05-29 09:40:36] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 11 ms to minimize.
[2024-05-29 09:40:37] [INFO ] Deduced a trap composed of 20 places in 346 ms of which 13 ms to minimize.
[2024-05-29 09:40:37] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 4 ms to minimize.
[2024-05-29 09:40:37] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 4 ms to minimize.
[2024-05-29 09:40:38] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 4 ms to minimize.
[2024-05-29 09:40:38] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 7 ms to minimize.
[2024-05-29 09:40:38] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 4 ms to minimize.
[2024-05-29 09:40:38] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 4 ms to minimize.
[2024-05-29 09:40:39] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-05-29 09:40:39] [INFO ] Deduced a trap composed of 31 places in 531 ms of which 3 ms to minimize.
[2024-05-29 09:40:39] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
[2024-05-29 09:40:40] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 2 ms to minimize.
[2024-05-29 09:40:40] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 3 ms to minimize.
[2024-05-29 09:40:40] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:40:40] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:40:40] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:40:40] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
SMT process timed out in 7506ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 229 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1363 transition count 1169
Reduce places removed 94 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 108 rules applied. Total rules applied 202 place count 1269 transition count 1155
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 216 place count 1255 transition count 1155
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 216 place count 1255 transition count 1067
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 392 place count 1167 transition count 1067
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 482 place count 1077 transition count 977
Iterating global reduction 3 with 90 rules applied. Total rules applied 572 place count 1077 transition count 977
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 572 place count 1077 transition count 956
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 614 place count 1056 transition count 956
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1062 place count 832 transition count 732
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 3 with 117 rules applied. Total rules applied 1179 place count 832 transition count 732
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1180 place count 831 transition count 731
Applied a total of 1180 rules in 695 ms. Remains 831 /1363 variables (removed 532) and now considering 731/1263 (removed 532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 831/1363 places, 731/1263 transitions.
RANDOM walk for 40000 steps (15 resets) in 606 ms. (65 steps per ms) remains 6/7 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 6/6 properties
// Phase 1: matrix 731 rows 831 cols
[2024-05-29 09:40:42] [INFO ] Computed 221 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 555/768 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 24/792 variables, 9/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/794 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 715/1509 variables, 794/1001 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1509 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 38/1547 variables, 24/1025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 7/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/1551 variables, 3/1035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1551 variables, 2/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1551 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/1555 variables, 2/1039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1555 variables, 4/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1555 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 7/1562 variables, 7/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1562 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1562 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1562 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 1052 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2381 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 831/831 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 555/768 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:44] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-29 09:40:44] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:40:45] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 11 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:40:46] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 2 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:40:47] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 9 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 09:40:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:40:49] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:40:50] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 13/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 24/792 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:40:51] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:40:52] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:40:52] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:40:52] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/794 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:52] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/794 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/794 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 715/1509 variables, 794/1081 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1509 variables, 3/1084 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:53] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-29 09:40:54] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-29 09:40:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:40:54] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 09:40:54] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:40:54] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:40:54] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:40:55] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:40:55] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1509 variables, 9/1093 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:55] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:40:56] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:40:56] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:40:56] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:40:56] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1509 variables, 5/1098 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:40:57] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:40:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:40:57] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-29 09:40:58] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-29 09:40:58] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:40:58] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:40:58] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:40:58] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1509 variables, 9/1107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:40:59] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1509 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1509 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 38/1547 variables, 24/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1547 variables, 7/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1547 variables, 3/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:00] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:41:00] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:41:01] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1547 variables, 9/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:02] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1547 variables, 1/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1547 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 4/1551 variables, 3/1155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1551 variables, 2/1157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1551 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 4/1555 variables, 2/1159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1555 variables, 4/1163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1555 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 7/1562 variables, 7/1170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1562 variables, 2/1172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:05] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2024-05-29 09:41:06] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:41:06] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:41:06] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:41:06] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:41:06] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:41:06] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1562 variables, 7/1179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:07] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:41:07] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1562 variables, 2/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1562 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 0/1562 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 1181 constraints, problems are : Problem set: 0 solved, 6 unsolved in 24759 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 831/831 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 123/123 constraints]
After SMT, in 27272ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 8033 ms.
Support contains 213 out of 831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 831/831 places, 731/731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 831 transition count 727
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 827 transition count 727
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 827 transition count 725
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 825 transition count 725
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 812 transition count 712
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 812 transition count 712
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 810 transition count 710
Applied a total of 44 rules in 151 ms. Remains 810 /831 variables (removed 21) and now considering 710/731 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 810/831 places, 710/731 transitions.
RANDOM walk for 40000 steps (12 resets) in 460 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 129478 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 129478 steps, saw 118558 distinct states, run finished after 3013 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 710 rows 810 cols
[2024-05-29 09:41:21] [INFO ] Computed 221 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 537/750 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/752 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/754 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 685/1439 variables, 754/953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1439 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 63/1502 variables, 39/992 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1502 variables, 12/1004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1502 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/1505 variables, 3/1007 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1505 variables, 3/1010 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1505 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/1511 variables, 3/1013 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1511 variables, 6/1019 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1511 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 9/1520 variables, 8/1027 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1520 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1520 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1520 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1520/1520 variables, and 1031 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 810/810 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 537/750 variables, 197/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:23] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 3 ms to minimize.
[2024-05-29 09:41:23] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-29 09:41:23] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-29 09:41:23] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-29 09:41:23] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:41:24] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:41:25] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:41:26] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/750 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:41:27] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:41:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/752 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/754 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:41:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/754 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/754 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 685/1439 variables, 754/1023 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1439 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:30] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:41:30] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1439 variables, 2/1027 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:30] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1439 variables, 1/1028 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1439 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 63/1502 variables, 39/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1502 variables, 12/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1502 variables, 4/1083 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:34] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 3 ms to minimize.
[2024-05-29 09:41:34] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 5 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 2 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 3 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-29 09:41:35] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-29 09:41:36] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-05-29 09:41:36] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 2 ms to minimize.
[2024-05-29 09:41:36] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-29 09:41:36] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-05-29 09:41:36] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-29 09:41:37] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-29 09:41:37] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-29 09:41:37] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-29 09:41:37] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 3 ms to minimize.
[2024-05-29 09:41:37] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-29 09:41:37] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1502 variables, 20/1103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:38] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:41:38] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:41:39] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:41:40] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1502 variables, 10/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1502 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 3/1505 variables, 3/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1505 variables, 3/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:41:42] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1505 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1505 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 6/1511 variables, 3/1124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1511 variables, 6/1130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1511 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 9/1520 variables, 8/1138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1520 variables, 4/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:44] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:44] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:41:44] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-29 09:41:45] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:41:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:41:45] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:41:45] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:41:45] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-29 09:41:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1520 variables, 9/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1520 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:47] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 6 ms to minimize.
[2024-05-29 09:41:47] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 3 ms to minimize.
[2024-05-29 09:41:47] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-29 09:41:47] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-29 09:41:48] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-29 09:41:48] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:41:48] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:41:48] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:41:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 36 (OVERLAPS) 0/1520 variables, 9/1160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:41:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1520 variables, 2/1162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:41:50] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1520 variables, 2/1164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:41:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1520 variables, 2/1166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:52] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:41:52] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:41:52] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:41:53] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-29 09:41:54] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:41:54] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1520 variables, 12/1178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:41:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:41:56] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1520 variables, 10/1188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:41:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1520 variables, 4/1192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 09:41:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1520 variables, 1/1193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1520 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (OVERLAPS) 0/1520 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1520/1520 variables, and 1193 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38061 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 810/810 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 156/156 constraints]
After SMT, in 40171ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5363 ms.
Support contains 213 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 710/710 transitions.
Applied a total of 0 rules in 16 ms. Remains 810 /810 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 810/810 places, 710/710 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 710/710 transitions.
Applied a total of 0 rules in 27 ms. Remains 810 /810 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-29 09:42:06] [INFO ] Invariant cache hit.
[2024-05-29 09:42:07] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-05-29 09:42:07] [INFO ] Invariant cache hit.
[2024-05-29 09:42:08] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2024-05-29 09:42:08] [INFO ] Redundant transitions in 32 ms returned []
Running 704 sub problems to find dead transitions.
[2024-05-29 09:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/805 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-29 09:42:15] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2024-05-29 09:42:22] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 704 unsolved
SMT process timed out in 30246ms, After SMT, problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 30256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31719 ms. Remains : 810/810 places, 710/710 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 09:42:38] [INFO ] Flatten gal took : 72 ms
[2024-05-29 09:42:38] [INFO ] Applying decomposition
[2024-05-29 09:42:38] [INFO ] Flatten gal took : 59 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/graph7832895905585125997.txt' '-o' '/tmp/graph7832895905585125997.bin' '-w' '/tmp/graph7832895905585125997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7832895905585125997.bin' '-l' '-1' '-v' '-w' '/tmp/graph7832895905585125997.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:42:38] [INFO ] Decomposing Gal with order
[2024-05-29 09:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:42:39] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 09:42:39] [INFO ] Flatten gal took : 120 ms
[2024-05-29 09:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 09:42:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7589013103291338941.gal : 18 ms
[2024-05-29 09:42:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6943514059443576176.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/ReachabilityCardinality7589013103291338941.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6943514059443576176.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 ...307
Loading property file /tmp/ReachabilityCardinality6943514059443576176.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1135
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1135 after 2.98134e+20
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2.98134e+20 after 1.57074e+42
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :8.20805e+56 after 3.77043e+58
ITS-tools command line returned an error code 137
[2024-05-29 09:50:09] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17512048018194873039
[2024-05-29 09:50:09] [INFO ] Applying decomposition
[2024-05-29 09:50:09] [INFO ] Computing symmetric may disable matrix : 710 transitions.
[2024-05-29 09:50:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:50:09] [INFO ] Flatten gal took : 29 ms
[2024-05-29 09:50:09] [INFO ] Computing symmetric may enable matrix : 710 transitions.
[2024-05-29 09:50:09] [INFO ] Computation of Complete enable matrix. took 1 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/graph14146070843343658975.txt' '-o' '/tmp/graph14146070843343658975.bin' '-w' '/tmp/graph14146070843343658975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14146070843343658975.bin' '-l' '-1' '-v' '-w' '/tmp/graph14146070843343658975.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:50:09] [INFO ] Decomposing Gal with order
[2024-05-29 09:50:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:50:09] [INFO ] Removed a total of 268 redundant transitions.
[2024-05-29 09:50:09] [INFO ] Flatten gal took : 53 ms
[2024-05-29 09:50:09] [INFO ] Computing Do-Not-Accords matrix : 710 transitions.
[2024-05-29 09:50:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 25 ms.
[2024-05-29 09:50:09] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:50:09] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3287120354066875809.gal : 10 ms
[2024-05-29 09:50:09] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12246319374525789356.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/ReachabilityFireability3287120354066875809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12246319374525789356.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
[2024-05-29 09:50:09] [INFO ] Built C files in 311ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17512048018194873039
Running compilation step : cd /tmp/ltsmin17512048018194873039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' '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'
Loading property file /tmp/ReachabilityFireability12246319374525789356.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :6 after 34122
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :34122 after 5.97716e+07
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :5.97716e+07 after 1.30896e+20
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.30896e+20 after 1.58336e+25
Compilation finished in 3038 ms.
Running link step : cd /tmp/ltsmin17512048018194873039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202402==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202402==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202404==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202407==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202407==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202412==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202412==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202400==true'
Detected timeout of ITS tools.
[2024-05-29 10:13:22] [INFO ] Applying decomposition
[2024-05-29 10:13:22] [INFO ] Flatten gal took : 74 ms
[2024-05-29 10:13:22] [INFO ] Decomposing Gal with order
[2024-05-29 10:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:13:22] [INFO ] Removed a total of 288 redundant transitions.
[2024-05-29 10:13:22] [INFO ] Flatten gal took : 141 ms
[2024-05-29 10:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 525 labels/synchronizations in 177 ms.
[2024-05-29 10:13:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5850728920423278686.gal : 53 ms
[2024-05-29 10:13:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3430957559257531487.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/ReachabilityFireability5850728920423278686.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3430957559257531487.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 ...307
Loading property file /tmp/ReachabilityFireability3430957559257531487.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :13 after 51
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :51 after 96
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :96 after 3463
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :3463 after 1.7533e+08
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.7533e+08 after 9.69598e+17
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202402==true'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202402==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202403==true'
ITS-tools command line returned an error code 137
[2024-05-29 10:31:17] [INFO ] Flatten gal took : 47 ms
[2024-05-29 10:31:17] [INFO ] Input system was already deterministic with 710 transitions.
[2024-05-29 10:31:17] [INFO ] Transformed 810 places.
[2024-05-29 10:31:17] [INFO ] Transformed 710 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 10:31:17] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3455477776285909598.gal : 3 ms
[2024-05-29 10:31:17] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10285863070073913986.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/ReachabilityFireability3455477776285909598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10285863070073913986.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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability10285863070073913986.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 96
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :96 after 13840
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :13840 after 8.76649e+07
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :8.76649e+07 after 4.61713e+15
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4.61713e+15 after 4.83675e+20
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin17512048018194873039;'/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' 'ShieldPPPsPT020BReachabilityFireability202404==true'
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761100463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;