About the Execution of ITS-Tools for CANConstruction-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.159 | 3600000.00 | 10739262.00 | 3202.80 | TFFT??FTT?FTFT?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505000039.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-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505000039
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 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 2.5M 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-040-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716219519154
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 15:38:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 15:38:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:38:40] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-05-20 15:38:40] [INFO ] Transformed 3682 places.
[2024-05-20 15:38:40] [INFO ] Transformed 6720 transitions.
[2024-05-20 15:38:40] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (54 resets) in 2904 ms. (13 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1147 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
[2024-05-20 15:38:42] [INFO ] Flatten gal took : 562 ms
BEST_FIRST walk for 40004 steps (8 resets) in 883 ms. (45 steps per ms) remains 6/6 properties
[2024-05-20 15:38:43] [INFO ] Flatten gal took : 498 ms
[2024-05-20 15:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13381825593740911205.gal : 169 ms
[2024-05-20 15:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14794558537118338271.prop : 5 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1961 ms. (20 steps per ms) remains 6/6 properties
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/ReachabilityCardinality13381825593740911205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14794558537118338271.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 6/6 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
// Phase 1: matrix 6720 rows 3682 cols
[2024-05-20 15:38:43] [INFO ] Computed 81 invariants in 90 ms
[2024-05-20 15:38:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality14794558537118338271.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CANConstruction-PT-040-ReachabilityFireability-2024-10 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3418/3642 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3642 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/3682 variables, 40/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3682 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6720/10402 variables, 3682/3763 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10402 variables, 3160/6923 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10402/10402 variables, and 6923 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 3682/3682 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3452/3642 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-20 15:38:52] [INFO ] Deduced a trap composed of 69 places in 2230 ms of which 145 ms to minimize.
[2024-05-20 15:38:53] [INFO ] Deduced a trap composed of 70 places in 1642 ms of which 23 ms to minimize.
[2024-05-20 15:38:55] [INFO ] Deduced a trap composed of 71 places in 1704 ms of which 17 ms to minimize.
SMT process timed out in 12092ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 190 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 3682 transition count 6555
Reduce places removed 165 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 204 rules applied. Total rules applied 369 place count 3517 transition count 6516
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 408 place count 3478 transition count 6516
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 408 place count 3478 transition count 6489
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 462 place count 3451 transition count 6489
Discarding 1444 places :
Symmetric choice reduction at 3 with 1444 rule applications. Total rules 1906 place count 2007 transition count 3601
Iterating global reduction 3 with 1444 rules applied. Total rules applied 3350 place count 2007 transition count 3601
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 3374 place count 1995 transition count 3589
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3378 place count 1995 transition count 3585
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3382 place count 1991 transition count 3585
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 42
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :42 after 43
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :43 after 45
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :45 after 48
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :48 after 54
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :54 after 65
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :65 after 82
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3383 place count 1991 transition count 3584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3384 place count 1990 transition count 3584
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :82 after 92
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :92 after 101
Partial Free-agglomeration rule applied 103 times.
Drop transitions (Partial Free agglomeration) removed 103 transitions
Iterating global reduction 5 with 103 rules applied. Total rules applied 3487 place count 1990 transition count 3584
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 3513 place count 1990 transition count 3584
Applied a total of 3513 rules in 2008 ms. Remains 1990 /3682 variables (removed 1692) and now considering 3584/6720 (removed 3136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2023 ms. Remains : 1990/3682 places, 3584/6720 transitions.
RANDOM walk for 40000 steps (123 resets) in 1264 ms. (31 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 2048
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 5/5 properties
SDD size :101 after 119
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 95283 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 5
Probabilistic random walk after 95283 steps, saw 38148 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 3584 rows 1990 cols
[2024-05-20 15:39:01] [INFO ] Computed 81 invariants in 30 ms
[2024-05-20 15:39:01] [INFO ] State equation strengthened by 3226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1950 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1950 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/1990 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1990 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3584/5574 variables, 1990/2071 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5574 variables, 3226/5297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5574 variables, 0/5297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/5574 variables, 0/5297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5574/5574 variables, and 5297 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3032 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1990/1990 constraints, ReadFeed: 3226/3226 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1950 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 15:39:05] [INFO ] Deduced a trap composed of 54 places in 990 ms of which 12 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1721 after 1760
[2024-05-20 15:39:06] [INFO ] Deduced a trap composed of 53 places in 1013 ms of which 11 ms to minimize.
[2024-05-20 15:39:08] [INFO ] Deduced a trap composed of 51 places in 1020 ms of which 10 ms to minimize.
[2024-05-20 15:39:09] [INFO ] Deduced a trap composed of 45 places in 1070 ms of which 11 ms to minimize.
[2024-05-20 15:39:10] [INFO ] Deduced a trap composed of 49 places in 1042 ms of which 11 ms to minimize.
[2024-05-20 15:39:11] [INFO ] Deduced a trap composed of 45 places in 1051 ms of which 18 ms to minimize.
[2024-05-20 15:39:12] [INFO ] Deduced a trap composed of 46 places in 948 ms of which 11 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1760 after 1913
[2024-05-20 15:39:13] [INFO ] Deduced a trap composed of 54 places in 959 ms of which 11 ms to minimize.
[2024-05-20 15:39:14] [INFO ] Deduced a trap composed of 50 places in 924 ms of which 11 ms to minimize.
[2024-05-20 15:39:15] [INFO ] Deduced a trap composed of 46 places in 870 ms of which 10 ms to minimize.
[2024-05-20 15:39:16] [INFO ] Deduced a trap composed of 56 places in 877 ms of which 11 ms to minimize.
[2024-05-20 15:39:16] [INFO ] Deduced a trap composed of 59 places in 878 ms of which 12 ms to minimize.
[2024-05-20 15:39:17] [INFO ] Deduced a trap composed of 60 places in 874 ms of which 11 ms to minimize.
[2024-05-20 15:39:18] [INFO ] Deduced a trap composed of 49 places in 894 ms of which 10 ms to minimize.
[2024-05-20 15:39:19] [INFO ] Deduced a trap composed of 48 places in 876 ms of which 10 ms to minimize.
[2024-05-20 15:39:20] [INFO ] Deduced a trap composed of 46 places in 847 ms of which 11 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1913 after 2195
[2024-05-20 15:39:21] [INFO ] Deduced a trap composed of 52 places in 859 ms of which 10 ms to minimize.
[2024-05-20 15:39:22] [INFO ] Deduced a trap composed of 48 places in 859 ms of which 10 ms to minimize.
[2024-05-20 15:39:23] [INFO ] Deduced a trap composed of 48 places in 914 ms of which 10 ms to minimize.
[2024-05-20 15:39:24] [INFO ] Deduced a trap composed of 48 places in 885 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1950 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 15:39:25] [INFO ] Deduced a trap composed of 45 places in 932 ms of which 11 ms to minimize.
[2024-05-20 15:39:26] [INFO ] Deduced a trap composed of 45 places in 932 ms of which 10 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :2195 after 5312
[2024-05-20 15:39:27] [INFO ] Deduced a trap composed of 46 places in 940 ms of which 11 ms to minimize.
[2024-05-20 15:39:28] [INFO ] Deduced a trap composed of 51 places in 900 ms of which 11 ms to minimize.
[2024-05-20 15:39:29] [INFO ] Deduced a trap composed of 46 places in 914 ms of which 11 ms to minimize.
[2024-05-20 15:39:30] [INFO ] Deduced a trap composed of 46 places in 909 ms of which 10 ms to minimize.
[2024-05-20 15:39:30] [INFO ] Deduced a trap composed of 44 places in 892 ms of which 10 ms to minimize.
[2024-05-20 15:39:31] [INFO ] Deduced a trap composed of 44 places in 895 ms of which 10 ms to minimize.
[2024-05-20 15:39:32] [INFO ] Deduced a trap composed of 58 places in 873 ms of which 10 ms to minimize.
[2024-05-20 15:39:33] [INFO ] Deduced a trap composed of 51 places in 857 ms of which 10 ms to minimize.
[2024-05-20 15:39:34] [INFO ] Deduced a trap composed of 49 places in 868 ms of which 10 ms to minimize.
[2024-05-20 15:39:35] [INFO ] Deduced a trap composed of 47 places in 934 ms of which 12 ms to minimize.
[2024-05-20 15:39:36] [INFO ] Deduced a trap composed of 47 places in 941 ms of which 10 ms to minimize.
[2024-05-20 15:39:37] [INFO ] Deduced a trap composed of 45 places in 923 ms of which 10 ms to minimize.
[2024-05-20 15:39:38] [INFO ] Deduced a trap composed of 45 places in 941 ms of which 10 ms to minimize.
[2024-05-20 15:39:39] [INFO ] Deduced a trap composed of 46 places in 874 ms of which 10 ms to minimize.
[2024-05-20 15:39:40] [INFO ] Deduced a trap composed of 58 places in 889 ms of which 10 ms to minimize.
[2024-05-20 15:39:41] [INFO ] Deduced a trap composed of 58 places in 874 ms of which 10 ms to minimize.
[2024-05-20 15:39:42] [INFO ] Deduced a trap composed of 57 places in 876 ms of which 9 ms to minimize.
[2024-05-20 15:39:43] [INFO ] Deduced a trap composed of 58 places in 892 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1950 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 15:39:43] [INFO ] Deduced a trap composed of 45 places in 879 ms of which 10 ms to minimize.
[2024-05-20 15:39:44] [INFO ] Deduced a trap composed of 45 places in 876 ms of which 10 ms to minimize.
[2024-05-20 15:39:45] [INFO ] Deduced a trap composed of 48 places in 832 ms of which 14 ms to minimize.
[2024-05-20 15:39:46] [INFO ] Deduced a trap composed of 54 places in 850 ms of which 11 ms to minimize.
[2024-05-20 15:39:47] [INFO ] Deduced a trap composed of 47 places in 853 ms of which 10 ms to minimize.
[2024-05-20 15:39:48] [INFO ] Deduced a trap composed of 44 places in 839 ms of which 11 ms to minimize.
[2024-05-20 15:39:49] [INFO ] Deduced a trap composed of 51 places in 833 ms of which 10 ms to minimize.
[2024-05-20 15:39:50] [INFO ] Deduced a trap composed of 51 places in 834 ms of which 9 ms to minimize.
SMT process timed out in 48838ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 190 out of 1990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1990/1990 places, 3584/3584 transitions.
Applied a total of 0 rules in 113 ms. Remains 1990 /1990 variables (removed 0) and now considering 3584/3584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1990/1990 places, 3584/3584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1990/1990 places, 3584/3584 transitions.
Applied a total of 0 rules in 113 ms. Remains 1990 /1990 variables (removed 0) and now considering 3584/3584 (removed 0) transitions.
[2024-05-20 15:39:50] [INFO ] Invariant cache hit.
[2024-05-20 15:39:51] [INFO ] Implicit Places using invariants in 1011 ms returned [9, 18, 26, 33, 39, 46, 56, 64, 72, 79, 87, 95, 103, 111, 117, 125, 132, 140, 149, 157, 167, 175, 182, 189, 196, 204, 212, 220, 230, 236, 244, 253, 261, 269, 277, 284, 288, 295, 303, 310]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1023 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1950/1990 places, 3584/3584 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1950 transition count 3577
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1943 transition count 3577
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 73 place count 1884 transition count 3518
Iterating global reduction 2 with 59 rules applied. Total rules applied 132 place count 1884 transition count 3518
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 146 place count 1877 transition count 3511
Applied a total of 146 rules in 268 ms. Remains 1877 /1950 variables (removed 73) and now considering 3511/3584 (removed 73) transitions.
// Phase 1: matrix 3511 rows 1877 cols
[2024-05-20 15:39:51] [INFO ] Computed 41 invariants in 28 ms
[2024-05-20 15:39:52] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-20 15:39:52] [INFO ] Invariant cache hit.
[2024-05-20 15:39:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 15:40:16] [INFO ] Implicit Places using invariants and state equation in 24174 ms returned []
Implicit Place search using SMT with State Equation took 25006 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1877/1990 places, 3511/3584 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26411 ms. Remains : 1877/1990 places, 3511/3584 transitions.
RANDOM walk for 40000 steps (122 resets) in 517 ms. (77 steps per ms) remains 4/5 properties
FORMULA CANConstruction-PT-040-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
[2024-05-20 15:40:17] [INFO ] Invariant cache hit.
[2024-05-20 15:40:17] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1737/1877 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1877 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3511/5388 variables, 1877/1918 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5388 variables, 3160/5078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5388 variables, 0/5078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/5388 variables, 0/5078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5388/5388 variables, and 5078 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2185 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 1877/1877 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1737/1877 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :5312 after 7379
[2024-05-20 15:40:20] [INFO ] Deduced a trap composed of 44 places in 892 ms of which 10 ms to minimize.
[2024-05-20 15:40:21] [INFO ] Deduced a trap composed of 49 places in 1114 ms of which 11 ms to minimize.
[2024-05-20 15:40:22] [INFO ] Deduced a trap composed of 47 places in 1039 ms of which 11 ms to minimize.
[2024-05-20 15:40:23] [INFO ] Deduced a trap composed of 47 places in 897 ms of which 10 ms to minimize.
[2024-05-20 15:40:24] [INFO ] Deduced a trap composed of 46 places in 880 ms of which 10 ms to minimize.
[2024-05-20 15:40:25] [INFO ] Deduced a trap composed of 46 places in 814 ms of which 16 ms to minimize.
[2024-05-20 15:40:26] [INFO ] Deduced a trap composed of 45 places in 999 ms of which 11 ms to minimize.
[2024-05-20 15:40:27] [INFO ] Deduced a trap composed of 53 places in 744 ms of which 9 ms to minimize.
[2024-05-20 15:40:28] [INFO ] Deduced a trap composed of 45 places in 875 ms of which 10 ms to minimize.
[2024-05-20 15:40:28] [INFO ] Deduced a trap composed of 45 places in 742 ms of which 10 ms to minimize.
[2024-05-20 15:40:29] [INFO ] Deduced a trap composed of 46 places in 660 ms of which 9 ms to minimize.
[2024-05-20 15:40:30] [INFO ] Deduced a trap composed of 47 places in 678 ms of which 10 ms to minimize.
[2024-05-20 15:40:31] [INFO ] Deduced a trap composed of 50 places in 792 ms of which 10 ms to minimize.
[2024-05-20 15:40:31] [INFO ] Deduced a trap composed of 48 places in 846 ms of which 10 ms to minimize.
[2024-05-20 15:40:32] [INFO ] Deduced a trap composed of 51 places in 788 ms of which 9 ms to minimize.
[2024-05-20 15:40:33] [INFO ] Deduced a trap composed of 53 places in 778 ms of which 10 ms to minimize.
[2024-05-20 15:40:34] [INFO ] Deduced a trap composed of 46 places in 943 ms of which 11 ms to minimize.
[2024-05-20 15:40:35] [INFO ] Deduced a trap composed of 46 places in 829 ms of which 10 ms to minimize.
[2024-05-20 15:40:36] [INFO ] Deduced a trap composed of 46 places in 923 ms of which 11 ms to minimize.
[2024-05-20 15:40:37] [INFO ] Deduced a trap composed of 46 places in 959 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1877 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:40:38] [INFO ] Deduced a trap composed of 50 places in 970 ms of which 10 ms to minimize.
[2024-05-20 15:40:39] [INFO ] Deduced a trap composed of 45 places in 949 ms of which 10 ms to minimize.
[2024-05-20 15:40:40] [INFO ] Deduced a trap composed of 49 places in 850 ms of which 10 ms to minimize.
[2024-05-20 15:40:41] [INFO ] Deduced a trap composed of 47 places in 925 ms of which 10 ms to minimize.
[2024-05-20 15:40:42] [INFO ] Deduced a trap composed of 55 places in 840 ms of which 10 ms to minimize.
[2024-05-20 15:40:42] [INFO ] Deduced a trap composed of 45 places in 832 ms of which 10 ms to minimize.
[2024-05-20 15:40:43] [INFO ] Deduced a trap composed of 51 places in 820 ms of which 9 ms to minimize.
[2024-05-20 15:40:44] [INFO ] Deduced a trap composed of 50 places in 999 ms of which 10 ms to minimize.
[2024-05-20 15:40:45] [INFO ] Deduced a trap composed of 49 places in 658 ms of which 9 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :7379 after 11123
[2024-05-20 15:40:46] [INFO ] Deduced a trap composed of 46 places in 914 ms of which 11 ms to minimize.
[2024-05-20 15:40:47] [INFO ] Deduced a trap composed of 53 places in 759 ms of which 9 ms to minimize.
[2024-05-20 15:40:48] [INFO ] Deduced a trap composed of 50 places in 708 ms of which 8 ms to minimize.
[2024-05-20 15:40:48] [INFO ] Deduced a trap composed of 45 places in 661 ms of which 9 ms to minimize.
[2024-05-20 15:40:49] [INFO ] Deduced a trap composed of 48 places in 888 ms of which 10 ms to minimize.
[2024-05-20 15:40:50] [INFO ] Deduced a trap composed of 51 places in 762 ms of which 9 ms to minimize.
[2024-05-20 15:40:51] [INFO ] Deduced a trap composed of 46 places in 725 ms of which 10 ms to minimize.
[2024-05-20 15:40:51] [INFO ] Deduced a trap composed of 46 places in 726 ms of which 9 ms to minimize.
[2024-05-20 15:40:52] [INFO ] Deduced a trap composed of 43 places in 686 ms of which 9 ms to minimize.
[2024-05-20 15:40:53] [INFO ] Deduced a trap composed of 46 places in 996 ms of which 11 ms to minimize.
[2024-05-20 15:40:54] [INFO ] Deduced a trap composed of 53 places in 947 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1877 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:40:55] [INFO ] Deduced a trap composed of 46 places in 1025 ms of which 10 ms to minimize.
[2024-05-20 15:40:56] [INFO ] Deduced a trap composed of 52 places in 814 ms of which 10 ms to minimize.
[2024-05-20 15:40:57] [INFO ] Deduced a trap composed of 53 places in 819 ms of which 10 ms to minimize.
[2024-05-20 15:40:58] [INFO ] Deduced a trap composed of 53 places in 1028 ms of which 10 ms to minimize.
[2024-05-20 15:40:59] [INFO ] Deduced a trap composed of 46 places in 853 ms of which 9 ms to minimize.
[2024-05-20 15:41:00] [INFO ] Deduced a trap composed of 47 places in 769 ms of which 9 ms to minimize.
[2024-05-20 15:41:01] [INFO ] Deduced a trap composed of 46 places in 836 ms of which 11 ms to minimize.
[2024-05-20 15:41:01] [INFO ] Deduced a trap composed of 52 places in 754 ms of which 10 ms to minimize.
[2024-05-20 15:41:03] [INFO ] Deduced a trap composed of 44 places in 1081 ms of which 11 ms to minimize.
[2024-05-20 15:41:03] [INFO ] Deduced a trap composed of 49 places in 956 ms of which 11 ms to minimize.
[2024-05-20 15:41:04] [INFO ] Deduced a trap composed of 46 places in 952 ms of which 11 ms to minimize.
[2024-05-20 15:41:05] [INFO ] Deduced a trap composed of 47 places in 682 ms of which 9 ms to minimize.
[2024-05-20 15:41:06] [INFO ] Deduced a trap composed of 48 places in 694 ms of which 9 ms to minimize.
[2024-05-20 15:41:07] [INFO ] Deduced a trap composed of 46 places in 869 ms of which 10 ms to minimize.
[2024-05-20 15:41:08] [INFO ] Deduced a trap composed of 48 places in 956 ms of which 11 ms to minimize.
[2024-05-20 15:41:09] [INFO ] Deduced a trap composed of 44 places in 967 ms of which 11 ms to minimize.
[2024-05-20 15:41:10] [INFO ] Deduced a trap composed of 47 places in 805 ms of which 10 ms to minimize.
[2024-05-20 15:41:10] [INFO ] Deduced a trap composed of 54 places in 673 ms of which 9 ms to minimize.
[2024-05-20 15:41:11] [INFO ] Deduced a trap composed of 50 places in 839 ms of which 10 ms to minimize.
[2024-05-20 15:41:12] [INFO ] Deduced a trap composed of 44 places in 782 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1877 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:41:13] [INFO ] Deduced a trap composed of 45 places in 743 ms of which 10 ms to minimize.
[2024-05-20 15:41:14] [INFO ] Deduced a trap composed of 48 places in 833 ms of which 10 ms to minimize.
[2024-05-20 15:41:15] [INFO ] Deduced a trap composed of 50 places in 814 ms of which 10 ms to minimize.
[2024-05-20 15:41:15] [INFO ] Deduced a trap composed of 49 places in 805 ms of which 9 ms to minimize.
[2024-05-20 15:41:16] [INFO ] Deduced a trap composed of 57 places in 737 ms of which 10 ms to minimize.
[2024-05-20 15:41:17] [INFO ] Deduced a trap composed of 49 places in 730 ms of which 10 ms to minimize.
[2024-05-20 15:41:18] [INFO ] Deduced a trap composed of 54 places in 746 ms of which 10 ms to minimize.
[2024-05-20 15:41:18] [INFO ] Deduced a trap composed of 54 places in 736 ms of which 9 ms to minimize.
[2024-05-20 15:41:19] [INFO ] Deduced a trap composed of 46 places in 710 ms of which 10 ms to minimize.
[2024-05-20 15:41:20] [INFO ] Deduced a trap composed of 47 places in 1033 ms of which 10 ms to minimize.
[2024-05-20 15:41:21] [INFO ] Deduced a trap composed of 47 places in 852 ms of which 11 ms to minimize.
[2024-05-20 15:41:22] [INFO ] Deduced a trap composed of 45 places in 994 ms of which 11 ms to minimize.
[2024-05-20 15:41:23] [INFO ] Deduced a trap composed of 47 places in 826 ms of which 10 ms to minimize.
[2024-05-20 15:41:24] [INFO ] Deduced a trap composed of 53 places in 818 ms of which 10 ms to minimize.
[2024-05-20 15:41:25] [INFO ] Deduced a trap composed of 55 places in 946 ms of which 10 ms to minimize.
[2024-05-20 15:41:26] [INFO ] Deduced a trap composed of 45 places in 917 ms of which 11 ms to minimize.
[2024-05-20 15:41:27] [INFO ] Deduced a trap composed of 45 places in 888 ms of which 11 ms to minimize.
[2024-05-20 15:41:28] [INFO ] Deduced a trap composed of 53 places in 811 ms of which 11 ms to minimize.
[2024-05-20 15:41:29] [INFO ] Deduced a trap composed of 45 places in 940 ms of which 10 ms to minimize.
[2024-05-20 15:41:29] [INFO ] Deduced a trap composed of 46 places in 820 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1877 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:41:30] [INFO ] Deduced a trap composed of 47 places in 805 ms of which 9 ms to minimize.
[2024-05-20 15:41:31] [INFO ] Deduced a trap composed of 51 places in 873 ms of which 11 ms to minimize.
[2024-05-20 15:41:32] [INFO ] Deduced a trap composed of 49 places in 833 ms of which 11 ms to minimize.
[2024-05-20 15:41:33] [INFO ] Deduced a trap composed of 43 places in 685 ms of which 9 ms to minimize.
[2024-05-20 15:41:33] [INFO ] Deduced a trap composed of 43 places in 684 ms of which 10 ms to minimize.
[2024-05-20 15:41:34] [INFO ] Deduced a trap composed of 46 places in 866 ms of which 10 ms to minimize.
SMT process timed out in 77882ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 140 out of 1877 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1877/1877 places, 3511/3511 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1877 transition count 3509
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7 rules applied. Total rules applied 9 place count 1875 transition count 3504
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 14 place count 1870 transition count 3504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 1870 transition count 3503
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 1869 transition count 3503
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 1864 transition count 3494
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 1864 transition count 3494
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 78 place count 1838 transition count 3468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 1835 transition count 3469
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1835 transition count 3469
Applied a total of 86 rules in 668 ms. Remains 1835 /1877 variables (removed 42) and now considering 3469/3511 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 1835/1877 places, 3469/3511 transitions.
RANDOM walk for 40000 steps (129 resets) in 668 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 102070 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 102070 steps, saw 39689 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 3469 rows 1835 cols
[2024-05-20 15:41:38] [INFO ] Computed 41 invariants in 41 ms
[2024-05-20 15:41:39] [INFO ] State equation strengthened by 3180 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1695/1835 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3469/5304 variables, 1835/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5304 variables, 3180/5056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5304 variables, 0/5056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/5304 variables, 0/5056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5304/5304 variables, and 5056 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 1835/1835 constraints, ReadFeed: 3180/3180 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1695/1835 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:41:42] [INFO ] Deduced a trap composed of 55 places in 912 ms of which 11 ms to minimize.
[2024-05-20 15:41:43] [INFO ] Deduced a trap composed of 46 places in 975 ms of which 10 ms to minimize.
[2024-05-20 15:41:44] [INFO ] Deduced a trap composed of 45 places in 1027 ms of which 10 ms to minimize.
[2024-05-20 15:41:45] [INFO ] Deduced a trap composed of 52 places in 862 ms of which 10 ms to minimize.
[2024-05-20 15:41:46] [INFO ] Deduced a trap composed of 47 places in 862 ms of which 10 ms to minimize.
[2024-05-20 15:41:47] [INFO ] Deduced a trap composed of 46 places in 996 ms of which 11 ms to minimize.
[2024-05-20 15:41:48] [INFO ] Deduced a trap composed of 46 places in 850 ms of which 10 ms to minimize.
[2024-05-20 15:41:49] [INFO ] Deduced a trap composed of 45 places in 959 ms of which 11 ms to minimize.
[2024-05-20 15:41:50] [INFO ] Deduced a trap composed of 46 places in 918 ms of which 17 ms to minimize.
[2024-05-20 15:41:51] [INFO ] Deduced a trap composed of 46 places in 870 ms of which 9 ms to minimize.
[2024-05-20 15:41:51] [INFO ] Deduced a trap composed of 48 places in 733 ms of which 9 ms to minimize.
[2024-05-20 15:41:52] [INFO ] Deduced a trap composed of 52 places in 929 ms of which 10 ms to minimize.
[2024-05-20 15:41:53] [INFO ] Deduced a trap composed of 53 places in 795 ms of which 10 ms to minimize.
[2024-05-20 15:41:54] [INFO ] Deduced a trap composed of 49 places in 995 ms of which 11 ms to minimize.
[2024-05-20 15:41:55] [INFO ] Deduced a trap composed of 45 places in 1022 ms of which 11 ms to minimize.
[2024-05-20 15:41:56] [INFO ] Deduced a trap composed of 50 places in 890 ms of which 13 ms to minimize.
[2024-05-20 15:41:57] [INFO ] Deduced a trap composed of 52 places in 872 ms of which 10 ms to minimize.
[2024-05-20 15:41:58] [INFO ] Deduced a trap composed of 45 places in 1013 ms of which 11 ms to minimize.
[2024-05-20 15:41:59] [INFO ] Deduced a trap composed of 44 places in 1044 ms of which 11 ms to minimize.
[2024-05-20 15:42:00] [INFO ] Deduced a trap composed of 47 places in 986 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1835 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:42:01] [INFO ] Deduced a trap composed of 45 places in 840 ms of which 10 ms to minimize.
[2024-05-20 15:42:02] [INFO ] Deduced a trap composed of 46 places in 991 ms of which 10 ms to minimize.
[2024-05-20 15:42:03] [INFO ] Deduced a trap composed of 50 places in 1028 ms of which 11 ms to minimize.
[2024-05-20 15:42:04] [INFO ] Deduced a trap composed of 44 places in 878 ms of which 9 ms to minimize.
[2024-05-20 15:42:05] [INFO ] Deduced a trap composed of 49 places in 1020 ms of which 11 ms to minimize.
[2024-05-20 15:42:06] [INFO ] Deduced a trap composed of 45 places in 880 ms of which 11 ms to minimize.
[2024-05-20 15:42:07] [INFO ] Deduced a trap composed of 46 places in 914 ms of which 10 ms to minimize.
[2024-05-20 15:42:08] [INFO ] Deduced a trap composed of 44 places in 880 ms of which 10 ms to minimize.
[2024-05-20 15:42:09] [INFO ] Deduced a trap composed of 46 places in 875 ms of which 10 ms to minimize.
[2024-05-20 15:42:10] [INFO ] Deduced a trap composed of 44 places in 915 ms of which 10 ms to minimize.
[2024-05-20 15:42:11] [INFO ] Deduced a trap composed of 49 places in 978 ms of which 11 ms to minimize.
[2024-05-20 15:42:12] [INFO ] Deduced a trap composed of 50 places in 934 ms of which 12 ms to minimize.
[2024-05-20 15:42:13] [INFO ] Deduced a trap composed of 48 places in 984 ms of which 11 ms to minimize.
[2024-05-20 15:42:14] [INFO ] Deduced a trap composed of 46 places in 1008 ms of which 11 ms to minimize.
[2024-05-20 15:42:15] [INFO ] Deduced a trap composed of 49 places in 851 ms of which 10 ms to minimize.
[2024-05-20 15:42:16] [INFO ] Deduced a trap composed of 52 places in 1000 ms of which 10 ms to minimize.
[2024-05-20 15:42:17] [INFO ] Deduced a trap composed of 46 places in 994 ms of which 13 ms to minimize.
[2024-05-20 15:42:18] [INFO ] Deduced a trap composed of 45 places in 1115 ms of which 25 ms to minimize.
[2024-05-20 15:42:19] [INFO ] Deduced a trap composed of 45 places in 1455 ms of which 20 ms to minimize.
[2024-05-20 15:42:20] [INFO ] Deduced a trap composed of 46 places in 879 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1835 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:42:21] [INFO ] Deduced a trap composed of 55 places in 821 ms of which 10 ms to minimize.
[2024-05-20 15:42:22] [INFO ] Deduced a trap composed of 45 places in 854 ms of which 10 ms to minimize.
[2024-05-20 15:42:23] [INFO ] Deduced a trap composed of 53 places in 1185 ms of which 23 ms to minimize.
[2024-05-20 15:42:24] [INFO ] Deduced a trap composed of 50 places in 718 ms of which 9 ms to minimize.
[2024-05-20 15:42:25] [INFO ] Deduced a trap composed of 48 places in 876 ms of which 10 ms to minimize.
[2024-05-20 15:42:26] [INFO ] Deduced a trap composed of 44 places in 718 ms of which 13 ms to minimize.
[2024-05-20 15:42:27] [INFO ] Deduced a trap composed of 43 places in 1561 ms of which 24 ms to minimize.
[2024-05-20 15:42:29] [INFO ] Deduced a trap composed of 46 places in 1382 ms of which 21 ms to minimize.
[2024-05-20 15:42:30] [INFO ] Deduced a trap composed of 49 places in 1374 ms of which 10 ms to minimize.
[2024-05-20 15:42:31] [INFO ] Deduced a trap composed of 46 places in 901 ms of which 10 ms to minimize.
[2024-05-20 15:42:32] [INFO ] Deduced a trap composed of 51 places in 778 ms of which 9 ms to minimize.
[2024-05-20 15:42:33] [INFO ] Deduced a trap composed of 51 places in 775 ms of which 10 ms to minimize.
[2024-05-20 15:42:33] [INFO ] Deduced a trap composed of 51 places in 773 ms of which 10 ms to minimize.
[2024-05-20 15:42:34] [INFO ] Deduced a trap composed of 44 places in 907 ms of which 10 ms to minimize.
[2024-05-20 15:42:35] [INFO ] Deduced a trap composed of 47 places in 1132 ms of which 22 ms to minimize.
[2024-05-20 15:42:36] [INFO ] Deduced a trap composed of 45 places in 850 ms of which 10 ms to minimize.
[2024-05-20 15:42:38] [INFO ] Deduced a trap composed of 44 places in 1416 ms of which 11 ms to minimize.
[2024-05-20 15:42:39] [INFO ] Deduced a trap composed of 45 places in 1103 ms of which 22 ms to minimize.
[2024-05-20 15:42:41] [INFO ] Deduced a trap composed of 45 places in 1645 ms of which 25 ms to minimize.
[2024-05-20 15:42:42] [INFO ] Deduced a trap composed of 44 places in 1527 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1835 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 15:42:44] [INFO ] Deduced a trap composed of 55 places in 1598 ms of which 21 ms to minimize.
[2024-05-20 15:42:45] [INFO ] Deduced a trap composed of 45 places in 1512 ms of which 17 ms to minimize.
[2024-05-20 15:42:47] [INFO ] Deduced a trap composed of 50 places in 1268 ms of which 15 ms to minimize.
[2024-05-20 15:42:48] [INFO ] Deduced a trap composed of 45 places in 1245 ms of which 17 ms to minimize.
[2024-05-20 15:42:49] [INFO ] Deduced a trap composed of 46 places in 1409 ms of which 42 ms to minimize.
[2024-05-20 15:42:51] [INFO ] Deduced a trap composed of 49 places in 1647 ms of which 20 ms to minimize.
[2024-05-20 15:42:52] [INFO ] Deduced a trap composed of 55 places in 1329 ms of which 39 ms to minimize.
[2024-05-20 15:42:54] [INFO ] Deduced a trap composed of 46 places in 1210 ms of which 24 ms to minimize.
[2024-05-20 15:42:56] [INFO ] Deduced a trap composed of 47 places in 2005 ms of which 27 ms to minimize.
[2024-05-20 15:42:58] [INFO ] Deduced a trap composed of 44 places in 1702 ms of which 16 ms to minimize.
[2024-05-20 15:42:59] [INFO ] Deduced a trap composed of 49 places in 1461 ms of which 24 ms to minimize.
[2024-05-20 15:43:00] [INFO ] Deduced a trap composed of 49 places in 1413 ms of which 19 ms to minimize.
[2024-05-20 15:43:02] [INFO ] Deduced a trap composed of 49 places in 1873 ms of which 17 ms to minimize.
[2024-05-20 15:43:11] [INFO ] Deduced a trap composed of 48 places in 8901 ms of which 9 ms to minimize.
SMT process timed out in 92931ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 140 out of 1835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1835/1835 places, 3469/3469 transitions.
Applied a total of 0 rules in 192 ms. Remains 1835 /1835 variables (removed 0) and now considering 3469/3469 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 1835/1835 places, 3469/3469 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1835/1835 places, 3469/3469 transitions.
Applied a total of 0 rules in 299 ms. Remains 1835 /1835 variables (removed 0) and now considering 3469/3469 (removed 0) transitions.
[2024-05-20 15:43:12] [INFO ] Invariant cache hit.
[2024-05-20 15:43:14] [INFO ] Implicit Places using invariants in 1706 ms returned []
[2024-05-20 15:43:14] [INFO ] Invariant cache hit.
[2024-05-20 15:43:15] [INFO ] State equation strengthened by 3180 read => feed constraints.
[2024-05-20 15:43:46] [INFO ] Performed 1159/1835 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :11123 after 14228
[2024-05-20 15:44:10] [INFO ] Implicit Places using invariants and state equation in 55964 ms returned []
Implicit Place search using SMT with State Equation took 57671 ms to find 0 implicit places.
[2024-05-20 15:44:10] [INFO ] Redundant transitions in 312 ms returned []
Running 3429 sub problems to find dead transitions.
[2024-05-20 15:44:10] [INFO ] Invariant cache hit.
[2024-05-20 15:44:10] [INFO ] State equation strengthened by 3180 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1834 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1834/5304 variables, and 41 constraints, problems are : Problem set: 0 solved, 3429 unsolved in 30250 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1835 constraints, ReadFeed: 0/3180 constraints, PredecessorRefiner: 3429/3429 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3429 unsolved
SMT process timed out in 63697ms, After SMT, problems are : Problem set: 0 solved, 3429 unsolved
Search for dead transitions found 0 dead transitions in 63765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122131 ms. Remains : 1835/1835 places, 3469/3469 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2314 edges and 1835 vertex of which 663 / 1835 are part of one of the 17 SCC in 4 ms
Free SCC test removed 646 places
Drop transitions (Empty/Sink Transition effects.) removed 1275 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1276 transitions.
Graph (complete) has 2331 edges and 1189 vertex of which 1177 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 1177 transition count 2074
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Performed 727 Post agglomeration using F-continuation condition.Transition count delta: 727
Iterating post reduction 1 with 940 rules applied. Total rules applied 1060 place count 1069 transition count 1242
Reduce places removed 727 places and 0 transitions.
Ensure Unique test removed 706 transitions
Reduce isomorphic transitions removed 706 transitions.
Iterating post reduction 2 with 1433 rules applied. Total rules applied 2493 place count 342 transition count 536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2493 place count 342 transition count 535
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2495 place count 341 transition count 535
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2501 place count 335 transition count 525
Iterating global reduction 3 with 6 rules applied. Total rules applied 2507 place count 335 transition count 525
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2512 place count 335 transition count 520
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2532 place count 325 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2536 place count 323 transition count 512
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 2554 place count 323 transition count 494
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 2555 place count 323 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2556 place count 322 transition count 493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2558 place count 321 transition count 493
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 2579 place count 321 transition count 472
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2600 place count 300 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2602 place count 300 transition count 470
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 2632 place count 300 transition count 470
Applied a total of 2632 rules in 312 ms. Remains 300 /1835 variables (removed 1535) and now considering 470/3469 (removed 2999) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 470 rows 300 cols
[2024-05-20 15:45:14] [INFO ] Computed 30 invariants in 3 ms
[2024-05-20 15:45:14] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-20 15:45:14] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 15:45:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-20 15:45:15] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 15:45:15] [INFO ] After 907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-20 15:45:16] [INFO ] After 1323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-20 15:45:16] [INFO ] Flatten gal took : 32 ms
[2024-05-20 15:45:16] [INFO ] Flatten gal took : 28 ms
[2024-05-20 15:45:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11798070393868986306.gal : 32 ms
[2024-05-20 15:45:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5634628746113992339.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/ReachabilityCardinality11798070393868986306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5634628746113992339.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/ReachabilityCardinality5634628746113992339.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 10
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :10 after 118
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :118 after 933
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :933 after 16604
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :16604 after 282800
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :282800 after 1.55232e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.55232e+06 after 2.80035e+10
Detected timeout of ITS tools.
[2024-05-20 15:45:31] [INFO ] Flatten gal took : 24 ms
[2024-05-20 15:45:31] [INFO ] Applying decomposition
[2024-05-20 15:45:31] [INFO ] Flatten gal took : 32 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/graph5922651273785397486.txt' '-o' '/tmp/graph5922651273785397486.bin' '-w' '/tmp/graph5922651273785397486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5922651273785397486.bin' '-l' '-1' '-v' '-w' '/tmp/graph5922651273785397486.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:45:31] [INFO ] Decomposing Gal with order
[2024-05-20 15:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:45:32] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-20 15:45:32] [INFO ] Flatten gal took : 167 ms
[2024-05-20 15:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-20 15:45:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality670396166212664683.gal : 21 ms
[2024-05-20 15:45:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13218297772535676903.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/ReachabilityCardinality670396166212664683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13218297772535676903.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality13218297772535676903.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 55
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :55 after 143
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :143 after 8316
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8316 after 4.64033e+11
Invariant property CANConstruction-PT-040-ReachabilityFireability-2024-04 does not hold.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4.64033e+11 after 3.88543e+26
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.01438e+34,0.20694,7128,283,124,6462,702,741,7148,194,1865,0
Total reachable state count : 20143836297983691106411912890417152
Verifying 4 reachability properties.
Invariant property CANConstruction-PT-040-ReachabilityFireability-2024-04 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-040-ReachabilityFireability-2024-04,2.88711e+32,0.248065,8448,2179,177,11849,702,965,12080,213,1865,8083
Invariant property CANConstruction-PT-040-ReachabilityFireability-2024-05 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-040-ReachabilityFireability-2024-05,8.9816e+31,0.249632,8976,222,42,12099,702,973,12365,213,1865,8181
Invariant property CANConstruction-PT-040-ReachabilityFireability-2024-09 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-040-ReachabilityFireability-2024-09,2.42027e+24,0.27332,10296,319,64,16181,702,1051,18833,215,1865,11264
Reachability property CANConstruction-PT-040-ReachabilityFireability-2024-14 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-040-ReachabilityFireability-2024-14,1.31408e+25,0.278263,10824,137,56,17530,702,1108,19466,216,1865,12659
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 18491 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 15:45:33] [INFO ] Flatten gal took : 354 ms
[2024-05-20 15:45:33] [INFO ] Applying decomposition
[2024-05-20 15:45:33] [INFO ] Flatten gal took : 287 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/graph9189075429472062897.txt' '-o' '/tmp/graph9189075429472062897.bin' '-w' '/tmp/graph9189075429472062897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9189075429472062897.bin' '-l' '-1' '-v' '-w' '/tmp/graph9189075429472062897.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:45:34] [INFO ] Decomposing Gal with order
[2024-05-20 15:45:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:45:35] [INFO ] Removed a total of 2737 redundant transitions.
[2024-05-20 15:45:35] [INFO ] Flatten gal took : 608 ms
[2024-05-20 15:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 109 ms.
[2024-05-20 15:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2958348897949676539.gal : 101 ms
[2024-05-20 15:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4823919837441119712.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2958348897949676539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4823919837441119712.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4823919837441119712.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1 after 2.09812e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.09812e+07 after 4.69406e+09
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.69406e+09 after 8.73346e+09
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8.73346e+09 after 1.4468e+10
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.4468e+10 after 3.55933e+11
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3.55933e+11 after 4.06306e+11
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :4.06306e+11 after 6.14624e+11
ITS-tools command line returned an error code 137
[2024-05-20 16:02:00] [INFO ] Flatten gal took : 83 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1968010931288156983
[2024-05-20 16:02:00] [INFO ] Too many transitions (3469) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:02:00] [INFO ] Applying decomposition
[2024-05-20 16:02:01] [INFO ] Flatten gal took : 183 ms
[2024-05-20 16:02:01] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1968010931288156983
Running compilation step : cd /tmp/ltsmin1968010931288156983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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'
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/graph4662723284189824610.txt' '-o' '/tmp/graph4662723284189824610.bin' '-w' '/tmp/graph4662723284189824610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4662723284189824610.bin' '-l' '-1' '-v' '-w' '/tmp/graph4662723284189824610.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:02:01] [INFO ] Decomposing Gal with order
[2024-05-20 16:02:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:02:01] [INFO ] Removed a total of 3231 redundant transitions.
[2024-05-20 16:02:01] [INFO ] Flatten gal took : 325 ms
[2024-05-20 16:02:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4558 labels/synchronizations in 260 ms.
[2024-05-20 16:02:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12969486062878203163.gal : 75 ms
[2024-05-20 16:02:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3918458595063702911.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/ReachabilityFireability12969486062878203163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3918458595063702911.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability3918458595063702911.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 19
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :19 after 41
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :41 after 5004
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :5004 after 1.14038e+07
Compilation finished in 10973 ms.
Running link step : cd /tmp/ltsmin1968010931288156983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202404==true'
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.14038e+07 after 1.29845e+09
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.29845e+09 after 1.82796e+09
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202405==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202409==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202414==true'
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.82796e+09 after 1.02616e+12
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202414==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin1968010931288156983;'/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' 'CANConstructionPT040ReachabilityFireability202404==true'
Detected timeout of ITS tools.
[2024-05-20 16:29:48] [INFO ] Applying decomposition
[2024-05-20 16:29:48] [INFO ] Flatten gal took : 261 ms
[2024-05-20 16:29:48] [INFO ] Decomposing Gal with order
[2024-05-20 16:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:29:48] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to InsertedCount in partition [Node1ReadyToInsert, Node1JoinMsg, Node1Request, Node1requestsent17, Node1requestsent31, Node1requestsent39],[Node1requestsent5, Node5GiveAnswer1],[Node1requestsent19, Node19GiveAnswer1],[Node2ReadyToInsert, Node2ResZone, Node2IsInserted, Node2DHTinfo2, Node2Request, Node0GiveAnswer2, Node2requestsent12, Node2requestsent32, Node2requestsent33, Node12GiveAnswer2, Node32GiveAnswer2, Node33GiveAnswer2],[Node7IsInserted, Node0GiveAnswer7, Node7requestsent18, Node7requestsent21],[Node7ReadyToInsert, Node7ResZone, Node7DHTinfo2, Node7Request, Node5GiveAnswer7, Node7requestsent5, Node7requestsent17, Node7requestsent24, Node17GiveAnswer7, Node24GiveAnswer7],[Node10IsInserted, Node0GiveAnswer10, Node10requestsent12],[Node10ReadyToInsert, Node10ResZone, Node10DHTinfo2, Node10Request, Node10requestsent38, Node38GiveAnswer10],[Node12ReadyToInsert, Node12ResZone, Node12IsInserted],[Node12requestsent22, Node22GiveAnswer12],[Node13ResZone, Node13IsInserted],[Node13ReadyToInsert, Node13Request, Node0GiveAnswer13],[Node13DHTinfo2, Node13requestsent14, Node14GiveAnswer13],[Node13requestsent21, Node21GiveAnswer13],[Node15ResZone, Node15IsInserted],[Node15ReadyToInsert, Node15Request, Node0GiveAnswer15],[Node15requestsent28, Node28GiveAnswer15],[Node15DHTinfo2, Node15requestsent21, Node21GiveAnswer15],[Node16ReadyToInsert, Node16DHTinfo2, Node16Request],[Node12GiveAnswer16, Node16requestsent12],[Node19ResZone, Node19IsInserted],[Node19DHTinfo2, Node17GiveAnswer19, Node19requestsent17],[Node19ReadyToInsert, Node19Request, Node0GiveAnswer19],[Node20ReadyToInsert, Node20ResZone, Node20IsInserted, Node20Bootstrap, Node20Request, Node0GiveAnswer20],[Node22ResZone, Node22IsInserted],[Node22ReadyToInsert, Node22requestsent0, Node22requestsent30, Node22requestsent39],[EmptyCAN, Node23ResZone, Node23IsInserted],[Node38ReadyToInsert, Node38ResZone, Node38IsInserted],[Node9ReadyToInsert, Node9ResZone, Node9IsInserted, Node9requestsent29, Node9requestsent39, Node24GiveAnswer9],[Node23ReadyToInsert, Node10GiveAnswer23, Node23requestsent7, Node23requestsent38, Node37GiveAnswer23, Node39GiveAnswer23],[Node25ResZone, Node25IsInserted, Node0GiveAnswer25],[Node25ReadyToInsert, Node25DHTinfo2],[Node25Request, Node25requestsent3],[Node25NOshare, Node4GiveAnswer25],[Node26ReadyToInsert, Node26ResZone, Node26IsInserted, Node26DHTinfo2, Node26Request, Node0GiveAnswer26, Node26requestsent29, Node29GiveAnswer26],[Node32ResZone, Node32IsInserted],[Node32DHTinfo2, Node32requestsent33, Node33GiveAnswer32],[Node32ReadyToInsert, Node32Request, Node0GiveAnswer32, Node32requestsent7, Node32requestsent31],[Node33ReadyToInsert, Node33ResZone, Node33IsInserted, Node33DHTinfo2, Node33Request, Node0GiveAnswer33, Node10GiveAnswer33, Node33requestsent10, Node33requestsent35, Node35GiveAnswer33],[Node35ReadyToInsert],[Node39ResZone, Node39IsInserted],[Node39ReadyToInsert, Node39Request, Node39IsNonInsertedNode],[Node0GiveAnswer39, Node39requestsent11],[Node11ReadyToInsert, Node11ResZone, Node11DHTinfo2, Node11Request],[Node11IsInserted, Node0GiveAnswer11, Node11requestsent3],[Node17ReadyToInsert, Node17ResZone, Node17IsInserted, Node17DHTinfo2, Node17Request, Node0GiveAnswer17, Node8GiveAnswer17, Node17requestsent8, Node17requestsent25, Node25GiveAnswer17],[Node28ResZone, Node28IsInserted],[Node28ReadyToInsert, Node28Request, Node0GiveAnswer28],[Node30requestsent35, Node35GiveAnswer30],[Node30ReadyToInsert, Node30Request, Node0GiveAnswer30],[Node30DHTinfo2, Node5GiveAnswer30, Node30requestsent5],[Node29GiveAnswer30, Node30requestsent29],[Node30requestsent34, Node34GiveAnswer30],[Node30ResZone, Node30IsInserted],[Node31ReadyToInsert, Node31ResZone, Node31IsInserted, Node31DHTinfo2, Node31JoinMsg, Node31Request, Node1GiveAnswer31, Node14GiveAnswer31, Node31requestsent14],[Node0ResZone, Node0IsInserted],[Node0ReadyToInsert, Node0Bootstrap],[Node0requestsent19, Node1GiveAnswer0],[Node0DHTinfo2, Node2GiveAnswer0],[Node0Request, Node34GiveAnswer0],[Node3ReadyToInsert, Node3ResZone, Node3IsInserted, Node3requestsent39, Node32GiveAnswer3],[Node4ReadyToInsert, Node4requestsent23, Node4requestsent31, Node4requestsent39, Node19GiveAnswer4, Node26GiveAnswer4, Node27GiveAnswer4],[Node5ReadyToInsert, Node5ResZone, Node5IsInserted, Node5requestsent39, Node29GiveAnswer5],[Node6ReadyToInsert, Node6Request, Node0GiveAnswer6],[Node6DHTinfo2, Node6requestsent12, Node12GiveAnswer6],[Node6requestsent35, Node35GiveAnswer6],[Node6ResZone, Node6IsInserted],[Node6requestsent23, Node23GiveAnswer6],[Node8requestsent33, Node33GiveAnswer8],[Node8ReadyToInsert, Node8requestsent14, Node14GiveAnswer8],[Node14ReadyToInsert, Node14requestsent33, Node14requestsent39, Node18GiveAnswer14],[Node18ReadyToInsert, Node18ResZone, Node18IsInserted, Node18requestsent25, Node18requestsent39, Node26GiveAnswer18],[Node21ReadyToInsert, Node21ResZone, Node21IsInserted, Node21requestsent33, Node21requestsent39, Node38GiveAnswer21],[Node27ResZone, Node27IsInserted],[Node27ReadyToInsert, Node27Request, Node0GiveAnswer27, Node27requestsent23],[Node27DHTinfo2, Node25GiveAnswer27, Node27requestsent25],[Node29ReadyToInsert, Node29DHTinfo2],[Node29ResZone, Node29IsInserted],[Node29Request, Node0GiveAnswer29, Node29requestsent15],[Node16GiveAnswer29, Node29requestsent16],[Node34ReadyToInsert, Node5GiveAnswer34, Node34requestsent20, Node34requestsent39],[Node24ReadyToInsert, Node24requestsent39, Node35GiveAnswer24],[Node36ReadyToInsert, Node12GiveAnswer36, Node15GiveAnswer36, Node34GiveAnswer36, Node36requestsent2, Node36requestsent26, Node36requestsent39],[Node37ReadyToInsert, Node32GiveAnswer37, Node37requestsent32],[Node37requestsent38, Node38GiveAnswer37],
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 16:29:49] [INFO ] Flatten gal took : 176 ms
[2024-05-20 16:29:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17433330090576957880.gal : 38 ms
[2024-05-20 16:29:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13144963898576203136.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/ReachabilityFireability17433330090576957880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13144963898576203136.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/ReachabilityFireability13144963898576203136.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :29 after 30
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :30 after 33
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :33 after 37
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :37 after 44
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :44 after 47
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :47 after 283
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :283 after 356
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :356 after 2270
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2270 after 9970
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9970 after 31936
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :31936 after 79919
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-040"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-040, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505000039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;