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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716222215188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 16:23:36] [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-20 16:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:23:36] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-05-20 16:23:36] [INFO ] Transformed 5602 places.
[2024-05-20 16:23:36] [INFO ] Transformed 10400 transitions.
[2024-05-20 16:23:36] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (43 resets) in 3226 ms. (12 steps per ms) remains 7/16 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 688 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 713 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
[2024-05-20 16:23:38] [INFO ] Flatten gal took : 1038 ms
// Phase 1: matrix 10400 rows 5602 cols
[2024-05-20 16:23:38] [INFO ] Computed 101 invariants in 149 ms
[2024-05-20 16:23:39] [INFO ] Flatten gal took : 273 ms
[2024-05-20 16:23:39] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-20 16:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14658733361209722212.gal : 147 ms
[2024-05-20 16:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1484208072255229601.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/ReachabilityCardinality14658733361209722212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1484208072255229601.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality1484208072255229601.prop.
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-050-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5377/5552 variables, 50/50 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5552 variables, 2/52 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5552 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/5553 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5553 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 48/5601 variables, 48/101 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10400/16001 variables, 5601/5702 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16001/16002 variables, and 10652 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5046 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 5601/5602 constraints, ReadFeed: 4950/4950 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5451/5545 variables, 43/43 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5545 variables, 2/45 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-20 16:23:52] [INFO ] Deduced a trap composed of 5 places in 6734 ms of which 259 ms to minimize.
SMT process timed out in 13279ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 94 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 5602 transition count 10072
Reduce places removed 328 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 335 rules applied. Total rules applied 663 place count 5274 transition count 10065
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 670 place count 5267 transition count 10065
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 670 place count 5267 transition count 10060
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 680 place count 5262 transition count 10060
Discarding 2364 places :
Symmetric choice reduction at 3 with 2364 rule applications. Total rules 3044 place count 2898 transition count 5332
Iterating global reduction 3 with 2364 rules applied. Total rules applied 5408 place count 2898 transition count 5332
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 5496 place count 2854 transition count 5288
Free-agglomeration rule applied 41 times.
Iterating global reduction 3 with 41 rules applied. Total rules applied 5537 place count 2854 transition count 5247
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 5578 place count 2813 transition count 5247
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 5583 place count 2813 transition count 5242
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 5588 place count 2808 transition count 5242
Partial Free-agglomeration rule applied 59 times.
Drop transitions (Partial Free agglomeration) removed 59 transitions
Iterating global reduction 5 with 59 rules applied. Total rules applied 5647 place count 2808 transition count 5242
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5648 place count 2808 transition count 5242
Applied a total of 5648 rules in 3323 ms. Remains 2808 /5602 variables (removed 2794) and now considering 5242/10400 (removed 5158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3334 ms. Remains : 2808/5602 places, 5242/10400 transitions.
RANDOM walk for 40000 steps (107 resets) in 1282 ms. (31 steps per ms) remains 2/4 properties
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
// Phase 1: matrix 5242 rows 2808 cols
[2024-05-20 16:23:55] [INFO ] Computed 101 invariants in 35 ms
[2024-05-20 16:23:56] [INFO ] State equation strengthened by 5022 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2673/2744 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2744 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2744 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/2758 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2758 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/2807 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2807 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5242/8049 variables, 2807/2908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8049 variables, 5022/7930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8049 variables, 0/7930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/8050 variables, 1/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8050 variables, 0/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/8050 variables, 0/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8050/8050 variables, and 7931 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3543 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2808/2808 constraints, ReadFeed: 5022/5022 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2673/2744 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2744 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:24:02] [INFO ] Deduced a trap composed of 2 places in 2259 ms of which 17 ms to minimize.
[2024-05-20 16:24:04] [INFO ] Deduced a trap composed of 2 places in 2379 ms of which 27 ms to minimize.
[2024-05-20 16:24:05] [INFO ] Deduced a trap composed of 53 places in 1115 ms of which 13 ms to minimize.
[2024-05-20 16:24:06] [INFO ] Deduced a trap composed of 53 places in 1014 ms of which 13 ms to minimize.
[2024-05-20 16:24:07] [INFO ] Deduced a trap composed of 56 places in 1035 ms of which 12 ms to minimize.
[2024-05-20 16:24:09] [INFO ] Deduced a trap composed of 56 places in 1074 ms of which 12 ms to minimize.
[2024-05-20 16:24:10] [INFO ] Deduced a trap composed of 53 places in 897 ms of which 11 ms to minimize.
[2024-05-20 16:24:11] [INFO ] Deduced a trap composed of 56 places in 1039 ms of which 11 ms to minimize.
[2024-05-20 16:24:12] [INFO ] Deduced a trap composed of 56 places in 1045 ms of which 12 ms to minimize.
[2024-05-20 16:24:13] [INFO ] Deduced a trap composed of 56 places in 1137 ms of which 12 ms to minimize.
[2024-05-20 16:24:14] [INFO ] Deduced a trap composed of 57 places in 1000 ms of which 11 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 52
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :52 after 53
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :53 after 55
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :55 after 58
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :58 after 64
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :64 after 75
[2024-05-20 16:24:15] [INFO ] Deduced a trap composed of 56 places in 1006 ms of which 11 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :75 after 97
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :97 after 106
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :106 after 118
[2024-05-20 16:24:16] [INFO ] Deduced a trap composed of 60 places in 1065 ms of which 12 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :118 after 134
[2024-05-20 16:24:17] [INFO ] Deduced a trap composed of 53 places in 1053 ms of which 11 ms to minimize.
[2024-05-20 16:24:18] [INFO ] Deduced a trap composed of 53 places in 916 ms of which 11 ms to minimize.
[2024-05-20 16:24:19] [INFO ] Deduced a trap composed of 53 places in 1002 ms of which 11 ms to minimize.
[2024-05-20 16:24:20] [INFO ] Deduced a trap composed of 53 places in 987 ms of which 11 ms to minimize.
[2024-05-20 16:24:21] [INFO ] Deduced a trap composed of 57 places in 983 ms of which 12 ms to minimize.
[2024-05-20 16:24:22] [INFO ] Deduced a trap composed of 57 places in 1109 ms of which 12 ms to minimize.
[2024-05-20 16:24:24] [INFO ] Deduced a trap composed of 56 places in 1068 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2744 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:24:25] [INFO ] Deduced a trap composed of 57 places in 1028 ms of which 13 ms to minimize.
[2024-05-20 16:24:26] [INFO ] Deduced a trap composed of 53 places in 908 ms of which 11 ms to minimize.
[2024-05-20 16:24:27] [INFO ] Deduced a trap composed of 61 places in 946 ms of which 11 ms to minimize.
[2024-05-20 16:24:28] [INFO ] Deduced a trap composed of 57 places in 979 ms of which 11 ms to minimize.
[2024-05-20 16:24:29] [INFO ] Deduced a trap composed of 61 places in 1086 ms of which 12 ms to minimize.
[2024-05-20 16:24:30] [INFO ] Deduced a trap composed of 56 places in 964 ms of which 11 ms to minimize.
[2024-05-20 16:24:31] [INFO ] Deduced a trap composed of 60 places in 910 ms of which 11 ms to minimize.
[2024-05-20 16:24:32] [INFO ] Deduced a trap composed of 58 places in 924 ms of which 11 ms to minimize.
[2024-05-20 16:24:33] [INFO ] Deduced a trap composed of 56 places in 939 ms of which 12 ms to minimize.
[2024-05-20 16:24:34] [INFO ] Deduced a trap composed of 56 places in 983 ms of which 11 ms to minimize.
[2024-05-20 16:24:35] [INFO ] Deduced a trap composed of 53 places in 818 ms of which 10 ms to minimize.
[2024-05-20 16:24:35] [INFO ] Deduced a trap composed of 56 places in 800 ms of which 9 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :2651 after 2697
[2024-05-20 16:24:36] [INFO ] Deduced a trap composed of 53 places in 809 ms of which 11 ms to minimize.
[2024-05-20 16:24:37] [INFO ] Deduced a trap composed of 54 places in 867 ms of which 18 ms to minimize.
[2024-05-20 16:24:38] [INFO ] Deduced a trap composed of 60 places in 784 ms of which 10 ms to minimize.
[2024-05-20 16:24:39] [INFO ] Deduced a trap composed of 54 places in 851 ms of which 10 ms to minimize.
[2024-05-20 16:24:40] [INFO ] Deduced a trap composed of 54 places in 879 ms of which 11 ms to minimize.
[2024-05-20 16:24:41] [INFO ] Deduced a trap composed of 57 places in 818 ms of which 10 ms to minimize.
[2024-05-20 16:24:42] [INFO ] Deduced a trap composed of 56 places in 707 ms of which 10 ms to minimize.
[2024-05-20 16:24:42] [INFO ] Deduced a trap composed of 57 places in 648 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2744 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:24:43] [INFO ] Deduced a trap composed of 56 places in 873 ms of which 10 ms to minimize.
[2024-05-20 16:24:44] [INFO ] Deduced a trap composed of 53 places in 893 ms of which 10 ms to minimize.
SMT process timed out in 48713ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 5242/5242 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2800 transition count 5234
Applied a total of 16 rules in 542 ms. Remains 2800 /2808 variables (removed 8) and now considering 5234/5242 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 2800/2808 places, 5234/5242 transitions.
RANDOM walk for 40000 steps (110 resets) in 1214 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 75879 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 2
Probabilistic random walk after 75879 steps, saw 41204 distinct states, run finished after 3007 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 5234 rows 2800 cols
[2024-05-20 16:24:48] [INFO ] Computed 101 invariants in 61 ms
[2024-05-20 16:24:48] [INFO ] State equation strengthened by 5030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2665/2736 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2736 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2736 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/2750 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2750 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 49/2799 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2799 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5234/8033 variables, 2799/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8033 variables, 5030/7930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8033 variables, 0/7930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/8034 variables, 1/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8034 variables, 0/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/8034 variables, 0/7931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8034/8034 variables, and 7931 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3472 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2800/2800 constraints, ReadFeed: 5030/5030 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2665/2736 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2736 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :2697 after 2795
[2024-05-20 16:24:54] [INFO ] Deduced a trap composed of 2 places in 1993 ms of which 16 ms to minimize.
[2024-05-20 16:24:55] [INFO ] Deduced a trap composed of 56 places in 1024 ms of which 11 ms to minimize.
[2024-05-20 16:24:56] [INFO ] Deduced a trap composed of 53 places in 1119 ms of which 11 ms to minimize.
[2024-05-20 16:24:57] [INFO ] Deduced a trap composed of 56 places in 917 ms of which 11 ms to minimize.
[2024-05-20 16:24:58] [INFO ] Deduced a trap composed of 53 places in 903 ms of which 10 ms to minimize.
[2024-05-20 16:24:59] [INFO ] Deduced a trap composed of 53 places in 884 ms of which 10 ms to minimize.
[2024-05-20 16:25:01] [INFO ] Deduced a trap composed of 2 places in 1829 ms of which 14 ms to minimize.
[2024-05-20 16:25:02] [INFO ] Deduced a trap composed of 55 places in 994 ms of which 12 ms to minimize.
[2024-05-20 16:25:04] [INFO ] Deduced a trap composed of 53 places in 1592 ms of which 25 ms to minimize.
[2024-05-20 16:25:05] [INFO ] Deduced a trap composed of 55 places in 1004 ms of which 11 ms to minimize.
[2024-05-20 16:25:06] [INFO ] Deduced a trap composed of 55 places in 898 ms of which 11 ms to minimize.
[2024-05-20 16:25:07] [INFO ] Deduced a trap composed of 55 places in 874 ms of which 12 ms to minimize.
[2024-05-20 16:25:08] [INFO ] Deduced a trap composed of 55 places in 958 ms of which 22 ms to minimize.
[2024-05-20 16:25:09] [INFO ] Deduced a trap composed of 56 places in 877 ms of which 10 ms to minimize.
[2024-05-20 16:25:10] [INFO ] Deduced a trap composed of 55 places in 835 ms of which 10 ms to minimize.
[2024-05-20 16:25:11] [INFO ] Deduced a trap composed of 55 places in 849 ms of which 10 ms to minimize.
[2024-05-20 16:25:11] [INFO ] Deduced a trap composed of 57 places in 857 ms of which 10 ms to minimize.
[2024-05-20 16:25:12] [INFO ] Deduced a trap composed of 55 places in 838 ms of which 10 ms to minimize.
[2024-05-20 16:25:13] [INFO ] Deduced a trap composed of 56 places in 824 ms of which 11 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :2795 after 2999
[2024-05-20 16:25:14] [INFO ] Deduced a trap composed of 53 places in 918 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2736 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:25:15] [INFO ] Deduced a trap composed of 56 places in 817 ms of which 12 ms to minimize.
[2024-05-20 16:25:16] [INFO ] Deduced a trap composed of 53 places in 748 ms of which 10 ms to minimize.
[2024-05-20 16:25:17] [INFO ] Deduced a trap composed of 56 places in 676 ms of which 9 ms to minimize.
[2024-05-20 16:25:17] [INFO ] Deduced a trap composed of 55 places in 648 ms of which 9 ms to minimize.
[2024-05-20 16:25:18] [INFO ] Deduced a trap composed of 53 places in 682 ms of which 9 ms to minimize.
[2024-05-20 16:25:19] [INFO ] Deduced a trap composed of 58 places in 728 ms of which 9 ms to minimize.
[2024-05-20 16:25:20] [INFO ] Deduced a trap composed of 59 places in 875 ms of which 11 ms to minimize.
[2024-05-20 16:25:20] [INFO ] Deduced a trap composed of 53 places in 694 ms of which 9 ms to minimize.
[2024-05-20 16:25:21] [INFO ] Deduced a trap composed of 56 places in 853 ms of which 10 ms to minimize.
[2024-05-20 16:25:22] [INFO ] Deduced a trap composed of 53 places in 780 ms of which 10 ms to minimize.
[2024-05-20 16:25:23] [INFO ] Deduced a trap composed of 53 places in 698 ms of which 10 ms to minimize.
[2024-05-20 16:25:24] [INFO ] Deduced a trap composed of 55 places in 717 ms of which 9 ms to minimize.
[2024-05-20 16:25:24] [INFO ] Deduced a trap composed of 56 places in 694 ms of which 10 ms to minimize.
[2024-05-20 16:25:25] [INFO ] Deduced a trap composed of 55 places in 786 ms of which 10 ms to minimize.
[2024-05-20 16:25:26] [INFO ] Deduced a trap composed of 56 places in 819 ms of which 10 ms to minimize.
[2024-05-20 16:25:27] [INFO ] Deduced a trap composed of 53 places in 781 ms of which 10 ms to minimize.
[2024-05-20 16:25:28] [INFO ] Deduced a trap composed of 55 places in 805 ms of which 10 ms to minimize.
[2024-05-20 16:25:29] [INFO ] Deduced a trap composed of 56 places in 714 ms of which 9 ms to minimize.
[2024-05-20 16:25:30] [INFO ] Deduced a trap composed of 59 places in 921 ms of which 10 ms to minimize.
[2024-05-20 16:25:31] [INFO ] Deduced a trap composed of 56 places in 934 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2736 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:25:32] [INFO ] Deduced a trap composed of 53 places in 804 ms of which 10 ms to minimize.
[2024-05-20 16:25:32] [INFO ] Deduced a trap composed of 53 places in 885 ms of which 10 ms to minimize.
[2024-05-20 16:25:33] [INFO ] Deduced a trap composed of 56 places in 641 ms of which 9 ms to minimize.
[2024-05-20 16:25:34] [INFO ] Deduced a trap composed of 55 places in 814 ms of which 10 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :2999 after 3503
[2024-05-20 16:25:35] [INFO ] Deduced a trap composed of 56 places in 667 ms of which 9 ms to minimize.
[2024-05-20 16:25:36] [INFO ] Deduced a trap composed of 58 places in 754 ms of which 10 ms to minimize.
[2024-05-20 16:25:36] [INFO ] Deduced a trap composed of 53 places in 714 ms of which 9 ms to minimize.
[2024-05-20 16:25:37] [INFO ] Deduced a trap composed of 53 places in 727 ms of which 30 ms to minimize.
[2024-05-20 16:25:38] [INFO ] Deduced a trap composed of 56 places in 641 ms of which 9 ms to minimize.
[2024-05-20 16:25:39] [INFO ] Deduced a trap composed of 53 places in 749 ms of which 9 ms to minimize.
[2024-05-20 16:25:39] [INFO ] Deduced a trap composed of 56 places in 736 ms of which 10 ms to minimize.
[2024-05-20 16:25:40] [INFO ] Deduced a trap composed of 57 places in 800 ms of which 9 ms to minimize.
[2024-05-20 16:25:41] [INFO ] Deduced a trap composed of 56 places in 701 ms of which 9 ms to minimize.
[2024-05-20 16:25:42] [INFO ] Deduced a trap composed of 53 places in 787 ms of which 10 ms to minimize.
[2024-05-20 16:25:43] [INFO ] Deduced a trap composed of 54 places in 704 ms of which 9 ms to minimize.
[2024-05-20 16:25:43] [INFO ] Deduced a trap composed of 61 places in 706 ms of which 10 ms to minimize.
[2024-05-20 16:25:44] [INFO ] Deduced a trap composed of 57 places in 639 ms of which 9 ms to minimize.
[2024-05-20 16:25:45] [INFO ] Deduced a trap composed of 58 places in 885 ms of which 10 ms to minimize.
[2024-05-20 16:25:46] [INFO ] Deduced a trap composed of 53 places in 631 ms of which 9 ms to minimize.
[2024-05-20 16:25:47] [INFO ] Deduced a trap composed of 53 places in 670 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2736 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:25:47] [INFO ] Deduced a trap composed of 56 places in 536 ms of which 8 ms to minimize.
[2024-05-20 16:25:48] [INFO ] Deduced a trap composed of 56 places in 553 ms of which 8 ms to minimize.
[2024-05-20 16:25:48] [INFO ] Deduced a trap composed of 56 places in 511 ms of which 8 ms to minimize.
[2024-05-20 16:25:49] [INFO ] Deduced a trap composed of 56 places in 569 ms of which 9 ms to minimize.
[2024-05-20 16:25:50] [INFO ] Deduced a trap composed of 57 places in 582 ms of which 9 ms to minimize.
[2024-05-20 16:25:50] [INFO ] Deduced a trap composed of 56 places in 608 ms of which 9 ms to minimize.
[2024-05-20 16:25:51] [INFO ] Deduced a trap composed of 57 places in 559 ms of which 9 ms to minimize.
[2024-05-20 16:25:51] [INFO ] Deduced a trap composed of 56 places in 478 ms of which 8 ms to minimize.
[2024-05-20 16:25:52] [INFO ] Deduced a trap composed of 58 places in 615 ms of which 8 ms to minimize.
[2024-05-20 16:25:53] [INFO ] Deduced a trap composed of 56 places in 606 ms of which 9 ms to minimize.
[2024-05-20 16:25:53] [INFO ] Deduced a trap composed of 57 places in 469 ms of which 7 ms to minimize.
[2024-05-20 16:25:54] [INFO ] Deduced a trap composed of 56 places in 599 ms of which 9 ms to minimize.
[2024-05-20 16:25:54] [INFO ] Deduced a trap composed of 55 places in 476 ms of which 8 ms to minimize.
[2024-05-20 16:25:55] [INFO ] Deduced a trap composed of 56 places in 465 ms of which 7 ms to minimize.
[2024-05-20 16:25:55] [INFO ] Deduced a trap composed of 56 places in 456 ms of which 8 ms to minimize.
[2024-05-20 16:25:56] [INFO ] Deduced a trap composed of 58 places in 454 ms of which 9 ms to minimize.
[2024-05-20 16:25:56] [INFO ] Deduced a trap composed of 56 places in 410 ms of which 7 ms to minimize.
[2024-05-20 16:25:57] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 7 ms to minimize.
[2024-05-20 16:25:57] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 6 ms to minimize.
[2024-05-20 16:25:58] [INFO ] Deduced a trap composed of 56 places in 432 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:25:58] [INFO ] Deduced a trap composed of 56 places in 488 ms of which 7 ms to minimize.
[2024-05-20 16:25:59] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 6 ms to minimize.
[2024-05-20 16:25:59] [INFO ] Deduced a trap composed of 53 places in 478 ms of which 7 ms to minimize.
[2024-05-20 16:26:00] [INFO ] Deduced a trap composed of 56 places in 461 ms of which 7 ms to minimize.
[2024-05-20 16:26:00] [INFO ] Deduced a trap composed of 56 places in 460 ms of which 8 ms to minimize.
[2024-05-20 16:26:01] [INFO ] Deduced a trap composed of 56 places in 430 ms of which 7 ms to minimize.
[2024-05-20 16:26:01] [INFO ] Deduced a trap composed of 56 places in 363 ms of which 6 ms to minimize.
[2024-05-20 16:26:02] [INFO ] Deduced a trap composed of 53 places in 390 ms of which 6 ms to minimize.
[2024-05-20 16:26:02] [INFO ] Deduced a trap composed of 56 places in 282 ms of which 6 ms to minimize.
[2024-05-20 16:26:02] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 5 ms to minimize.
[2024-05-20 16:26:03] [INFO ] Deduced a trap composed of 53 places in 337 ms of which 6 ms to minimize.
[2024-05-20 16:26:03] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 5 ms to minimize.
[2024-05-20 16:26:03] [INFO ] Deduced a trap composed of 56 places in 347 ms of which 6 ms to minimize.
[2024-05-20 16:26:04] [INFO ] Deduced a trap composed of 56 places in 299 ms of which 5 ms to minimize.
[2024-05-20 16:26:04] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 5 ms to minimize.
[2024-05-20 16:26:04] [INFO ] Deduced a trap composed of 55 places in 381 ms of which 6 ms to minimize.
[2024-05-20 16:26:05] [INFO ] Deduced a trap composed of 56 places in 319 ms of which 6 ms to minimize.
[2024-05-20 16:26:05] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 5 ms to minimize.
[2024-05-20 16:26:05] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 5 ms to minimize.
[2024-05-20 16:26:06] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2736 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:26:06] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 5 ms to minimize.
[2024-05-20 16:26:06] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 5 ms to minimize.
[2024-05-20 16:26:07] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 5 ms to minimize.
[2024-05-20 16:26:07] [INFO ] Deduced a trap composed of 57 places in 351 ms of which 6 ms to minimize.
SMT process timed out in 78919ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 5234/5234 transitions.
Applied a total of 0 rules in 266 ms. Remains 2800 /2800 variables (removed 0) and now considering 5234/5234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 2800/2800 places, 5234/5234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 5234/5234 transitions.
Applied a total of 0 rules in 547 ms. Remains 2800 /2800 variables (removed 0) and now considering 5234/5234 (removed 0) transitions.
[2024-05-20 16:26:08] [INFO ] Invariant cache hit.
[2024-05-20 16:26:10] [INFO ] Implicit Places using invariants in 1849 ms returned [5, 10, 16, 20, 26, 32, 36, 42, 46, 52, 58, 62, 68, 72, 76, 82, 90, 96, 102, 106, 112, 118, 124, 130, 134, 138, 144, 150, 156, 160, 166, 172, 178, 182, 188, 197, 203, 209, 215, 219, 223, 229, 235, 240, 248, 254, 260, 264, 270]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1874 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2751/2800 places, 5234/5234 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 2751 transition count 5204
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 2721 transition count 5204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 2720 transition count 5203
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 2720 transition count 5203
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 2695 transition count 5178
Applied a total of 112 rules in 763 ms. Remains 2695 /2751 variables (removed 56) and now considering 5178/5234 (removed 56) transitions.
// Phase 1: matrix 5178 rows 2695 cols
[2024-05-20 16:26:11] [INFO ] Computed 52 invariants in 59 ms
[2024-05-20 16:26:12] [INFO ] Implicit Places using invariants in 1775 ms returned []
[2024-05-20 16:26:12] [INFO ] Invariant cache hit.
[2024-05-20 16:26:14] [INFO ] State equation strengthened by 4957 read => feed constraints.
[2024-05-20 16:26:45] [INFO ] Performed 1237/2695 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 16:27:15] [INFO ] Performed 2570/2695 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 16:27:18] [INFO ] Implicit Places using invariants and state equation in 65168 ms returned []
Implicit Place search using SMT with State Equation took 66946 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2695/2800 places, 5178/5234 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70132 ms. Remains : 2695/2800 places, 5178/5234 transitions.
RANDOM walk for 40000 steps (109 resets) in 1069 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 83157 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83157 steps, saw 42112 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-20 16:27:21] [INFO ] Invariant cache hit.
[2024-05-20 16:27:21] [INFO ] State equation strengthened by 4957 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2609/2680 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2680 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2680 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/2694 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2694 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5178/7872 variables, 2694/2746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7872 variables, 4957/7703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7872 variables, 0/7703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/7873 variables, 1/7704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7873 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/7873 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7873/7873 variables, and 7704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2913 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2695/2695 constraints, ReadFeed: 4957/4957 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2609/2680 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2680 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:27:26] [INFO ] Deduced a trap composed of 2 places in 1878 ms of which 16 ms to minimize.
[2024-05-20 16:27:27] [INFO ] Deduced a trap composed of 55 places in 1071 ms of which 12 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :3503 after 8816
[2024-05-20 16:27:29] [INFO ] Deduced a trap composed of 55 places in 1073 ms of which 11 ms to minimize.
[2024-05-20 16:27:30] [INFO ] Deduced a trap composed of 53 places in 1022 ms of which 11 ms to minimize.
[2024-05-20 16:27:31] [INFO ] Deduced a trap composed of 55 places in 909 ms of which 12 ms to minimize.
[2024-05-20 16:27:32] [INFO ] Deduced a trap composed of 53 places in 950 ms of which 11 ms to minimize.
[2024-05-20 16:27:33] [INFO ] Deduced a trap composed of 58 places in 924 ms of which 11 ms to minimize.
[2024-05-20 16:27:34] [INFO ] Deduced a trap composed of 54 places in 1046 ms of which 10 ms to minimize.
[2024-05-20 16:27:35] [INFO ] Deduced a trap composed of 56 places in 1033 ms of which 12 ms to minimize.
[2024-05-20 16:27:37] [INFO ] Deduced a trap composed of 2 places in 1992 ms of which 16 ms to minimize.
[2024-05-20 16:27:39] [INFO ] Deduced a trap composed of 2 places in 1985 ms of which 15 ms to minimize.
[2024-05-20 16:27:40] [INFO ] Deduced a trap composed of 53 places in 905 ms of which 10 ms to minimize.
[2024-05-20 16:27:41] [INFO ] Deduced a trap composed of 53 places in 849 ms of which 10 ms to minimize.
[2024-05-20 16:27:43] [INFO ] Deduced a trap composed of 2 places in 1861 ms of which 14 ms to minimize.
[2024-05-20 16:27:43] [INFO ] Deduced a trap composed of 55 places in 832 ms of which 10 ms to minimize.
[2024-05-20 16:27:45] [INFO ] Deduced a trap composed of 53 places in 1051 ms of which 11 ms to minimize.
[2024-05-20 16:27:46] [INFO ] Deduced a trap composed of 53 places in 936 ms of which 11 ms to minimize.
[2024-05-20 16:27:46] [INFO ] Deduced a trap composed of 55 places in 891 ms of which 10 ms to minimize.
[2024-05-20 16:27:47] [INFO ] Deduced a trap composed of 54 places in 826 ms of which 10 ms to minimize.
[2024-05-20 16:27:48] [INFO ] Deduced a trap composed of 53 places in 860 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2680 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:27:49] [INFO ] Deduced a trap composed of 55 places in 918 ms of which 11 ms to minimize.
[2024-05-20 16:27:50] [INFO ] Deduced a trap composed of 55 places in 799 ms of which 10 ms to minimize.
[2024-05-20 16:27:51] [INFO ] Deduced a trap composed of 53 places in 898 ms of which 11 ms to minimize.
[2024-05-20 16:27:52] [INFO ] Deduced a trap composed of 53 places in 820 ms of which 10 ms to minimize.
[2024-05-20 16:27:53] [INFO ] Deduced a trap composed of 55 places in 756 ms of which 9 ms to minimize.
[2024-05-20 16:27:53] [INFO ] Deduced a trap composed of 54 places in 706 ms of which 9 ms to minimize.
[2024-05-20 16:27:54] [INFO ] Deduced a trap composed of 53 places in 785 ms of which 9 ms to minimize.
[2024-05-20 16:27:55] [INFO ] Deduced a trap composed of 54 places in 831 ms of which 9 ms to minimize.
[2024-05-20 16:27:56] [INFO ] Deduced a trap composed of 54 places in 762 ms of which 9 ms to minimize.
[2024-05-20 16:27:57] [INFO ] Deduced a trap composed of 54 places in 686 ms of which 9 ms to minimize.
[2024-05-20 16:27:57] [INFO ] Deduced a trap composed of 55 places in 607 ms of which 8 ms to minimize.
[2024-05-20 16:27:58] [INFO ] Deduced a trap composed of 53 places in 578 ms of which 8 ms to minimize.
[2024-05-20 16:27:59] [INFO ] Deduced a trap composed of 54 places in 716 ms of which 9 ms to minimize.
[2024-05-20 16:27:59] [INFO ] Deduced a trap composed of 55 places in 607 ms of which 9 ms to minimize.
[2024-05-20 16:28:00] [INFO ] Deduced a trap composed of 54 places in 578 ms of which 8 ms to minimize.
[2024-05-20 16:28:01] [INFO ] Deduced a trap composed of 54 places in 516 ms of which 8 ms to minimize.
[2024-05-20 16:28:01] [INFO ] Deduced a trap composed of 54 places in 637 ms of which 9 ms to minimize.
[2024-05-20 16:28:02] [INFO ] Deduced a trap composed of 53 places in 638 ms of which 8 ms to minimize.
[2024-05-20 16:28:03] [INFO ] Deduced a trap composed of 54 places in 529 ms of which 8 ms to minimize.
[2024-05-20 16:28:03] [INFO ] Deduced a trap composed of 53 places in 606 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2680 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:28:04] [INFO ] Deduced a trap composed of 53 places in 776 ms of which 9 ms to minimize.
[2024-05-20 16:28:05] [INFO ] Deduced a trap composed of 53 places in 824 ms of which 10 ms to minimize.
[2024-05-20 16:28:06] [INFO ] Deduced a trap composed of 54 places in 831 ms of which 10 ms to minimize.
[2024-05-20 16:28:07] [INFO ] Deduced a trap composed of 53 places in 772 ms of which 9 ms to minimize.
[2024-05-20 16:28:07] [INFO ] Deduced a trap composed of 53 places in 727 ms of which 10 ms to minimize.
[2024-05-20 16:28:08] [INFO ] Deduced a trap composed of 53 places in 722 ms of which 9 ms to minimize.
[2024-05-20 16:28:09] [INFO ] Deduced a trap composed of 54 places in 847 ms of which 10 ms to minimize.
[2024-05-20 16:28:10] [INFO ] Deduced a trap composed of 55 places in 774 ms of which 10 ms to minimize.
[2024-05-20 16:28:11] [INFO ] Deduced a trap composed of 53 places in 817 ms of which 10 ms to minimize.
[2024-05-20 16:28:12] [INFO ] Deduced a trap composed of 53 places in 800 ms of which 10 ms to minimize.
[2024-05-20 16:28:13] [INFO ] Deduced a trap composed of 53 places in 747 ms of which 9 ms to minimize.
[2024-05-20 16:28:13] [INFO ] Deduced a trap composed of 58 places in 650 ms of which 9 ms to minimize.
[2024-05-20 16:28:14] [INFO ] Deduced a trap composed of 53 places in 666 ms of which 10 ms to minimize.
[2024-05-20 16:28:15] [INFO ] Deduced a trap composed of 54 places in 863 ms of which 10 ms to minimize.
[2024-05-20 16:28:16] [INFO ] Deduced a trap composed of 53 places in 699 ms of which 9 ms to minimize.
[2024-05-20 16:28:16] [INFO ] Deduced a trap composed of 53 places in 756 ms of which 10 ms to minimize.
[2024-05-20 16:28:17] [INFO ] Deduced a trap composed of 54 places in 655 ms of which 8 ms to minimize.
[2024-05-20 16:28:18] [INFO ] Deduced a trap composed of 55 places in 683 ms of which 10 ms to minimize.
[2024-05-20 16:28:19] [INFO ] Deduced a trap composed of 53 places in 720 ms of which 10 ms to minimize.
[2024-05-20 16:28:19] [INFO ] Deduced a trap composed of 53 places in 602 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2680 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:28:21] [INFO ] Deduced a trap composed of 53 places in 1301 ms of which 17 ms to minimize.
[2024-05-20 16:28:22] [INFO ] Deduced a trap composed of 53 places in 1233 ms of which 22 ms to minimize.
[2024-05-20 16:28:23] [INFO ] Deduced a trap composed of 54 places in 1111 ms of which 10 ms to minimize.
[2024-05-20 16:28:24] [INFO ] Deduced a trap composed of 53 places in 684 ms of which 9 ms to minimize.
[2024-05-20 16:28:25] [INFO ] Deduced a trap composed of 53 places in 784 ms of which 10 ms to minimize.
[2024-05-20 16:28:26] [INFO ] Deduced a trap composed of 53 places in 737 ms of which 9 ms to minimize.
[2024-05-20 16:28:26] [INFO ] Deduced a trap composed of 54 places in 591 ms of which 8 ms to minimize.
[2024-05-20 16:28:27] [INFO ] Deduced a trap composed of 54 places in 700 ms of which 10 ms to minimize.
[2024-05-20 16:28:28] [INFO ] Deduced a trap composed of 54 places in 602 ms of which 9 ms to minimize.
[2024-05-20 16:28:28] [INFO ] Deduced a trap composed of 54 places in 553 ms of which 8 ms to minimize.
[2024-05-20 16:28:29] [INFO ] Deduced a trap composed of 54 places in 556 ms of which 10 ms to minimize.
[2024-05-20 16:28:30] [INFO ] Deduced a trap composed of 54 places in 531 ms of which 8 ms to minimize.
[2024-05-20 16:28:30] [INFO ] Deduced a trap composed of 55 places in 514 ms of which 8 ms to minimize.
[2024-05-20 16:28:31] [INFO ] Deduced a trap composed of 55 places in 511 ms of which 7 ms to minimize.
[2024-05-20 16:28:32] [INFO ] Deduced a trap composed of 53 places in 691 ms of which 10 ms to minimize.
[2024-05-20 16:28:32] [INFO ] Deduced a trap composed of 54 places in 660 ms of which 9 ms to minimize.
[2024-05-20 16:28:33] [INFO ] Deduced a trap composed of 55 places in 798 ms of which 10 ms to minimize.
[2024-05-20 16:28:34] [INFO ] Deduced a trap composed of 55 places in 781 ms of which 10 ms to minimize.
[2024-05-20 16:28:35] [INFO ] Deduced a trap composed of 53 places in 753 ms of which 10 ms to minimize.
[2024-05-20 16:28:35] [INFO ] Deduced a trap composed of 55 places in 704 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2680 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:28:36] [INFO ] Deduced a trap composed of 55 places in 722 ms of which 9 ms to minimize.
[2024-05-20 16:28:37] [INFO ] Deduced a trap composed of 55 places in 638 ms of which 9 ms to minimize.
[2024-05-20 16:28:38] [INFO ] Deduced a trap composed of 53 places in 571 ms of which 9 ms to minimize.
[2024-05-20 16:28:38] [INFO ] Deduced a trap composed of 54 places in 501 ms of which 8 ms to minimize.
[2024-05-20 16:28:39] [INFO ] Deduced a trap composed of 55 places in 581 ms of which 10 ms to minimize.
[2024-05-20 16:28:39] [INFO ] Deduced a trap composed of 55 places in 552 ms of which 9 ms to minimize.
[2024-05-20 16:28:40] [INFO ] Deduced a trap composed of 53 places in 795 ms of which 10 ms to minimize.
[2024-05-20 16:28:41] [INFO ] Deduced a trap composed of 55 places in 871 ms of which 10 ms to minimize.
[2024-05-20 16:28:42] [INFO ] Deduced a trap composed of 53 places in 812 ms of which 10 ms to minimize.
[2024-05-20 16:28:43] [INFO ] Deduced a trap composed of 55 places in 667 ms of which 9 ms to minimize.
[2024-05-20 16:28:44] [INFO ] Deduced a trap composed of 55 places in 675 ms of which 9 ms to minimize.
[2024-05-20 16:28:44] [INFO ] Deduced a trap composed of 53 places in 635 ms of which 9 ms to minimize.
[2024-05-20 16:28:45] [INFO ] Deduced a trap composed of 54 places in 615 ms of which 8 ms to minimize.
[2024-05-20 16:28:46] [INFO ] Deduced a trap composed of 53 places in 548 ms of which 8 ms to minimize.
[2024-05-20 16:28:46] [INFO ] Deduced a trap composed of 58 places in 468 ms of which 7 ms to minimize.
[2024-05-20 16:28:47] [INFO ] Deduced a trap composed of 53 places in 493 ms of which 8 ms to minimize.
[2024-05-20 16:28:47] [INFO ] Deduced a trap composed of 53 places in 497 ms of which 7 ms to minimize.
[2024-05-20 16:28:48] [INFO ] Deduced a trap composed of 53 places in 510 ms of which 8 ms to minimize.
[2024-05-20 16:28:48] [INFO ] Deduced a trap composed of 53 places in 491 ms of which 7 ms to minimize.
[2024-05-20 16:28:49] [INFO ] Deduced a trap composed of 53 places in 492 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2680 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 16:28:49] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 7 ms to minimize.
[2024-05-20 16:28:50] [INFO ] Deduced a trap composed of 54 places in 498 ms of which 11 ms to minimize.
[2024-05-20 16:28:50] [INFO ] Deduced a trap composed of 58 places in 468 ms of which 8 ms to minimize.
[2024-05-20 16:28:51] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 7 ms to minimize.
[2024-05-20 16:28:51] [INFO ] Deduced a trap composed of 53 places in 415 ms of which 7 ms to minimize.
[2024-05-20 16:28:52] [INFO ] Deduced a trap composed of 54 places in 445 ms of which 7 ms to minimize.
[2024-05-20 16:28:52] [INFO ] Deduced a trap composed of 55 places in 411 ms of which 7 ms to minimize.
[2024-05-20 16:28:53] [INFO ] Deduced a trap composed of 57 places in 491 ms of which 9 ms to minimize.
[2024-05-20 16:28:53] [INFO ] Deduced a trap composed of 53 places in 442 ms of which 9 ms to minimize.
[2024-05-20 16:28:54] [INFO ] Deduced a trap composed of 54 places in 443 ms of which 7 ms to minimize.
[2024-05-20 16:28:54] [INFO ] Deduced a trap composed of 55 places in 396 ms of which 7 ms to minimize.
SMT process timed out in 93295ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 2695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2695/2695 places, 5178/5178 transitions.
Applied a total of 0 rules in 330 ms. Remains 2695 /2695 variables (removed 0) and now considering 5178/5178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 2695/2695 places, 5178/5178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2695/2695 places, 5178/5178 transitions.
Applied a total of 0 rules in 268 ms. Remains 2695 /2695 variables (removed 0) and now considering 5178/5178 (removed 0) transitions.
[2024-05-20 16:28:55] [INFO ] Invariant cache hit.
[2024-05-20 16:28:57] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2024-05-20 16:28:57] [INFO ] Invariant cache hit.
[2024-05-20 16:28:58] [INFO ] State equation strengthened by 4957 read => feed constraints.
[2024-05-20 16:29:29] [INFO ] Performed 1318/2695 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 16:29:59] [INFO ] Performed 2681/2695 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 16:29:59] [INFO ] Implicit Places using invariants and state equation in 62347 ms returned []
Implicit Place search using SMT with State Equation took 63965 ms to find 0 implicit places.
[2024-05-20 16:29:59] [INFO ] Redundant transitions in 404 ms returned []
Running 5128 sub problems to find dead transitions.
[2024-05-20 16:29:59] [INFO ] Invariant cache hit.
[2024-05-20 16:30:00] [INFO ] State equation strengthened by 4957 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :8816 after 11915
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2694 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5128 unsolved
SMT process timed out in 35146ms, After SMT, problems are : Problem set: 0 solved, 5128 unsolved
Search for dead transitions found 0 dead transitions in 35208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99893 ms. Remains : 2695/2695 places, 5178/5178 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 4857 edges and 2695 vertex of which 2246 / 2695 are part of one of the 45 SCC in 10 ms
Free SCC test removed 2201 places
Drop transitions (Empty/Sink Transition effects.) removed 4357 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 4364 transitions.
Graph (complete) has 998 edges and 494 vertex of which 417 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.1 ms
Discarding 77 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Empty/Sink Transition effects.) removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 266 rules applied. Total rules applied 268 place count 417 transition count 521
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 185 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 422 rules applied. Total rules applied 690 place count 228 transition count 288
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 785 place count 180 transition count 241
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 785 place count 180 transition count 231
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 806 place count 169 transition count 231
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 809 place count 166 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 812 place count 166 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 818 place count 163 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 821 place count 163 transition count 228
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 836 place count 163 transition count 213
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 851 place count 148 transition count 213
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 873 place count 148 transition count 213
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 891 place count 130 transition count 195
Iterating global reduction 4 with 18 rules applied. Total rules applied 909 place count 130 transition count 195
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 919 place count 120 transition count 185
Applied a total of 919 rules in 81 ms. Remains 120 /2695 variables (removed 2575) and now considering 185/5178 (removed 4993) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 185 rows 120 cols
[2024-05-20 16:30:35] [INFO ] Computed 11 invariants in 0 ms
[2024-05-20 16:30:35] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 16:30:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-20 16:30:35] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-20 16:30:35] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:30:35] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-20 16:30:35] [INFO ] Flatten gal took : 4 ms
[2024-05-20 16:30:35] [INFO ] Flatten gal took : 4 ms
[2024-05-20 16:30:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14794511410749757633.gal : 3 ms
[2024-05-20 16:30:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8412384243899730386.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/ReachabilityCardinality14794511410749757633.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8412384243899730386.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8412384243899730386.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 54
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :54 after 648
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :648 after 116640
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :116640 after 6.71846e+08
Detected timeout of ITS tools.
[2024-05-20 16:30:50] [INFO ] Flatten gal took : 4 ms
[2024-05-20 16:30:50] [INFO ] Applying decomposition
[2024-05-20 16:30:50] [INFO ] Flatten gal took : 3 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/graph15136225243709075396.txt' '-o' '/tmp/graph15136225243709075396.bin' '-w' '/tmp/graph15136225243709075396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15136225243709075396.bin' '-l' '-1' '-v' '-w' '/tmp/graph15136225243709075396.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:30:50] [INFO ] Decomposing Gal with order
[2024-05-20 16:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:30:50] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-20 16:30:50] [INFO ] Flatten gal took : 62 ms
[2024-05-20 16:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-20 16:30:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6686195765307887622.gal : 2 ms
[2024-05-20 16:30:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11208369466401080967.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/ReachabilityCardinality6686195765307887622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11208369466401080967.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11208369466401080967.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 108
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :108 after 1944
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1944 after 13608
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :13608 after 1.95955e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30694 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 16:31:06] [INFO ] Flatten gal took : 347 ms
[2024-05-20 16:31:06] [INFO ] Applying decomposition
[2024-05-20 16:31:06] [INFO ] Flatten gal took : 252 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/graph17715938934326083929.txt' '-o' '/tmp/graph17715938934326083929.bin' '-w' '/tmp/graph17715938934326083929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17715938934326083929.bin' '-l' '-1' '-v' '-w' '/tmp/graph17715938934326083929.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:31:07] [INFO ] Decomposing Gal with order
[2024-05-20 16:31:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:31:08] [INFO ] Removed a total of 6137 redundant transitions.
[2024-05-20 16:31:08] [INFO ] Flatten gal took : 672 ms
[2024-05-20 16:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 846 labels/synchronizations in 275 ms.
[2024-05-20 16:31:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality322160702854614293.gal : 136 ms
[2024-05-20 16:31:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4831954878554724603.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/ReachabilityCardinality322160702854614293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4831954878554724603.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality4831954878554724603.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 33
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :33 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 57
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :57 after 61
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :61 after 63
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :63 after 65
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 67
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :67 after 69
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :69 after 117
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :117 after 136
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :136 after 4379
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4379 after 6257
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6257 after 7407
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7407 after 206079
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :206079 after 274197
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :274197 after 296505
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :296505 after 6.59104e+06
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :6.59104e+06 after 8.05988e+06
ITS-tools command line returned an error code 137
[2024-05-20 16:48:18] [INFO ] Flatten gal took : 127 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6209116612687044256
[2024-05-20 16:48:18] [INFO ] Too many transitions (5178) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:48:18] [INFO ] Applying decomposition
[2024-05-20 16:48:18] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6209116612687044256
Running compilation step : cd /tmp/ltsmin6209116612687044256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 16:48:18] [INFO ] Flatten gal took : 142 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/graph17404144046874930020.txt' '-o' '/tmp/graph17404144046874930020.bin' '-w' '/tmp/graph17404144046874930020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17404144046874930020.bin' '-l' '-1' '-v' '-w' '/tmp/graph17404144046874930020.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:48:18] [INFO ] Decomposing Gal with order
[2024-05-20 16:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:48:19] [INFO ] Removed a total of 5091 redundant transitions.
[2024-05-20 16:48:19] [INFO ] Flatten gal took : 507 ms
[2024-05-20 16:48:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4946 labels/synchronizations in 279 ms.
[2024-05-20 16:48:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16551863362552208598.gal : 25 ms
[2024-05-20 16:48:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14038731662024330940.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/ReachabilityCardinality16551863362552208598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14038731662024330940.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14038731662024330940.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 57
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :57 after 59
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :59 after 109
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :109 after 3315
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3315 after 3353
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3353 after 3395
Compilation finished in 21459 ms.
Running link step : cd /tmp/ltsmin6209116612687044256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin6209116612687044256;'/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' 'CANConstructionPT050ReachabilityCardinality202401==true'
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3395 after 100721
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :100721 after 101807
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :101807 after 1.96257e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.96257e+06 after 2.1871e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.1871e+06 after 2.77691e+07
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6209116612687044256;'/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' 'CANConstructionPT050ReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin6209116612687044256;'/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' 'CANConstructionPT050ReachabilityCardinality202403==true'
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.77691e+07 after 3.00579e+08
Detected timeout of ITS tools.
[2024-05-20 17:16:34] [INFO ] Applying decomposition
[2024-05-20 17:16:35] [INFO ] Flatten gal took : 241 ms
[2024-05-20 17:16:35] [INFO ] Decomposing Gal with order
[2024-05-20 17:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:16:35] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to InsertedCount in partition [Node1ResZone, Node33ReadyToInsert, Node33requestsent45, Node45GiveAnswer33],[Node3ReadyToInsert, Node3OKshare],[EmptyCAN, Node4ResZone, Node11GiveAnswer38],[Node6ReadyToInsert, Node5GiveAnswer6],[Node16ReadyToInsert, Node16NOshare, Node8GiveAnswer16],[Node0GiveAnswer16, Node16requestsent15],[Node16JoinMsg, Node16Request, Node19GiveAnswer16],[Node17ReadyToInsert, Node14GiveAnswer17],[Node19ReadyToInsert, Node19requestsent0],[Node25ReadyToInsert, Node5GiveAnswer25],[Node35ReadyToInsert, Node35WaitAnswer],[Node41ReadyToInsert, Node45GiveAnswer41],[Node44ReadyToInsert, Node44Request],[Node34GiveAnswer44, Node44requestsent34],[Node14ReadyToInsert, Node47ReadyToInsert, Node47IsInserted, Node10GiveAnswer14],[Node2ReadyToInsert, Node2requestsent10],[Node3GiveAnswer33, Node33requestsent3, Node38requestsent41],[Node4ReadyToInsert, Node4requestsent18, Node4requestsent49, Node42GiveAnswer4],[Node8requestsent13, Node30requestsent11],[Node8requestsent49, Node19GiveAnswer8],[Node14GiveAnswer30, Node30requestsent49],[Node10ReadyToInsert, Node10requestsent35],[Node29ReadyToInsert, Node12GiveAnswer29, Node29requestsent12],[Node9ReadyToInsert, Node13GiveAnswer9],[Node15ReadyToInsert, Node15requestsent49],[Node16requestsent30, Node34GiveAnswer26],[Node18GiveAnswer26, Node26requestsent49],[Node32ReadyToInsert, Node1requestsent20, Node20GiveAnswer1, Node32requestsent7],[Node1ReadyToInsert, Node1requestsent42, Node42GiveAnswer1],[Node16GiveAnswer22, Node22requestsent49],[Node20requestsent13, Node22requestsent3],[Node20requestsent30, Node20requestsent45, Node20requestsent49],[Node26requestsent21, Node31GiveAnswer36],[Node36requestsent19, Node36requestsent49],[Node28JoinMsg, Node45ReadyToInsert, Node45DHTinfo2],[Node28ReadyToInsert, Node28Request, Node28requestsent20],[Node37ReadyToInsert, Node29GiveAnswer37],[Node31requestsent4, Node31requestsent33, Node31requestsent49],[Node35GiveAnswer38, Node38requestsent49],[Node34ReadyToInsert, Node38requestsent8],[Node21requestsent1, Node21requestsent22, Node21requestsent45, Node21requestsent49],[Node45Request, Node45NOshare, Node35GiveAnswer45],[Node43GiveAnswer21, Node45requestsent32],[Node39ReadyToInsert, Node39requestsent3],[Node9GiveAnswer46, Node11requestsent45, Node45GiveAnswer11],[Node46requestsent41, Node46requestsent49],[Node11requestsent47, Node47GiveAnswer11],[Node11ReadyToInsert, Node45ID],[Node49ReadyToInsert, Node49requestsent48],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-20 17:16:35] [INFO ] Flatten gal took : 305 ms
[2024-05-20 17:16:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17345044539002610036.gal : 53 ms
[2024-05-20 17:16:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4262933428146410091.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/ReachabilityCardinality17345044539002610036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4262933428146410091.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4262933428146410091.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 47
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :47 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 50
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 58
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :58 after 64
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :64 after 82
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :82 after 933
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6209116612687044256;'/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' 'CANConstructionPT050ReachabilityCardinality202403==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6209116612687044256;'/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' 'CANConstructionPT050ReachabilityCardinality202401==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :933 after 1047

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="CANConstruction-PT-050"
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 CANConstruction-PT-050, 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 r070-tall-171620505000046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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