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.r180-tall-171640603700574.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 GPUForwardProgress-PT-28b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603700574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 22:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 22:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-00
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-01
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-02
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-03
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-04
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-05
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-06
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-07
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-08
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-09
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-10
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-11
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-12
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-13
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-14
FORMULA_NAME GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716511286131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 00:41:27] [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-24 00:41:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:41:27] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-24 00:41:27] [INFO ] Transformed 568 places.
[2024-05-24 00:41:27] [INFO ] Transformed 597 transitions.
[2024-05-24 00:41:27] [INFO ] Found NUPN structural information;
[2024-05-24 00:41:27] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (164 resets) in 1562 ms. (25 steps per ms) remains 6/15 properties
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (18 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
[2024-05-24 00:41:28] [INFO ] Flatten gal took : 199 ms
BEST_FIRST walk for 40004 steps (15 resets) in 148 ms. (268 steps per ms) remains 5/6 properties
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 00:41:28] [INFO ] Flatten gal took : 39 ms
[2024-05-24 00:41:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12606858377311394352.gal : 25 ms
BEST_FIRST walk for 40003 steps (17 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
[2024-05-24 00:41:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6649313461912847927.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/ReachabilityCardinality12606858377311394352.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6649313461912847927.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (19 resets) in 601 ms. (66 steps per ms) remains 5/5 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6649313461912847927.prop.
BEST_FIRST walk for 40003 steps (22 resets) in 360 ms. (110 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
// Phase 1: matrix 597 rows 568 cols
[2024-05-24 00:41:28] [INFO ] Computed 30 invariants in 36 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 93
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :93 after 33378
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :33378 after 8.74333e+09
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :8.74333e+09 after 7.51046e+19
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 469/567 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 469/597 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 597/1164 variables, 567/1164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1164 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 1/1165 variables, 1/1165 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1165 variables, 1/1166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1165 variables, 0/1166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1165 variables, 0/1166 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 1166 constraints, problems are : Problem set: 1 solved, 4 unsolved in 983 ms.
Refiners :[Domain max(s): 568/568 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 487/567 variables, 30/110 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 487/597 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/597 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 597/1164 variables, 567/1164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1164 variables, 4/1168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 0/1168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1165 variables, 1/1169 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1165 variables, 1/1170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1165 variables, 0/1170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1165 variables, 0/1170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 1170 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1654 ms.
Refiners :[Domain max(s): 568/568 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2800ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 944 ms.
Support contains 80 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 567 transition count 376
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 265 rules applied. Total rules applied 487 place count 346 transition count 332
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 522 place count 315 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 314 transition count 328
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 523 place count 314 transition count 286
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 607 place count 272 transition count 286
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 611 place count 268 transition count 282
Iterating global reduction 4 with 4 rules applied. Total rules applied 615 place count 268 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 616 place count 268 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 616 place count 268 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 618 place count 267 transition count 280
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 714 place count 219 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 730 place count 211 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 735 place count 211 transition count 227
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 741 place count 211 transition count 221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 747 place count 205 transition count 221
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 753 place count 205 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 754 place count 204 transition count 220
Applied a total of 754 rules in 140 ms. Remains 204 /568 variables (removed 364) and now considering 220/597 (removed 377) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 204/568 places, 220/597 transitions.
RANDOM walk for 40000 steps (668 resets) in 884 ms. (45 steps per ms) remains 3/4 properties
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (114 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (111 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (114 resets) in 175 ms. (227 steps per ms) remains 2/3 properties
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 00:41:32] [INFO ] Flow matrix only has 215 transitions (discarded 5 similar events)
// Phase 1: matrix 215 rows 204 cols
[2024-05-24 00:41:32] [INFO ] Computed 29 invariants in 7 ms
[2024-05-24 00:41:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 114/138 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/204 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 234 constraints, problems are : Problem set: 0 solved, 2 unsolved in 148 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 114/138 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/204 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 236 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 170 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=42 )
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA GPUForwardProgress-PT-28b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
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 6060 ms.

BK_STOP 1716511293322

--------------------
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="GPUForwardProgress-PT-28b"
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 GPUForwardProgress-PT-28b, 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 r180-tall-171640603700574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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