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.r114-smll-171624275700286.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 DLCround-PT-13b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275700286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 12:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 13 12:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 13 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 13 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 DLCround-PT-13b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716407787839

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 19:56:29] [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-22 19:56:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:56:31] [INFO ] Load time of PNML (sax parser for PT used): 824 ms
[2024-05-22 19:56:31] [INFO ] Transformed 5343 places.
[2024-05-22 19:56:31] [INFO ] Transformed 8727 transitions.
[2024-05-22 19:56:31] [INFO ] Found NUPN structural information;
[2024-05-22 19:56:31] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 1276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3315 ms. (12 steps per ms) remains 3/11 properties
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 934 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
// Phase 1: matrix 8727 rows 5343 cols
[2024-05-22 19:56:33] [INFO ] Computed 312 invariants in 124 ms
[2024-05-22 19:56:34] [INFO ] Flatten gal took : 1205 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 19:56:34] [INFO ] Flatten gal took : 539 ms
[2024-05-22 19:56:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality226573731996523742.gal : 259 ms
[2024-05-22 19:56:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10717561622299821167.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality226573731996523742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10717561622299821167.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 ...328
At refinement iteration 2 (OVERLAPS) 3761/3843 variables, 173/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3843 variables, 3761/4016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3843 variables, 0/4016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1500/5343 variables, 139/4155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality10717561622299821167.prop.
At refinement iteration 6 (INCLUDED_ONLY) 0/5343 variables, 1500/5655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5343 variables, 0/5655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5580ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4734 edges and 5343 vertex of which 760 / 5343 are part of one of the 58 SCC in 21 ms
Free SCC test removed 702 places
Drop transitions (Empty/Sink Transition effects.) removed 786 transitions
Reduce isomorphic transitions removed 786 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1848 transitions
Trivial Post-agglo rules discarded 1848 transitions
Performed 1848 trivial Post agglomeration. Transition count delta: 1848
Iterating post reduction 0 with 1848 rules applied. Total rules applied 1849 place count 4641 transition count 6093
Reduce places removed 1848 places and 0 transitions.
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 1939 rules applied. Total rules applied 3788 place count 2793 transition count 6002
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 45 rules applied. Total rules applied 3833 place count 2754 transition count 5996
Reduce places removed 3 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 3 with 34 rules applied. Total rules applied 3867 place count 2751 transition count 5965
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 3898 place count 2720 transition count 5965
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 3898 place count 2720 transition count 5931
Deduced a syphon composed of 34 places in 90 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 3966 place count 2686 transition count 5931
Discarding 697 places :
Symmetric choice reduction at 5 with 697 rule applications. Total rules 4663 place count 1989 transition count 5234
Iterating global reduction 5 with 697 rules applied. Total rules applied 5360 place count 1989 transition count 5234
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 294 Pre rules applied. Total rules applied 5360 place count 1989 transition count 4940
Deduced a syphon composed of 294 places in 47 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 5 with 588 rules applied. Total rules applied 5948 place count 1695 transition count 4940
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 6042 place count 1601 transition count 3363
Iterating global reduction 5 with 94 rules applied. Total rules applied 6136 place count 1601 transition count 3363
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 6165 place count 1601 transition count 3334
Performed 412 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 412 places in 2 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 6 with 824 rules applied. Total rules applied 6989 place count 1189 transition count 2908
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 7001 place count 1189 transition count 2896
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 7005 place count 1185 transition count 2828
Iterating global reduction 7 with 4 rules applied. Total rules applied 7009 place count 1185 transition count 2828
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: -711
Deduced a syphon composed of 91 places in 2 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 7 with 182 rules applied. Total rules applied 7191 place count 1094 transition count 3539
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 7 with 92 rules applied. Total rules applied 7283 place count 1094 transition count 3447
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 7285 place count 1092 transition count 3383
Iterating global reduction 8 with 2 rules applied. Total rules applied 7287 place count 1092 transition count 3383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 7289 place count 1092 transition count 3381
Drop transitions (Redundant composition of simpler transitions.) removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 9 with 112 rules applied. Total rules applied 7401 place count 1092 transition count 3269
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 7422 place count 1071 transition count 3248
Iterating global reduction 9 with 21 rules applied. Total rules applied 7443 place count 1071 transition count 3248
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 7464 place count 1050 transition count 2796
Iterating global reduction 9 with 21 rules applied. Total rules applied 7485 place count 1050 transition count 2796
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 7506 place count 1050 transition count 2775
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 7538 place count 1034 transition count 2759
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 7552 place count 1020 transition count 2461
Iterating global reduction 10 with 14 rules applied. Total rules applied 7566 place count 1020 transition count 2461
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 7579 place count 1020 transition count 2448
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 7581 place count 1019 transition count 2461
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 7582 place count 1019 transition count 2460
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 7584 place count 1019 transition count 2458
Free-agglomeration rule applied 458 times with reduction of 176 identical transitions.
Iterating global reduction 12 with 458 rules applied. Total rules applied 8042 place count 1019 transition count 1824
Reduce places removed 458 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 624 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 638 transitions.
Graph (complete) has 1462 edges and 561 vertex of which 475 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.5 ms
Discarding 86 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1097 rules applied. Total rules applied 9139 place count 475 transition count 1186
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 13 with 116 rules applied. Total rules applied 9255 place count 475 transition count 1070
Discarding 91 places :
Symmetric choice reduction at 14 with 91 rule applications. Total rules 9346 place count 384 transition count 924
Iterating global reduction 14 with 91 rules applied. Total rules applied 9437 place count 384 transition count 924
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 9445 place count 380 transition count 959
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 14 with 38 rules applied. Total rules applied 9483 place count 380 transition count 921
Drop transitions (Redundant composition of simpler transitions.) removed 88 transitions
Redundant transition composition rules discarded 88 transitions
Iterating global reduction 15 with 88 rules applied. Total rules applied 9571 place count 380 transition count 833
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 1055 edges and 378 vertex of which 370 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 3 rules applied. Total rules applied 9574 place count 370 transition count 833
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 9591 place count 370 transition count 816
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 9600 place count 361 transition count 798
Iterating global reduction 17 with 9 rules applied. Total rules applied 9609 place count 361 transition count 798
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 9614 place count 361 transition count 798
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 9618 place count 361 transition count 794
Applied a total of 9618 rules in 2948 ms. Remains 361 /5343 variables (removed 4982) and now considering 794/8727 (removed 7933) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2966 ms. Remains : 361/5343 places, 794/8727 transitions.
RANDOM walk for 40000 steps (8 resets) in 1479 ms. (27 steps per ms) remains 1/3 properties
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 1/1 properties
[2024-05-22 19:56:42] [INFO ] Flow matrix only has 576 transitions (discarded 218 similar events)
// Phase 1: matrix 576 rows 361 cols
[2024-05-22 19:56:42] [INFO ] Computed 139 invariants in 10 ms
[2024-05-22 19:56:42] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 238/291 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/357 variables, 38/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 575/932 variables, 357/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 147/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/937 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/937 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/937 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 937/937 variables, and 647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 361/361 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 238/291 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/357 variables, 38/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 575/932 variables, 357/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 147/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/937 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/937 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/937 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/937 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 937/937 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 361/361 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1458ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 138 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 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 14328 ms.

BK_STOP 1716407804368

--------------------
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="DLCround-PT-13b"
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 DLCround-PT-13b, 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 r114-smll-171624275700286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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