fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r004-smll-171620118400366
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Anderson-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
897.119 24715.00 69090.00 252.50 TTFTFFFTFFFFFTFF 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.r004-smll-171620118400366.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 Anderson-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 Anderson-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716448841903

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 07:20:44] [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 07:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:20:45] [INFO ] Load time of PNML (sax parser for PT used): 471 ms
[2024-05-23 07:20:45] [INFO ] Transformed 621 places.
[2024-05-23 07:20:45] [INFO ] Transformed 2480 transitions.
[2024-05-23 07:20:45] [INFO ] Found NUPN structural information;
[2024-05-23 07:20:45] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 765 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2984 ms. (13 steps per ms) remains 4/14 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 3/4 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 3/3 properties
// Phase 1: matrix 2480 rows 621 cols
[2024-05-23 07:20:47] [INFO ] Flatten gal took : 846 ms
[2024-05-23 07:20:47] [INFO ] Computed 23 invariants in 154 ms
[2024-05-23 07:20:47] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:20:47] [INFO ] Flatten gal took : 247 ms
[2024-05-23 07:20:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15926695227898958845.gal : 160 ms
[2024-05-23 07:20:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12808687144436722351.prop : 4 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/ReachabilityCardinality15926695227898958845.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12808687144436722351.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality12808687144436722351.prop.
At refinement iteration 2 (OVERLAPS) 553/602 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 553/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/621 variables, 12/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 19/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :12 after 19
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :19 after 50
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :50 after 67
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :67 after 105
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :105 after 403
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :403 after 911
At refinement iteration 8 (OVERLAPS) 2480/3101 variables, 621/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 90/1355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :911 after 5513
At refinement iteration 11 (OVERLAPS) 0/3101 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3101/3101 variables, and 1355 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3957 ms.
Refiners :[Domain max(s): 621/621 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 621/621 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem Anderson-PT-10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 553/602 variables, 11/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 553/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/621 variables, 12/625 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 19/644 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2480/3101 variables, 621/1265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 90/1355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 2/1357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3101 variables, 0/1357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3101 variables, 0/1357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3101/3101 variables, and 1357 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4516 ms.
Refiners :[Domain max(s): 621/621 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 621/621 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 9031ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 41 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 2480/2480 transitions.
SDD proceeding with computation,3 properties remain. new max is 8192
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 621 transition count 2409
Deduced a syphon composed of 71 places in 4 ms
SDD size :5513 after 44447
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 550 transition count 2409
Discarding 164 places :
Symmetric choice reduction at 0 with 164 rule applications. Total rules 306 place count 386 transition count 715
Iterating global reduction 0 with 164 rules applied. Total rules applied 470 place count 386 transition count 715
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 0 with 20 rules applied. Total rules applied 490 place count 376 transition count 705
Applied a total of 490 rules in 273 ms. Remains 376 /621 variables (removed 245) and now considering 705/2480 (removed 1775) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 376/621 places, 705/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 506 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 232174 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 232174 steps, saw 176024 distinct states, run finished after 3016 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 705 rows 376 cols
[2024-05-23 07:21:00] [INFO ] Computed 23 invariants in 17 ms
[2024-05-23 07:21:00] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/376 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 705/1081 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 90/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1081 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 376/376 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/376 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 705/1081 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 90/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1081 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 491 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1404 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 376/376 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2393ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 41 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 705/705 transitions.
Applied a total of 0 rules in 73 ms. Remains 376 /376 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 376/376 places, 705/705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 705/705 transitions.
Applied a total of 0 rules in 55 ms. Remains 376 /376 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2024-05-23 07:21:02] [INFO ] Invariant cache hit.
[2024-05-23 07:21:03] [INFO ] Implicit Places using invariants in 792 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 809 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 375/376 places, 705/705 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 375 transition count 639
Reduce places removed 66 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 81 rules applied. Total rules applied 147 place count 309 transition count 624
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 162 place count 294 transition count 624
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 175 place count 294 transition count 611
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 188 place count 281 transition count 611
Applied a total of 188 rules in 90 ms. Remains 281 /375 variables (removed 94) and now considering 611/705 (removed 94) transitions.
// Phase 1: matrix 611 rows 281 cols
[2024-05-23 07:21:03] [INFO ] Computed 22 invariants in 12 ms
[2024-05-23 07:21:04] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-23 07:21:04] [INFO ] Invariant cache hit.
[2024-05-23 07:21:04] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 07:21:06] [INFO ] Implicit Places using invariants and state equation in 2063 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 281/376 places, 611/705 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3354 ms. Remains : 281/376 places, 611/705 transitions.
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/2 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30784 steps (6 resets) in 78 ms. (389 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 21961 ms.

BK_STOP 1716448866618

--------------------
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="Anderson-PT-10"
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 Anderson-PT-10, 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 r004-smll-171620118400366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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