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-171640602600079.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-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 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:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 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 536K 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-12b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716422295203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 23:58:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:58:16] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-22 23:58:16] [INFO ] Transformed 1988 places.
[2024-05-22 23:58:16] [INFO ] Transformed 2289 transitions.
[2024-05-22 23:58:16] [INFO ] Found NUPN structural information;
[2024-05-22 23:58:16] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (459 resets) in 1973 ms. (20 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 23:58:17] [INFO ] Flatten gal took : 313 ms
BEST_FIRST walk for 40004 steps (33 resets) in 401 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
[2024-05-22 23:58:17] [INFO ] Flatten gal took : 197 ms
BEST_FIRST walk for 40004 steps (40 resets) in 526 ms. (75 steps per ms) remains 12/12 properties
[2024-05-22 23:58:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5062544965535008416.gal : 53 ms
BEST_FIRST walk for 40004 steps (46 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (43 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (46 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (47 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
[2024-05-22 23:58:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13429310325197298463.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/ReachabilityCardinality5062544965535008416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13429310325197298463.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (46 resets) in 195 ms. (204 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
// Phase 1: matrix 2289 rows 1988 cols
Loading property file /tmp/ReachabilityCardinality13429310325197298463.prop.
[2024-05-22 23:58:18] [INFO ] Computed 14 invariants in 51 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1876/1988 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1876/2002 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1988 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 40
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :40 after 44
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :44 after 1036
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :1036 after 65612
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :65612 after 1.00765e+08
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :1.00765e+08 after 1.40879e+14
At refinement iteration 5 (OVERLAPS) 2289/4277 variables, 1988/3990 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4277/4277 variables, and 3990 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3210 ms.
Refiners :[Domain max(s): 1988/1988 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 1988/1988 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1876/1988 variables, 14/126 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1876/2002 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-22 23:58:23] [INFO ] Deduced a trap composed of 677 places in 900 ms of which 82 ms to minimize.
[2024-05-22 23:58:23] [INFO ] Deduced a trap composed of 718 places in 694 ms of which 9 ms to minimize.
[2024-05-22 23:58:24] [INFO ] Deduced a trap composed of 682 places in 627 ms of which 9 ms to minimize.
[2024-05-22 23:58:25] [INFO ] Deduced a trap composed of 688 places in 672 ms of which 9 ms to minimize.
[2024-05-22 23:58:26] [INFO ] Deduced a trap composed of 232 places in 729 ms of which 9 ms to minimize.
[2024-05-22 23:58:26] [INFO ] Deduced a trap composed of 721 places in 762 ms of which 9 ms to minimize.
SMT process timed out in 8627ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 97 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1433 edges and 1988 vertex of which 24 / 1988 are part of one of the 4 SCC in 11 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 320 place count 1968 transition count 1946
Reduce places removed 319 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 337 rules applied. Total rules applied 657 place count 1649 transition count 1928
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 675 place count 1631 transition count 1928
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 254 Pre rules applied. Total rules applied 675 place count 1631 transition count 1674
Deduced a syphon composed of 254 places in 3 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 3 with 508 rules applied. Total rules applied 1183 place count 1377 transition count 1674
Discarding 695 places :
Symmetric choice reduction at 3 with 695 rule applications. Total rules 1878 place count 682 transition count 979
Iterating global reduction 3 with 695 rules applied. Total rules applied 2573 place count 682 transition count 979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 2575 place count 682 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2576 place count 681 transition count 977
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 2576 place count 681 transition count 974
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 2582 place count 678 transition count 974
Discarding 93 places :
Symmetric choice reduction at 5 with 93 rule applications. Total rules 2675 place count 585 transition count 881
Iterating global reduction 5 with 93 rules applied. Total rules applied 2768 place count 585 transition count 881
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 5 with 74 rules applied. Total rules applied 2842 place count 585 transition count 807
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 6 with 164 rules applied. Total rules applied 3006 place count 503 transition count 725
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 3020 place count 496 transition count 725
Free-agglomeration rule applied 89 times.
Iterating global reduction 6 with 89 rules applied. Total rules applied 3109 place count 496 transition count 636
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 6 with 89 rules applied. Total rules applied 3198 place count 407 transition count 636
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 3209 place count 407 transition count 625
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 3218 place count 407 transition count 625
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3219 place count 406 transition count 624
Applied a total of 3219 rules in 612 ms. Remains 406 /1988 variables (removed 1582) and now considering 624/2289 (removed 1665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 406/1988 places, 624/2289 transitions.
RANDOM walk for 40000 steps (702 resets) in 1421 ms. (28 steps per ms) remains 7/11 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (63 resets) in 91 ms. (434 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (61 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (64 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
[2024-05-22 23:58:28] [INFO ] Flow matrix only has 611 transitions (discarded 13 similar events)
// Phase 1: matrix 611 rows 406 cols
[2024-05-22 23:58:28] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 23:58:28] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 360/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 611/1017 variables, 406/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 63/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1017 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1017 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 483 constraints, problems are : Problem set: 0 solved, 6 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 406/406 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 360/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:58:28] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-22 23:58:28] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 23:58:28] [INFO ] Deduced a trap composed of 150 places in 98 ms of which 3 ms to minimize.
[2024-05-22 23:58:28] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-22 23:58:29] [INFO ] Deduced a trap composed of 171 places in 111 ms of which 3 ms to minimize.
[2024-05-22 23:58:29] [INFO ] Deduced a trap composed of 151 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:58:29] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 611/1017 variables, 406/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1017 variables, 63/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1017 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1017 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1017 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 496 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1712 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 406/406 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 678 ms.
Support contains 38 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 624/624 transitions.
Graph (trivial) has 122 edges and 406 vertex of which 6 / 406 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 403 transition count 605
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 390 transition count 605
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 390 transition count 603
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 388 transition count 603
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 58 place count 361 transition count 576
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 361 transition count 576
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 361 transition count 573
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 126 place count 342 transition count 554
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 130 place count 342 transition count 550
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 146 place count 326 transition count 534
Iterating global reduction 4 with 16 rules applied. Total rules applied 162 place count 326 transition count 534
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 178 place count 326 transition count 518
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 181 place count 326 transition count 515
Free-agglomeration rule applied 43 times.
Iterating global reduction 5 with 43 rules applied. Total rules applied 224 place count 326 transition count 472
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 268 place count 283 transition count 471
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 276 place count 275 transition count 463
Iterating global reduction 6 with 8 rules applied. Total rules applied 284 place count 275 transition count 463
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 292 place count 275 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 296 place count 275 transition count 451
Applied a total of 296 rules in 92 ms. Remains 275 /406 variables (removed 131) and now considering 451/624 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 275/406 places, 451/624 transitions.
RANDOM walk for 40000 steps (348 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 725663 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 725663 steps, saw 149404 distinct states, run finished after 3006 ms. (steps per millisecond=241 ) properties seen :0
[2024-05-22 23:58:34] [INFO ] Flow matrix only has 434 transitions (discarded 17 similar events)
// Phase 1: matrix 434 rows 275 cols
[2024-05-22 23:58:34] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 23:58:34] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 237/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 434/709 variables, 275/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 96/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/709 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/709 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 275/275 constraints, ReadFeed: 96/96 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 237/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:58:34] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 434/709 variables, 275/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 96/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:58:34] [INFO ] Deduced a trap composed of 126 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/709 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/709 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 709/709 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 275/275 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 55 ms.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 451/451 transitions.
Graph (trivial) has 204 edges and 275 vertex of which 13 / 275 are part of one of the 5 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 267 transition count 431
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 260 transition count 431
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 260 transition count 430
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 259 transition count 430
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 29 place count 259 transition count 418
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 54 place count 234 transition count 393
Iterating global reduction 3 with 25 rules applied. Total rules applied 79 place count 234 transition count 393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 234 transition count 390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 82 place count 234 transition count 389
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 233 transition count 389
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 95 place count 233 transition count 378
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 119 place count 221 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 123 place count 221 transition count 362
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 135 place count 209 transition count 350
Iterating global reduction 6 with 12 rules applied. Total rules applied 147 place count 209 transition count 350
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 159 place count 209 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 161 place count 208 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 164 place count 208 transition count 335
Free-agglomeration rule applied 141 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 141 rules applied. Total rules applied 305 place count 208 transition count 191
Discarding 57 places :
Also discarding 160 output transitions
Drop transitions (Output transitions of discarded places.) removed 160 transitions
Remove reverse transitions (loop back) rule discarded transition t13.t14.t15.t2005.t1844.t1845 and 57 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (trivial) has 8 edges and 8 vertex of which 4 / 8 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 24 rules applied. Total rules applied 329 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 335 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 336 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 336 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 338 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 339 place count 3 transition count 3
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 340 place count 2 transition count 2
Iterating global reduction 10 with 1 rules applied. Total rules applied 341 place count 2 transition count 2
Applied a total of 341 rules in 74 ms. Remains 2 /275 variables (removed 273) and now considering 2/451 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 2/275 places, 2/451 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 18697 ms.

BK_STOP 1716422315133

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-12b"
export BK_EXAMINATION="ReachabilityFireability"
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-12b, examination is ReachabilityFireability"
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-171640602600079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;