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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 1.8M 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716435133082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 03:32:14] [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 03:32:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:32:14] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-05-23 03:32:14] [INFO ] Transformed 6478 places.
[2024-05-23 03:32:14] [INFO ] Transformed 7469 transitions.
[2024-05-23 03:32:14] [INFO ] Found NUPN structural information;
[2024-05-23 03:32:14] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (273 resets) in 3309 ms. (12 steps per ms) remains 10/12 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (19 resets) in 452 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 264 ms. (150 steps per ms) remains 10/10 properties
[2024-05-23 03:32:16] [INFO ] Flatten gal took : 823 ms
BEST_FIRST walk for 40004 steps (17 resets) in 920 ms. (43 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 235 ms. (169 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
[2024-05-23 03:32:16] [INFO ] Flatten gal took : 436 ms
// Phase 1: matrix 7469 rows 6478 cols
[2024-05-23 03:32:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9495028717289699450.gal : 120 ms
[2024-05-23 03:32:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4872322929136482189.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9495028717289699450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4872322929136482189.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
[2024-05-23 03:32:17] [INFO ] Computed 24 invariants in 370 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality4872322929136482189.prop.
At refinement iteration 2 (OVERLAPS) 5816/5878 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5878 variables, 5816/5898 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5878 variables, 0/5898 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 600/6478 variables, 4/5902 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6478 variables, 600/6502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6478 variables, 0/6502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13947/13947 variables, and 12980 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5064 ms.
Refiners :[Domain max(s): 6478/6478 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 6478/6478 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5816/5878 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5878 variables, 5816/5898 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 03:32:25] [INFO ] Deduced a trap composed of 498 places in 1308 ms of which 131 ms to minimize.
[2024-05-23 03:32:30] [INFO ] Deduced a trap composed of 2393 places in 5339 ms of which 32 ms to minimize.
SMT process timed out in 14077ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 6317 edges and 6478 vertex of which 126 / 6478 are part of one of the 21 SCC in 19 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1539 transitions
Trivial Post-agglo rules discarded 1539 transitions
Performed 1539 trivial Post agglomeration. Transition count delta: 1539
Iterating post reduction 0 with 1539 rules applied. Total rules applied 1540 place count 6373 transition count 5804
Reduce places removed 1539 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 1557 rules applied. Total rules applied 3097 place count 4834 transition count 5786
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 3114 place count 4817 transition count 5786
Performed 441 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 441 Pre rules applied. Total rules applied 3114 place count 4817 transition count 5345
Deduced a syphon composed of 441 places in 6 ms
Reduce places removed 441 places and 0 transitions.
Iterating global reduction 3 with 882 rules applied. Total rules applied 3996 place count 4376 transition count 5345
Discarding 2652 places :
Symmetric choice reduction at 3 with 2652 rule applications. Total rules 6648 place count 1724 transition count 2693
Iterating global reduction 3 with 2652 rules applied. Total rules applied 9300 place count 1724 transition count 2693
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 9300 place count 1724 transition count 2680
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 9326 place count 1711 transition count 2680
Discarding 416 places :
Symmetric choice reduction at 3 with 416 rule applications. Total rules 9742 place count 1295 transition count 2264
Iterating global reduction 3 with 416 rules applied. Total rules applied 10158 place count 1295 transition count 2264
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Iterating post reduction 3 with 404 rules applied. Total rules applied 10562 place count 1295 transition count 1860
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 10804 place count 1174 transition count 1739
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 10845 place count 1174 transition count 1698
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 10863 place count 1156 transition count 1680
Iterating global reduction 5 with 18 rules applied. Total rules applied 10881 place count 1156 transition count 1680
Free-agglomeration rule applied 953 times.
Iterating global reduction 5 with 953 rules applied. Total rules applied 11834 place count 1156 transition count 727
Reduce places removed 953 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 406 transitions
Reduce isomorphic transitions removed 406 transitions.
Iterating post reduction 5 with 1359 rules applied. Total rules applied 13193 place count 203 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 13195 place count 203 transition count 319
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 13199 place count 203 transition count 319
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 13201 place count 203 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 13202 place count 202 transition count 316
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t6476.t2359.t2360 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 109 edges and 200 vertex of which 30 / 200 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 8 rules applied. Total rules applied 13210 place count 185 transition count 309
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 8 with 35 rules applied. Total rules applied 13245 place count 180 transition count 279
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 21 Pre rules applied. Total rules applied 13245 place count 180 transition count 258
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 13287 place count 159 transition count 258
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 13307 place count 159 transition count 238
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 10 with 52 rules applied. Total rules applied 13359 place count 133 transition count 212
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 13362 place count 133 transition count 209
Free-agglomeration rule applied 25 times.
Iterating global reduction 11 with 25 rules applied. Total rules applied 13387 place count 133 transition count 184
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 11 with 49 rules applied. Total rules applied 13436 place count 105 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 13452 place count 105 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 13453 place count 105 transition count 147
Applied a total of 13453 rules in 1633 ms. Remains 105 /6478 variables (removed 6373) and now considering 147/7469 (removed 7322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 105/6478 places, 147/7469 transitions.
RANDOM walk for 40000 steps (8 resets) in 656 ms. (60 steps per ms) remains 3/10 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 147 rows 105 cols
[2024-05-23 03:32:32] [INFO ] Computed 20 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/96 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/111 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/115 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/128 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/130 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/252 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 6/20 constraints, State Equation: 52/105 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/96 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 15/111 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/115 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/128 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/130 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/252 variables, and 59 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 6/20 constraints, State Equation: 52/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5 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 18706 ms.

BK_STOP 1716435153001

--------------------
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="FlexibleBarrier-PT-22b"
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 FlexibleBarrier-PT-22b, 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-171640602800158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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