fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r312-tall-171662337900150
Last Updated
July 7, 2024

About the Execution of ITS-Tools for RERS17pb113-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 489619.00 0.00 0.00 ?TFFFFTFF?TT?TT? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662337900150.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 RERS17pb113-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337900150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716676742284

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 22:39:03] [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-25 22:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 22:39:04] [INFO ] Load time of PNML (sax parser for PT used): 677 ms
[2024-05-25 22:39:04] [INFO ] Transformed 639 places.
[2024-05-25 22:39:04] [INFO ] Transformed 31353 transitions.
[2024-05-25 22:39:04] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 904 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 5383 ms. (7 steps per ms) remains 8/16 properties
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2023-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 8/8 properties
[2024-05-25 22:39:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-05-25 22:39:07] [INFO ] Computed 25 invariants in 100 ms
[2024-05-25 22:39:07] [INFO ] Flatten gal took : 1719 ms
[2024-05-25 22:39:08] [INFO ] State equation strengthened by 829 read => feed constraints.
[2024-05-25 22:39:08] [INFO ] Flatten gal took : 880 ms
[2024-05-25 22:39:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14579008373285810530.gal : 414 ms
[2024-05-25 22:39:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4091623799549683614.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14579008373285810530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4091623799549683614.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem RERS17pb113-PT-5-ReachabilityCardinality-2024-13 is UNSAT
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 541/628 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 11/639 variables, 11/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality4091623799549683614.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18965/18965 variables, and 664 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 639/639 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 543/628 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-25 22:39:15] [INFO ] Deduced a trap composed of 49 places in 687 ms of which 34 ms to minimize.
[2024-05-25 22:39:15] [INFO ] Deduced a trap composed of 43 places in 328 ms of which 2 ms to minimize.
[2024-05-25 22:39:17] [INFO ] Deduced a trap composed of 65 places in 1283 ms of which 2 ms to minimize.
[2024-05-25 22:39:17] [INFO ] Deduced a trap composed of 41 places in 373 ms of which 1 ms to minimize.
[2024-05-25 22:39:18] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-25 22:39:19] [INFO ] Deduced a trap composed of 66 places in 595 ms of which 1 ms to minimize.
SMT process timed out in 11799ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 392 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 627/639 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2361 ms. (16 steps per ms) remains 5/7 properties
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 5/5 properties
[2024-05-25 22:39:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2024-05-25 22:39:21] [INFO ] Computed 13 invariants in 87 ms
[2024-05-25 22:39:21] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 543/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :11 after 22
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :22 after 24
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :24 after 29
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :29 after 30
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :30 after 34
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :34 after 62
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :62 after 116
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :116 after 254
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :254 after 834
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :834 after 3634
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 640 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 543/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-25 22:40:07] [INFO ] Deduced a trap composed of 49 places in 675 ms of which 3 ms to minimize.
[2024-05-25 22:40:08] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 2 ms to minimize.
[2024-05-25 22:40:09] [INFO ] Deduced a trap composed of 66 places in 542 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-25 22:40:11] [INFO ] Deduced a trap composed of 65 places in 717 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :3634 after 18226
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18953/18953 variables, and 644 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 90765ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 341 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 627/627 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1701 ms. (23 steps per ms) remains 4/5 properties
FORMULA RERS17pb113-PT-5-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 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 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
[2024-05-25 22:40:53] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:40:53] [INFO ] Invariant cache hit.
[2024-05-25 22:40:53] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 545/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :18226 after 791378
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 640 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 545/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 22:42:09] [INFO ] Deduced a trap composed of 49 places in 829 ms of which 7 ms to minimize.
[2024-05-25 22:42:10] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2024-05-25 22:42:10] [INFO ] Deduced a trap composed of 66 places in 504 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 22:42:11] [INFO ] Deduced a trap composed of 41 places in 399 ms of which 1 ms to minimize.
[2024-05-25 22:42:13] [INFO ] Deduced a trap composed of 65 places in 750 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 22:42:14] [INFO ] Deduced a trap composed of 65 places in 971 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18953/18953 variables, and 646 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75078 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 150582ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 347 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 627/627 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 3941 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 20947 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :0 out of 4
Probabilistic random walk after 20947 steps, saw 18943 distinct states, run finished after 3018 ms. (steps per millisecond=6 ) properties seen :0
[2024-05-25 22:43:28] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:43:28] [INFO ] Invariant cache hit.
[2024-05-25 22:43:29] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 545/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :791378 after 1.58962e+06
At refinement iteration 3 (OVERLAPS) 18326/18953 variables, 627/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 1469 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 545/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 22:45:00] [INFO ] Deduced a trap composed of 49 places in 726 ms of which 2 ms to minimize.
[2024-05-25 22:45:00] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 1 ms to minimize.
[2024-05-25 22:45:01] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 22:45:02] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 1 ms to minimize.
[2024-05-25 22:45:03] [INFO ] Deduced a trap composed of 65 places in 704 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 22:45:05] [INFO ] Deduced a trap composed of 65 places in 586 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18953/18953 variables, and 646 constraints, problems are : Problem set: 0 solved, 4 unsolved in 90038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 180550ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 184 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 627/627 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 204 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2024-05-25 22:46:29] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:46:29] [INFO ] Invariant cache hit.
[2024-05-25 22:46:31] [INFO ] Implicit Places using invariants in 1841 ms returned []
Implicit Place search using SMT only with invariants took 1853 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2024-05-25 22:46:32] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:46:32] [INFO ] Invariant cache hit.
[2024-05-25 22:46:32] [INFO ] State equation strengthened by 829 read => feed constraints.

BK_STOP 1716677231903

--------------------
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="RERS17pb113-PT-5"
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 RERS17pb113-PT-5, 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 r312-tall-171662337900150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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