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.r496-tall-171640602600075.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 ltsminxred
Input is FlexibleBarrier-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600075
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717182447109

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:07:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:07:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:07:28] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-31 19:07:28] [INFO ] Transformed 1988 places.
[2024-05-31 19:07:28] [INFO ] Transformed 2289 transitions.
[2024-05-31 19:07:28] [INFO ] Found NUPN structural information;
[2024-05-31 19:07:28] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 777 places :
Symmetric choice reduction at 0 with 777 rule applications. Total rules 777 place count 1211 transition count 1512
Iterating global reduction 0 with 777 rules applied. Total rules applied 1554 place count 1211 transition count 1512
Discarding 360 places :
Symmetric choice reduction at 0 with 360 rule applications. Total rules 1914 place count 851 transition count 1152
Iterating global reduction 0 with 360 rules applied. Total rules applied 2274 place count 851 transition count 1152
Discarding 227 places :
Symmetric choice reduction at 0 with 227 rule applications. Total rules 2501 place count 624 transition count 925
Iterating global reduction 0 with 227 rules applied. Total rules applied 2728 place count 624 transition count 925
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 2835 place count 624 transition count 818
Applied a total of 2835 rules in 351 ms. Remains 624 /1988 variables (removed 1364) and now considering 818/2289 (removed 1471) transitions.
// Phase 1: matrix 818 rows 624 cols
[2024-05-31 19:07:29] [INFO ] Computed 14 invariants in 37 ms
[2024-05-31 19:07:29] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-31 19:07:29] [INFO ] Invariant cache hit.
[2024-05-31 19:07:30] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2024-05-31 19:07:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 817 unsolved
[2024-05-31 19:07:44] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 31 ms to minimize.
[2024-05-31 19:07:45] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1442 variables, and 16 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (OVERLAPS) 1/624 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 4 (OVERLAPS) 818/1442 variables, 624/640 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1442 variables, 817/1457 constraints. Problems are: Problem set: 0 solved, 817 unsolved
[2024-05-31 19:08:24] [INFO ] Deduced a trap composed of 179 places in 195 ms of which 6 ms to minimize.
[2024-05-31 19:08:25] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 7 ms to minimize.
[2024-05-31 19:08:25] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:08:26] [INFO ] Deduced a trap composed of 433 places in 193 ms of which 4 ms to minimize.
[2024-05-31 19:08:27] [INFO ] Deduced a trap composed of 104 places in 187 ms of which 4 ms to minimize.
[2024-05-31 19:08:28] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:08:28] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 3 ms to minimize.
[2024-05-31 19:08:28] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 3 ms to minimize.
[2024-05-31 19:08:29] [INFO ] Deduced a trap composed of 109 places in 212 ms of which 4 ms to minimize.
[2024-05-31 19:08:30] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1442 variables, and 1467 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 12/12 constraints]
After SMT, in 60697ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60816ms
Starting structural reductions in LTL mode, iteration 1 : 624/1988 places, 818/2289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62200 ms. Remains : 624/1988 places, 818/2289 transitions.
Support contains 24 out of 624 places after structural reductions.
[2024-05-31 19:08:31] [INFO ] Flatten gal took : 78 ms
[2024-05-31 19:08:31] [INFO ] Flatten gal took : 42 ms
[2024-05-31 19:08:31] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 40000 steps (449 resets) in 2038 ms. (19 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 310 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
[2024-05-31 19:08:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 334/348 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 276/624 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 818/1442 variables, 624/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1442 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1442 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1442/1442 variables, and 638 constraints, problems are : Problem set: 0 solved, 6 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 624/624 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 334/348 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 276/624 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 818/1442 variables, 624/638 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1442 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 19:08:33] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1442 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 19:08:33] [INFO ] Deduced a trap composed of 199 places in 136 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/1442 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1442 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1442 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1442/1442 variables, and 646 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 2073ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 1346 ms.
Support contains 4 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 818/818 transitions.
Graph (trivial) has 582 edges and 624 vertex of which 73 / 624 are part of one of the 12 SCC in 4 ms
Free SCC test removed 61 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 563 transition count 679
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 498 transition count 679
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 131 place count 498 transition count 654
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 181 place count 473 transition count 654
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 220 place count 434 transition count 615
Iterating global reduction 2 with 39 rules applied. Total rules applied 259 place count 434 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 434 transition count 614
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 260 place count 434 transition count 612
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 432 transition count 612
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 271 place count 425 transition count 605
Iterating global reduction 3 with 7 rules applied. Total rules applied 278 place count 425 transition count 605
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 284 place count 425 transition count 599
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 430 place count 352 transition count 526
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 454 place count 352 transition count 502
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 470 place count 336 transition count 486
Iterating global reduction 5 with 16 rules applied. Total rules applied 486 place count 336 transition count 486
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 490 place count 336 transition count 482
Free-agglomeration rule applied 269 times.
Iterating global reduction 6 with 269 rules applied. Total rules applied 759 place count 336 transition count 213
Reduce places removed 269 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 183 edges and 67 vertex of which 32 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 391 rules applied. Total rules applied 1150 place count 32 transition count 92
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 1199 place count 32 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1200 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 23 edges and 30 vertex of which 8 / 30 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 1202 place count 26 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1210 place count 26 transition count 34
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 5 Pre rules applied. Total rules applied 1210 place count 26 transition count 29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1220 place count 21 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1225 place count 21 transition count 24
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 1237 place count 15 transition count 18
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1241 place count 15 transition count 14
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1252 place count 8 transition count 10
Applied a total of 1252 rules in 278 ms. Remains 8 /624 variables (removed 616) and now considering 10/818 (removed 808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 8/624 places, 10/818 transitions.
RANDOM walk for 130 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 818/818 transitions.
Graph (trivial) has 580 edges and 624 vertex of which 73 / 624 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 562 transition count 691
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 498 transition count 691
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 129 place count 498 transition count 665
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 181 place count 472 transition count 665
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 220 place count 433 transition count 626
Iterating global reduction 2 with 39 rules applied. Total rules applied 259 place count 433 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 433 transition count 625
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 260 place count 433 transition count 624
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 432 transition count 624
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 271 place count 423 transition count 615
Iterating global reduction 3 with 9 rules applied. Total rules applied 280 place count 423 transition count 615
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 289 place count 423 transition count 606
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 431 place count 352 transition count 535
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 433 place count 350 transition count 533
Iterating global reduction 4 with 2 rules applied. Total rules applied 435 place count 350 transition count 533
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 437 place count 350 transition count 531
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 449 place count 350 transition count 519
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 450 place count 350 transition count 519
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 452 place count 348 transition count 517
Applied a total of 452 rules in 242 ms. Remains 348 /624 variables (removed 276) and now considering 517/818 (removed 301) transitions.
[2024-05-31 19:08:36] [INFO ] Flow matrix only has 494 transitions (discarded 23 similar events)
// Phase 1: matrix 494 rows 348 cols
[2024-05-31 19:08:36] [INFO ] Computed 14 invariants in 12 ms
[2024-05-31 19:08:36] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 19:08:36] [INFO ] Flow matrix only has 494 transitions (discarded 23 similar events)
[2024-05-31 19:08:36] [INFO ] Invariant cache hit.
[2024-05-31 19:08:36] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-31 19:08:36] [INFO ] Redundant transitions in 25 ms returned []
Running 237 sub problems to find dead transitions.
[2024-05-31 19:08:36] [INFO ] Flow matrix only has 494 transitions (discarded 23 similar events)
[2024-05-31 19:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 12/348 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 493/841 variables, 348/362 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 0/841 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/842 variables, and 362 constraints, problems are : Problem set: 0 solved, 237 unsolved in 11706 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 12/348 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 493/841 variables, 348/362 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 237/599 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/841 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/842 variables, and 599 constraints, problems are : Problem set: 0 solved, 237 unsolved in 13417 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 25310ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 25312ms
Starting structural reductions in SI_LTL mode, iteration 1 : 348/624 places, 517/818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26031 ms. Remains : 348/624 places, 517/818 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-02
Stuttering criterion allowed to conclude after 178 steps with 8 reset in 8 ms.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-02 finished in 26405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 818/818 transitions.
Graph (trivial) has 583 edges and 624 vertex of which 73 / 624 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 562 transition count 690
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 497 transition count 690
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 131 place count 497 transition count 664
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 183 place count 471 transition count 664
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 223 place count 431 transition count 624
Iterating global reduction 2 with 40 rules applied. Total rules applied 263 place count 431 transition count 624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 431 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 264 place count 431 transition count 622
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 430 transition count 622
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 274 place count 422 transition count 614
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 422 transition count 614
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 290 place count 422 transition count 606
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 434 place count 350 transition count 534
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 438 place count 346 transition count 530
Iterating global reduction 4 with 4 rules applied. Total rules applied 442 place count 346 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 446 place count 346 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 458 place count 346 transition count 514
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 460 place count 344 transition count 512
Applied a total of 460 rules in 197 ms. Remains 344 /624 variables (removed 280) and now considering 512/818 (removed 306) transitions.
[2024-05-31 19:09:02] [INFO ] Flow matrix only has 489 transitions (discarded 23 similar events)
// Phase 1: matrix 489 rows 344 cols
[2024-05-31 19:09:02] [INFO ] Computed 14 invariants in 6 ms
[2024-05-31 19:09:03] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-31 19:09:03] [INFO ] Flow matrix only has 489 transitions (discarded 23 similar events)
[2024-05-31 19:09:03] [INFO ] Invariant cache hit.
[2024-05-31 19:09:03] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-31 19:09:03] [INFO ] Redundant transitions in 3 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-31 19:09:03] [INFO ] Flow matrix only has 489 transitions (discarded 23 similar events)
[2024-05-31 19:09:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 12/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 488/832 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/832 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 832/833 variables, and 358 constraints, problems are : Problem set: 0 solved, 233 unsolved in 11367 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 12/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 488/832 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 233/591 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/832 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 832/833 variables, and 591 constraints, problems are : Problem set: 0 solved, 233 unsolved in 13658 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 25155ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 25157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 344/624 places, 512/818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25989 ms. Remains : 344/624 places, 512/818 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-05
Stuttering criterion allowed to conclude after 898 steps with 47 reset in 13 ms.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-05 finished in 26080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 5 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 818/818 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 608 transition count 802
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 608 transition count 802
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 597 transition count 791
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 597 transition count 791
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 597 transition count 783
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 594 transition count 780
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 594 transition count 780
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 594 transition count 778
Applied a total of 70 rules in 44 ms. Remains 594 /624 variables (removed 30) and now considering 778/818 (removed 40) transitions.
// Phase 1: matrix 778 rows 594 cols
[2024-05-31 19:09:28] [INFO ] Computed 14 invariants in 11 ms
[2024-05-31 19:09:28] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-31 19:09:28] [INFO ] Invariant cache hit.
[2024-05-31 19:09:29] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 777 sub problems to find dead transitions.
[2024-05-31 19:09:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 778/1372 variables, 594/608 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1372/1372 variables, and 608 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 777 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (OVERLAPS) 778/1372 variables, 594/608 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1372 variables, 777/1385 constraints. Problems are: Problem set: 0 solved, 777 unsolved
[2024-05-31 19:10:22] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 4 ms to minimize.
[2024-05-31 19:10:22] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 4 ms to minimize.
[2024-05-31 19:10:22] [INFO ] Deduced a trap composed of 68 places in 188 ms of which 4 ms to minimize.
[2024-05-31 19:10:23] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 4 ms to minimize.
[2024-05-31 19:10:24] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 3 ms to minimize.
[2024-05-31 19:10:25] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 3 ms to minimize.
[2024-05-31 19:10:25] [INFO ] Deduced a trap composed of 105 places in 182 ms of which 3 ms to minimize.
[2024-05-31 19:10:27] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 4 ms to minimize.
[2024-05-31 19:10:28] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 3 ms to minimize.
[2024-05-31 19:10:29] [INFO ] Deduced a trap composed of 109 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 60606ms, After SMT, problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 60616ms
Starting structural reductions in LTL mode, iteration 1 : 594/624 places, 778/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61378 ms. Remains : 594/624 places, 778/818 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1996 steps with 21 reset in 15 ms.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-07 finished in 61561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)&&p0))&&F(p2))))'
Support contains 8 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 818/818 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 609 transition count 803
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 609 transition count 803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 609 transition count 802
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 601 transition count 794
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 601 transition count 794
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 601 transition count 788
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 599 transition count 786
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 599 transition count 786
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 599 transition count 784
Applied a total of 59 rules in 43 ms. Remains 599 /624 variables (removed 25) and now considering 784/818 (removed 34) transitions.
// Phase 1: matrix 784 rows 599 cols
[2024-05-31 19:10:30] [INFO ] Computed 14 invariants in 14 ms
[2024-05-31 19:10:30] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-31 19:10:30] [INFO ] Invariant cache hit.
[2024-05-31 19:10:30] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 783 sub problems to find dead transitions.
[2024-05-31 19:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 784/1383 variables, 599/613 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1383/1383 variables, and 613 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 599/599 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 784/1383 variables, 599/613 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 783/1396 constraints. Problems are: Problem set: 0 solved, 783 unsolved
[2024-05-31 19:11:22] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 3 ms to minimize.
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-31 19:11:24] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:11:24] [INFO ] Deduced a trap composed of 101 places in 172 ms of which 3 ms to minimize.
[2024-05-31 19:11:25] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 3 ms to minimize.
[2024-05-31 19:11:26] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 3 ms to minimize.
[2024-05-31 19:11:27] [INFO ] Deduced a trap composed of 108 places in 183 ms of which 8 ms to minimize.
[2024-05-31 19:11:28] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-05-31 19:11:31] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1383/1383 variables, and 1409 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 599/599 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 13/13 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 60455ms
Starting structural reductions in LTL mode, iteration 1 : 599/624 places, 784/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61125 ms. Remains : 599/624 places, 784/818 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLCardinality-11 finished in 61335 ms.
All properties solved by simple procedures.
Total runtime 243251 ms.
ITS solved all properties within timeout

BK_STOP 1717182691500

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602600075"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;