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-171683760500158.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 ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 846K 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 ShieldIIPs-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2023-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716917371214

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 17:29:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:29:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:29:32] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-28 17:29:32] [INFO ] Transformed 3003 places.
[2024-05-28 17:29:32] [INFO ] Transformed 2953 transitions.
[2024-05-28 17:29:32] [INFO ] Found NUPN structural information;
[2024-05-28 17:29:32] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2324 ms. (17 steps per ms) remains 4/13 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 17:29:33] [INFO ] Flatten gal took : 387 ms
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
[2024-05-28 17:29:33] [INFO ] Flatten gal took : 262 ms
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
[2024-05-28 17:29:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6173794490641712335.gal : 73 ms
[2024-05-28 17:29:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11942973092856301589.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/ReachabilityCardinality6173794490641712335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11942973092856301589.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 2953 rows 3003 cols

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-28 17:29:34] [INFO ] Computed 451 invariants in 57 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality11942973092856301589.prop.
At refinement iteration 2 (OVERLAPS) 846/913 variables, 98/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/913 variables, 846/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/913 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2090/3003 variables, 353/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3003 variables, 2090/3454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 0/3454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2953/5956 variables, 3003/6457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5956/5956 variables, and 6457 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2853 ms.
Refiners :[Domain max(s): 3003/3003 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3003/3003 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 846/913 variables, 98/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/913 variables, 846/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 17:29:37] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 20 ms to minimize.
[2024-05-28 17:29:37] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:29:37] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 3 ms to minimize.
[2024-05-28 17:29:37] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 9 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/913 variables, 9/1020 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/913 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2090/3003 variables, 353/1373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 2090/3463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 73
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :73 after 432
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :432 after 616
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :616 after 1.18742e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.18742e+08 after 5.73678e+13
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5.73678e+13 after 5.07018e+29
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5.07018e+29 after 3.24054e+60
[2024-05-28 17:29:39] [INFO ] Deduced a trap composed of 23 places in 687 ms of which 13 ms to minimize.
[2024-05-28 17:29:40] [INFO ] Deduced a trap composed of 43 places in 660 ms of which 10 ms to minimize.
[2024-05-28 17:29:41] [INFO ] Deduced a trap composed of 26 places in 658 ms of which 10 ms to minimize.
[2024-05-28 17:29:42] [INFO ] Deduced a trap composed of 22 places in 655 ms of which 11 ms to minimize.
[2024-05-28 17:29:42] [INFO ] Deduced a trap composed of 24 places in 660 ms of which 11 ms to minimize.
SMT process timed out in 8639ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 3003 transition count 2719
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 2769 transition count 2714
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 478 place count 2764 transition count 2714
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 478 place count 2764 transition count 2467
Deduced a syphon composed of 247 places in 6 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 972 place count 2517 transition count 2467
Discarding 332 places :
Symmetric choice reduction at 3 with 332 rule applications. Total rules 1304 place count 2185 transition count 2135
Iterating global reduction 3 with 332 rules applied. Total rules applied 1636 place count 2185 transition count 2135
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1636 place count 2185 transition count 2003
Deduced a syphon composed of 132 places in 15 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 1900 place count 2053 transition count 2003
Performed 725 Post agglomeration using F-continuation condition.Transition count delta: 725
Deduced a syphon composed of 725 places in 11 ms
Reduce places removed 725 places and 0 transitions.
Iterating global reduction 3 with 1450 rules applied. Total rules applied 3350 place count 1328 transition count 1278
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 329 times.
Drop transitions (Partial Free agglomeration) removed 329 transitions
Iterating global reduction 3 with 329 rules applied. Total rules applied 3679 place count 1328 transition count 1278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3680 place count 1327 transition count 1277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3681 place count 1326 transition count 1277
Applied a total of 3681 rules in 1085 ms. Remains 1326 /3003 variables (removed 1677) and now considering 1277/2953 (removed 1676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 1326/3003 places, 1277/2953 transitions.
RANDOM walk for 40000 steps (8 resets) in 947 ms. (42 steps per ms) remains 2/4 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 477 ms. (83 steps per ms) remains 2/2 properties
// Phase 1: matrix 1277 rows 1326 cols
[2024-05-28 17:29:44] [INFO ] Computed 450 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/161 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1110/1271 variables, 389/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1271 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/1281 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1236/2517 variables, 1281/1716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2517 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/2541 variables, 12/1728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2541 variables, 4/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2541 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/2561 variables, 10/1742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2561 variables, 4/1746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2561 variables, 0/1746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 25/2586 variables, 11/1757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2586 variables, 2/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2586 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/2588 variables, 1/1760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2588 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 10/2598 variables, 8/1768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2598 variables, 1/1769 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2598 variables, 1/1770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2598 variables, 0/1770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/2600 variables, 1/1771 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2600 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 3/2603 variables, 4/1775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2603 variables, 1/1776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2603 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/2603 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2603/2603 variables, and 1776 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 444/444 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1326/1326 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/161 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1110/1271 variables, 389/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:29:46] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 5 ms to minimize.
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1271 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/1281 variables, 5/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:47] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1281 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1236/2517 variables, 1281/1738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2517 variables, 1/1739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:48] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 4 ms to minimize.
[2024-05-28 17:29:48] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
[2024-05-28 17:29:49] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-28 17:29:49] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 4 ms to minimize.
[2024-05-28 17:29:49] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 3 ms to minimize.
[2024-05-28 17:29:49] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:29:49] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-05-28 17:29:50] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-05-28 17:29:50] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 5 ms to minimize.
[2024-05-28 17:29:50] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2024-05-28 17:29:50] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-05-28 17:29:50] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 4 ms to minimize.
[2024-05-28 17:29:51] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 4 ms to minimize.
[2024-05-28 17:29:51] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:29:51] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 4 ms to minimize.
[2024-05-28 17:29:51] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2024-05-28 17:29:51] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 3 ms to minimize.
[2024-05-28 17:29:52] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 4 ms to minimize.
[2024-05-28 17:29:52] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-28 17:29:52] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2517 variables, 20/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:52] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-05-28 17:29:52] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:29:53] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-05-28 17:29:53] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:29:53] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:29:53] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:29:53] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:29:54] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:29:54] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2517 variables, 9/1768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2517 variables, 0/1768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 24/2541 variables, 12/1780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2541 variables, 4/1784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2541 variables, 1/1785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:54] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 4 ms to minimize.
[2024-05-28 17:29:54] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:29:55] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:29:55] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:29:55] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-05-28 17:29:55] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:29:55] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:29:56] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:29:56] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:29:56] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:29:56] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:29:56] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:29:56] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2541 variables, 13/1798 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:29:57] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2541 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2541 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 20/2561 variables, 10/1809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2561 variables, 4/1813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2561 variables, 0/1813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 25/2586 variables, 11/1824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2586 variables, 2/1826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2586 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/2588 variables, 1/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2588 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 10/2598 variables, 8/1835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2598 variables, 1/1836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2598 variables, 1/1837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2598 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 2/2600 variables, 1/1838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2600 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 3/2603 variables, 4/1842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2603 variables, 1/1843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2603 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 0/2603 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2603/2603 variables, and 1843 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12624 ms.
Refiners :[Positive P Invariants (semi-flows): 444/444 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1326/1326 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 65/65 constraints]
After SMT, in 13967ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2564 ms.
Support contains 27 out of 1326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1326/1326 places, 1277/1277 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1326 transition count 1269
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1318 transition count 1269
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 1318 transition count 1261
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 1310 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1309 transition count 1260
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 1309 transition count 1260
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 90 place count 1281 transition count 1232
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 1281 transition count 1232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1280 transition count 1231
Applied a total of 98 rules in 342 ms. Remains 1280 /1326 variables (removed 46) and now considering 1231/1277 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 1280/1326 places, 1231/1277 transitions.
RANDOM walk for 40000 steps (8 resets) in 768 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 136285 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 136285 steps, saw 78930 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 1231 rows 1280 cols
[2024-05-28 17:30:04] [INFO ] Computed 450 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/150 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/188 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 326/514 variables, 188/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 545/1059 variables, 267/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 87/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1059 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1063 variables, 4/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1063 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1063 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/1067 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1067 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1067 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1071 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1071 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1071 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 521/1592 variables, 271/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1592 variables, 78/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1592 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 14/1606 variables, 23/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1606 variables, 14/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1606 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 10/1616 variables, 5/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1616 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 397/2013 variables, 217/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2013 variables, 63/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2013 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 12/2025 variables, 14/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2025 variables, 12/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2025 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 18/2043 variables, 9/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2043 variables, 18/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2043 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/2045 variables, 1/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2045 variables, 2/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2045 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 218/2263 variables, 122/1468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2263 variables, 43/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2263 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2263 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 3/2266 variables, 4/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2266 variables, 3/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2266 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/2268 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2268 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 134/2402 variables, 76/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2402 variables, 20/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2402 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 6/2408 variables, 9/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2408 variables, 6/1631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2408 variables, 0/1631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/2414 variables, 3/1634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2414 variables, 6/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2414 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 70/2484 variables, 44/1684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2484 variables, 17/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2484 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 1/2485 variables, 1/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2485 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2485 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 2/2487 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2487 variables, 2/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2487 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 18/2505 variables, 12/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2505 variables, 3/1721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2505 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 1/2506 variables, 2/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2506 variables, 1/1724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2506 variables, 0/1724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 5/2511 variables, 4/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2511 variables, 2/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2511 variables, 0/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 0/2511 variables, 0/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2511/2511 variables, and 1730 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 446/446 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1280/1280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/150 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/188 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 326/514 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 545/1059 variables, 267/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 87/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1059 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-28 17:30:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1059 variables, 12/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1059 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1059 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/1063 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1063 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1063 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1067 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1067 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1067 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1071 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1071 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1071 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 521/1592 variables, 271/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1592 variables, 78/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:30:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1592 variables, 4/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1592 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 14/1606 variables, 23/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1606 variables, 14/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1606 variables, 1/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1606 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1606 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 10/1616 variables, 5/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1616 variables, 4/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1616 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 397/2013 variables, 217/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2013 variables, 63/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:30:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/2013 variables, 4/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2013 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 12/2025 variables, 14/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2025 variables, 12/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2025 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 18/2043 variables, 9/1353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2043 variables, 18/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2043 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 2/2045 variables, 1/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2045 variables, 2/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:09] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:30:09] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/2045 variables, 2/1376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2045 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 218/2263 variables, 122/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2263 variables, 43/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2263 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:09] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:30:09] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:30:09] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/2263 variables, 3/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:09] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:30:10] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/2263 variables, 2/1547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:10] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/2263 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2263 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 3/2266 variables, 4/1552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2266 variables, 3/1555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:10] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/2266 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:10] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/2266 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2266 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 2/2268 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2268 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 134/2402 variables, 76/1634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2402 variables, 20/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:10] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:30:11] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:30:11] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-28 17:30:11] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/2402 variables, 4/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2402 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 6/2408 variables, 9/1667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2408 variables, 6/1673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2408 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 6/2414 variables, 3/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2414 variables, 6/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2414 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 70/2484 variables, 44/1726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2484 variables, 17/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:11] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:30:11] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:30:11] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/2484 variables, 3/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:12] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/2484 variables, 1/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2484 variables, 0/1747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 1/2485 variables, 1/1748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2485 variables, 1/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2485 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/2487 variables, 1/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2487 variables, 2/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2487 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 18/2505 variables, 12/1764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2505 variables, 3/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:12] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/2505 variables, 1/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:12] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/2505 variables, 1/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2505 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 1/2506 variables, 2/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2506 variables, 1/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2506 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 5/2511 variables, 4/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2511 variables, 2/1778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:30:13] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-28 17:30:13] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-28 17:30:13] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:30:13] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:30:13] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
At refinement iteration 95 (INCLUDED_ONLY) 0/2511 variables, 5/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2511 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 0/2511 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2511/2511 variables, and 1783 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7993 ms.
Refiners :[Positive P Invariants (semi-flows): 446/446 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1280/1280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 52/52 constraints]
After SMT, in 9254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 458 ms.
Support contains 27 out of 1280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 33 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2024-05-28 17:30:14] [INFO ] Invariant cache hit.
[2024-05-28 17:30:15] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-28 17:30:15] [INFO ] Invariant cache hit.
[2024-05-28 17:30:16] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2128 ms to find 0 implicit places.
[2024-05-28 17:30:16] [INFO ] Redundant transitions in 82 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-28 17:30:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1272 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1272 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-28 17:30:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 17:30:41] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 17:30:45] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
[2024-05-28 17:30:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 17:30:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
SMT process timed out in 30455ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 30473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32733 ms. Remains : 1280/1280 places, 1231/1231 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 17:30:47] [INFO ] Flatten gal took : 97 ms
[2024-05-28 17:30:47] [INFO ] Applying decomposition
[2024-05-28 17:30:47] [INFO ] Flatten gal took : 87 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/graph10611889258041216642.txt' '-o' '/tmp/graph10611889258041216642.bin' '-w' '/tmp/graph10611889258041216642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10611889258041216642.bin' '-l' '-1' '-v' '-w' '/tmp/graph10611889258041216642.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:30:47] [INFO ] Decomposing Gal with order
[2024-05-28 17:30:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:30:48] [INFO ] Removed a total of 1150 redundant transitions.
[2024-05-28 17:30:48] [INFO ] Flatten gal took : 269 ms
[2024-05-28 17:30:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2024-05-28 17:30:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14171612196637602413.gal : 39 ms
[2024-05-28 17:30:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15668154328443022092.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/ReachabilityCardinality14171612196637602413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15668154328443022092.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15668154328443022092.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.25326e+06 after 7.2312e+11
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.98211e+138 after 9.55127e+138
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.52424e+140 after 4.60217e+140
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.60217e+140 after 9.8513e+140
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.8513e+140 after 9.8513e+140
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.8513e+140 after 9.8513e+140
ITS-tools command line returned an error code 137
[2024-05-28 17:41:32] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7530923969243579394
[2024-05-28 17:41:32] [INFO ] Applying decomposition
[2024-05-28 17:41:32] [INFO ] Computing symmetric may disable matrix : 1231 transitions.
[2024-05-28 17:41:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:41:32] [INFO ] Computing symmetric may enable matrix : 1231 transitions.
[2024-05-28 17:41:32] [INFO ] Flatten gal took : 55 ms
[2024-05-28 17:41:32] [INFO ] Computation of Complete enable matrix. took 25 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/graph231322539012321628.txt' '-o' '/tmp/graph231322539012321628.bin' '-w' '/tmp/graph231322539012321628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph231322539012321628.bin' '-l' '-1' '-v' '-w' '/tmp/graph231322539012321628.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:41:33] [INFO ] Decomposing Gal with order
[2024-05-28 17:41:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:41:33] [INFO ] Removed a total of 969 redundant transitions.
[2024-05-28 17:41:33] [INFO ] Flatten gal took : 105 ms
[2024-05-28 17:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1129 labels/synchronizations in 33 ms.
[2024-05-28 17:41:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14157465714031867554.gal : 25 ms
[2024-05-28 17:41:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11779391982627687272.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/ReachabilityCardinality14157465714031867554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11779391982627687272.prop' '--nowitness'

[2024-05-28 17:41:33] [INFO ] Computing Do-Not-Accords matrix : 1231 transitions.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2024-05-28 17:41:33] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:41:33] [INFO ] Built C files in 624ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7530923969243579394
Running compilation step : cd /tmp/ltsmin7530923969243579394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality11779391982627687272.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6 after 6
Compilation finished in 5215 ms.
Running link step : cd /tmp/ltsmin7530923969243579394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin7530923969243579394;'/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' 'ShieldIIPsPT050BReachabilityCardinality202304==true'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6 after 108
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.21974e+09 after 1.21974e+09
Detected timeout of ITS tools.
[2024-05-28 18:05:34] [INFO ] Applying decomposition
[2024-05-28 18:05:34] [INFO ] Flatten gal took : 132 ms
[2024-05-28 18:05:34] [INFO ] Decomposing Gal with order
[2024-05-28 18:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:05:35] [INFO ] Removed a total of 1131 redundant transitions.
[2024-05-28 18:05:35] [INFO ] Flatten gal took : 265 ms
[2024-05-28 18:05:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2450 labels/synchronizations in 283 ms.
[2024-05-28 18:05:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10838570890608117926.gal : 61 ms
[2024-05-28 18:05:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6067425886810213892.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/ReachabilityCardinality10838570890608117926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6067425886810213892.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6067425886810213892.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207360 after 5.86269e+14
ITS-tools command line returned an error code 137
[2024-05-28 18:26:24] [INFO ] Flatten gal took : 102 ms
[2024-05-28 18:26:24] [INFO ] Input system was already deterministic with 1231 transitions.
[2024-05-28 18:26:24] [INFO ] Transformed 1280 places.
[2024-05-28 18:26:24] [INFO ] Transformed 1231 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-28 18:26:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6318450380544360780.gal : 7 ms
[2024-05-28 18:26:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17306843765715056289.prop : 16 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/ReachabilityCardinality6318450380544360780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17306843765715056289.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/ReachabilityCardinality17306843765715056289.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 252
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :252 after 2304
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2304 after 13935
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13935 after 198215
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :198215 after 1.68924e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.68924e+06 after 7.96984e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.96984e+06 after 1.51337e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.51337e+08 after 1.44672e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.44672e+09 after 6.44814e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.44814e+09 after 2.40992e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.40992e+10 after 4.64986e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.64986e+11 after 1.71566e+13
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.71566e+13 after 8.83762e+13
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :8.83762e+13 after 2.83996e+15

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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