About the Execution of ITS-Tools for Echo-PT-d04r03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12884.252 | 3600000.00 | 5664382.00 | 12392.40 | TTTTFFFFFFFF?FTT | 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.r158-smll-171636266200134.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 Echo-PT-d04r03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266200134
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 04:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 04:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 530K 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 Echo-PT-d04r03-ReachabilityCardinality-2024-00
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-01
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-02
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-03
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-04
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-05
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-06
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-07
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-08
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-09
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-10
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-11
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-12
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-13
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-14
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716495681233
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d04r03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 20:21:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:21:24] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2024-05-23 20:21:24] [INFO ] Transformed 1019 places.
[2024-05-23 20:21:24] [INFO ] Transformed 850 transitions.
[2024-05-23 20:21:24] [INFO ] Found NUPN structural information;
[2024-05-23 20:21:24] [INFO ] Parsed PT model containing 1019 places and 850 transitions and 6340 arcs in 905 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (244 resets) in 4518 ms. (8 steps per ms) remains 3/13 properties
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 20:21:26] [INFO ] Flatten gal took : 748 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1224 ms. (32 steps per ms) remains 3/3 properties
[2024-05-23 20:21:26] [INFO ] Flatten gal took : 189 ms
BEST_FIRST walk for 40004 steps (8 resets) in 827 ms. (48 steps per ms) remains 3/3 properties
[2024-05-23 20:21:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16698006318694610816.gal : 167 ms
[2024-05-23 20:21:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6787182257743797051.prop : 8 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/ReachabilityCardinality16698006318694610816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6787182257743797051.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 663 ms. (60 steps per ms) remains 2/3 properties
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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
// Phase 1: matrix 850 rows 1019 cols
[2024-05-23 20:21:27] [INFO ] Computed 513 invariants in 117 ms
Loading property file /tmp/ReachabilityCardinality6787182257743797051.prop.
Problem Echo-PT-d04r03-ReachabilityCardinality-2024-07 is UNSAT
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 151/197 variables, 29/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 151/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/263 variables, 22/249 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 66/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 69/332 variables, 14/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 69/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 4/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/359 variables, 6/408 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 27/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 1/436 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/365 variables, 1/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 6/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 56
At refinement iteration 20 (OVERLAPS) 486/851 variables, 292/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :56 after 328
At refinement iteration 21 (INCLUDED_ONLY) 0/851 variables, 486/1221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/851 variables, 0/1221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 49/900 variables, 40/1261 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/900 variables, 49/1310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :328 after 363
At refinement iteration 25 (INCLUDED_ONLY) 0/900 variables, 0/1310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/905 variables, 1/1311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/905 variables, 5/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/905 variables, 0/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 112/1017 variables, 100/1416 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1017 variables, 112/1528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1017 variables, 0/1528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :363 after 427
At refinement iteration 32 (OVERLAPS) 2/1019 variables, 2/1530 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1019 variables, 2/1532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1019 variables, 0/1532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 850/1869 variables, 1019/2551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1869 variables, 0/2551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/1869 variables, 0/2551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 2551 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2082 ms.
Refiners :[Domain max(s): 1019/1019 constraints, Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 398/398 constraints, State Equation: 1019/1019 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/54 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 45/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/92 variables, 14/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 38/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 68/160 variables, 14/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 68/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 45/205 variables, 10/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 45/251 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/221 variables, 3/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 16/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 448/669 variables, 220/490 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/669 variables, 448/938 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/669 variables, 0/938 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 55/724 variables, 47/985 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/724 variables, 55/1040 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 20:21:30] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 66 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/724 variables, 1/1041 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/724 variables, 0/1041 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 256
At refinement iteration 24 (OVERLAPS) 244/968 variables, 156/1197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :427 after 1400
At refinement iteration 25 (INCLUDED_ONLY) 0/968 variables, 244/1441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 20:21:31] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 7 ms to minimize.
[2024-05-23 20:21:31] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/968 variables, 2/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/968 variables, 0/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 17/985 variables, 17/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/985 variables, 17/1477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 20:21:32] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 15 ms to minimize.
[2024-05-23 20:21:32] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 6 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/985 variables, 2/1479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/985 variables, 0/1479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
At refinement iteration 32 (OVERLAPS) 32/1017 variables, 22/1501 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :1400 after 3901
At refinement iteration 33 (INCLUDED_ONLY) 0/1017 variables, 32/1533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 20:21:32] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 5 ms to minimize.
[2024-05-23 20:21:33] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 6 ms to minimize.
[2024-05-23 20:21:33] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 5 ms to minimize.
[2024-05-23 20:21:33] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 4 ms to minimize.
[2024-05-23 20:21:34] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 4 ms to minimize.
[2024-05-23 20:21:34] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 4 ms to minimize.
[2024-05-23 20:21:34] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 4 ms to minimize.
SMT process timed out in 7585ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 850/850 transitions.
Graph (complete) has 4450 edges and 1019 vertex of which 938 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.14 ms
Discarding 81 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 938 transition count 850
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 937 transition count 849
Applied a total of 9 rules in 491 ms. Remains 937 /1019 variables (removed 82) and now considering 849/850 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 937/1019 places, 849/850 transitions.
RANDOM walk for 40000 steps (252 resets) in 2046 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3901 after 17053
Interrupted probabilistic random walk after 393015 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 393015 steps, saw 70616 distinct states, run finished after 3007 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 849 rows 937 cols
[2024-05-23 20:21:40] [INFO ] Computed 432 invariants in 1170 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 883/892 variables, 387/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :17053 after 29803
SDD proceeding with computation,3 properties remain. new max is 4096
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/1786 variables, and 1279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45022 ms.
Refiners :[Domain max(s): 892/937 constraints, Generalized P Invariants (flows): 387/432 constraints, State Equation: 0/937 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :29803 after 276650
At refinement iteration 2 (OVERLAPS) 883/892 variables, 387/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 892/1786 variables, and 1279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45017 ms.
Refiners :[Domain max(s): 892/937 constraints, Generalized P Invariants (flows): 387/432 constraints, State Equation: 0/937 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 91331ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 937 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 937/937 places, 849/849 transitions.
Applied a total of 0 rules in 40 ms. Remains 937 /937 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 937/937 places, 849/849 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 937/937 places, 849/849 transitions.
Applied a total of 0 rules in 43 ms. Remains 937 /937 variables (removed 0) and now considering 849/849 (removed 0) transitions.
[2024-05-23 20:23:10] [INFO ] Invariant cache hit.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :276650 after 1.29373e+06
[2024-05-23 20:23:44] [INFO ] Performed 210/937 implicitness test of which 5 returned IMPLICIT in 30 seconds.
[2024-05-23 20:24:23] [INFO ] Performed 294/937 implicitness test of which 8 returned IMPLICIT in 69 seconds.
[2024-05-23 20:24:57] [INFO ] Performed 338/937 implicitness test of which 8 returned IMPLICIT in 103 seconds.
[2024-05-23 20:25:33] [INFO ] Performed 392/937 implicitness test of which 9 returned IMPLICIT in 139 seconds.
[2024-05-23 20:25:50] [INFO ] Implicit Places using invariants in 160044 ms returned [21, 71, 163, 197, 209, 224, 236, 270, 362]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 160089 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 928/937 places, 849/849 transitions.
Applied a total of 0 rules in 44 ms. Remains 928 /928 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 160192 ms. Remains : 928/937 places, 849/849 transitions.
RANDOM walk for 40000 steps (252 resets) in 1368 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 407179 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 407179 steps, saw 72757 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
// Phase 1: matrix 849 rows 928 cols
[2024-05-23 20:25:54] [INFO ] Computed 423 invariants in 864 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 891/900 variables, 395/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/1777 variables, and 1295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75014 ms.
Refiners :[Domain max(s): 900/928 constraints, Generalized P Invariants (flows): 395/423 constraints, State Equation: 0/928 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 891/900 variables, 395/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 891/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/928 variables, 28/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/928 variables, 28/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/928 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 849/1777 variables, 928/2279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1777 variables, 1/2280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1777 variables, 0/2280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1777 variables, 0/2280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1777/1777 variables, and 2280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4280 ms.
Refiners :[Domain max(s): 928/928 constraints, Generalized P Invariants (flows): 423/423 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 80241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 849/849 transitions.
Applied a total of 0 rules in 46 ms. Remains 928 /928 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 928/928 places, 849/849 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 849/849 transitions.
Applied a total of 0 rules in 40 ms. Remains 928 /928 variables (removed 0) and now considering 849/849 (removed 0) transitions.
[2024-05-23 20:27:14] [INFO ] Invariant cache hit.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.29373e+06 after 2.07614e+06
[2024-05-23 20:27:49] [INFO ] Performed 5/928 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-23 20:28:21] [INFO ] Performed 8/928 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-23 20:28:55] [INFO ] Performed 37/928 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-05-23 20:29:28] [INFO ] Performed 44/928 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-05-23 20:29:28] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-05-23 20:29:28] [INFO ] Implicit Places using invariants in 133787 ms returned []
[2024-05-23 20:29:28] [INFO ] Invariant cache hit.
[2024-05-23 20:32:08] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 293816 ms to find 0 implicit places.
[2024-05-23 20:32:08] [INFO ] Redundant transitions in 61 ms returned []
Running 841 sub problems to find dead transitions.
[2024-05-23 20:32:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/928 variables, 928/928 constraints. Problems are: Problem set: 0 solved, 841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 928/1777 variables, and 1351 constraints, problems are : Problem set: 0 solved, 841 unsolved in 30053 ms.
Refiners :[Domain max(s): 928/928 constraints, Generalized P Invariants (flows): 423/423 constraints, State Equation: 0/928 constraints, PredecessorRefiner: 841/841 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 841 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/928 variables, 928/928 constraints. Problems are: Problem set: 0 solved, 841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 928/1777 variables, and 1351 constraints, problems are : Problem set: 0 solved, 841 unsolved in 30043 ms.
Refiners :[Domain max(s): 928/928 constraints, Generalized P Invariants (flows): 423/423 constraints, State Equation: 0/928 constraints, PredecessorRefiner: 0/841 constraints, Known Traps: 0/0 constraints]
After SMT, in 61304ms problems are : Problem set: 0 solved, 841 unsolved
Search for dead transitions found 0 dead transitions in 61323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355262 ms. Remains : 928/928 places, 849/849 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 20:33:10] [INFO ] Flatten gal took : 200 ms
[2024-05-23 20:33:10] [INFO ] Applying decomposition
[2024-05-23 20:33:10] [INFO ] Flatten gal took : 165 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/graph12293841897513578601.txt' '-o' '/tmp/graph12293841897513578601.bin' '-w' '/tmp/graph12293841897513578601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12293841897513578601.bin' '-l' '-1' '-v' '-w' '/tmp/graph12293841897513578601.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:33:11] [INFO ] Decomposing Gal with order
[2024-05-23 20:33:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:33:11] [INFO ] Removed a total of 1558 redundant transitions.
[2024-05-23 20:33:11] [INFO ] Flatten gal took : 309 ms
[2024-05-23 20:33:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 99 ms.
[2024-05-23 20:33:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8319026369661355191.gal : 30 ms
[2024-05-23 20:33:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3845641171057768061.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/ReachabilityCardinality8319026369661355191.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3845641171057768061.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/ReachabilityCardinality3845641171057768061.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 21082
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21082 after 1.94644e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.94644e+06 after 1.63121e+10
Detected timeout of ITS tools.
[2024-05-23 21:03:12] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12522025696960054777
[2024-05-23 21:03:12] [INFO ] Computing symmetric may disable matrix : 849 transitions.
[2024-05-23 21:03:12] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:03:12] [INFO ] Computing symmetric may enable matrix : 849 transitions.
[2024-05-23 21:03:12] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:03:12] [INFO ] Applying decomposition
[2024-05-23 21:03:12] [INFO ] Flatten gal took : 61 ms
[2024-05-23 21:03:12] [INFO ] Computing Do-Not-Accords matrix : 849 transitions.
[2024-05-23 21:03:12] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 21:03:12] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12522025696960054777
Running compilation step : cd /tmp/ltsmin12522025696960054777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph14315414449644239152.txt' '-o' '/tmp/graph14315414449644239152.bin' '-w' '/tmp/graph14315414449644239152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14315414449644239152.bin' '-l' '-1' '-v' '-w' '/tmp/graph14315414449644239152.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:03:13] [INFO ] Decomposing Gal with order
[2024-05-23 21:03:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:03:13] [INFO ] Removed a total of 1457 redundant transitions.
[2024-05-23 21:03:13] [INFO ] Flatten gal took : 144 ms
[2024-05-23 21:03:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-23 21:03:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2819117109003143508.gal : 19 ms
[2024-05-23 21:03:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15220344121423467426.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/ReachabilityCardinality2819117109003143508.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15220344121423467426.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/ReachabilityCardinality15220344121423467426.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 33
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :33 after 6162
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6162 after 16232
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16232 after 1.65152e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.65152e+08 after 7.92602e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.92602e+08 after 1.0831e+12
Compilation finished in 6102 ms.
Running link step : cd /tmp/ltsmin12522025696960054777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin12522025696960054777;'/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' 'EchoPTd04r03ReachabilityCardinality202412==true'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.0831e+12 after 8.14436e+14
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.152: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: Initializing POR dependencies: labels 850, guards 849
pins2lts-mc-linux64( 2/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.186: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 30.755: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 31.037: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 31.040: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 31.039: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 31.041: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 31.042: There are 850 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 31.042: State length is 928, there are 849 groups
pins2lts-mc-linux64( 0/ 8), 31.042: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 31.042: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 31.042: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 31.042: Visible groups: 0 / 849, labels: 1 / 850
pins2lts-mc-linux64( 0/ 8), 31.042: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 31.042: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 31.041: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 31.044: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 31.044: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 31.043: "EchoPTd04r03ReachabilityCardinality202412==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 32.052: ~4 levels ~960 states ~18664 transitions
pins2lts-mc-linux64( 5/ 8), 32.771: ~3 levels ~1920 states ~44808 transitions
pins2lts-mc-linux64( 0/ 8), 33.946: ~5 levels ~3840 states ~81472 transitions
pins2lts-mc-linux64( 0/ 8), 36.030: ~5 levels ~7680 states ~173888 transitions
pins2lts-mc-linux64( 0/ 8), 40.509: ~5 levels ~15360 states ~359672 transitions
pins2lts-mc-linux64( 0/ 8), 49.191: ~6 levels ~30720 states ~745896 transitions
pins2lts-mc-linux64( 0/ 8), 67.547: ~6 levels ~61440 states ~1589288 transitions
pins2lts-mc-linux64( 0/ 8), 103.861: ~6 levels ~122880 states ~3278192 transitions
pins2lts-mc-linux64( 0/ 8), 172.747: ~7 levels ~245760 states ~6664664 transitions
pins2lts-mc-linux64( 0/ 8), 324.538: ~7 levels ~491520 states ~14054952 transitions
pins2lts-mc-linux64( 2/ 8), 423.067: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 424.002:
pins2lts-mc-linux64( 0/ 8), 424.002: mean standard work distribution: 5.9% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 424.002:
pins2lts-mc-linux64( 0/ 8), 424.002: Explored 574595 states 17935982 transitions, fanout: 31.215
pins2lts-mc-linux64( 0/ 8), 424.002: Total exploration time 392.950 sec (392.100 sec minimum, 392.440 sec on average)
pins2lts-mc-linux64( 0/ 8), 424.002: States per second: 1462, Transitions per second: 45644
pins2lts-mc-linux64( 0/ 8), 424.002: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 424.002:
pins2lts-mc-linux64( 0/ 8), 424.002: Queue width: 8B, total height: 5540096, memory: 42.27MB
pins2lts-mc-linux64( 0/ 8), 424.002: Tree memory: 302.7MB, 51.9 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 424.002: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 424.002: Stored 866 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 424.002: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 424.002: Est. total memory use: 344.9MB (~1066.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12522025696960054777;'/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' 'EchoPTd04r03ReachabilityCardinality202412==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12522025696960054777;'/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' 'EchoPTd04r03ReachabilityCardinality202412==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d04r03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Echo-PT-d04r03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266200134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d04r03.tgz
mv Echo-PT-d04r03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;