About the Execution of LTSMin+red for FlexibleBarrier-PT-22a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1158.128 | 155639.00 | 203874.00 | 389.70 | TFFFFFFFFFFFFFFF | normal |
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-171640602800148.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-22a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602800148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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 3.9K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 13 12:08 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 384K 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-22a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717186678018
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:17:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:17:59] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-31 20:17:59] [INFO ] Transformed 267 places.
[2024-05-31 20:17:59] [INFO ] Transformed 1258 transitions.
[2024-05-31 20:17:59] [INFO ] Found NUPN structural information;
[2024-05-31 20:17:59] [INFO ] Parsed PT model containing 267 places and 1258 transitions and 6375 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 442 transitions
Reduce redundant transitions removed 442 transitions.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 816/816 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 267 transition count 794
Applied a total of 22 rules in 54 ms. Remains 267 /267 variables (removed 0) and now considering 794/816 (removed 22) transitions.
// Phase 1: matrix 794 rows 267 cols
[2024-05-31 20:17:59] [INFO ] Computed 24 invariants in 24 ms
[2024-05-31 20:18:00] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-31 20:18:00] [INFO ] Invariant cache hit.
[2024-05-31 20:18:00] [INFO ] State equation strengthened by 573 read => feed constraints.
[2024-05-31 20:18:00] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2024-05-31 20:18:00] [INFO ] Invariant cache hit.
[2024-05-31 20:18:00] [INFO ] State equation strengthened by 573 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1131 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30032 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 793/1924 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 1924 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30036 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
After SMT, in 61675ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 61704ms
Starting structural reductions in LTL mode, iteration 1 : 267/267 places, 794/816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62763 ms. Remains : 267/267 places, 794/816 transitions.
Support contains 34 out of 267 places after structural reductions.
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 129 ms
[2024-05-31 20:19:02] [INFO ] Flatten gal took : 73 ms
[2024-05-31 20:19:03] [INFO ] Input system was already deterministic with 794 transitions.
Support contains 31 out of 267 places (down from 34) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 7058 steps (0 resets) in 446 ms. (15 steps per ms) remains 0/19 properties
FORMULA FlexibleBarrier-PT-22a-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 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' '!(X((G((!p0||G(!p1))) U (p2 U X(X(!p1))))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-05-31 20:19:03] [INFO ] Invariant cache hit.
[2024-05-31 20:19:04] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 20:19:04] [INFO ] Invariant cache hit.
[2024-05-31 20:19:04] [INFO ] State equation strengthened by 573 read => feed constraints.
[2024-05-31 20:19:04] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2024-05-31 20:19:04] [INFO ] Invariant cache hit.
[2024-05-31 20:19:04] [INFO ] State equation strengthened by 573 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1131 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30018 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 793/1924 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 1924 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30023 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
After SMT, in 61217ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 61227ms
Finished structural reductions in LTL mode , in 1 iterations and 62008 ms. Remains : 267/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 623 ms :[p1, p1, p1, p1, (AND p1 p0), p1, p1, true, p1, (AND p1 p0), p1, p1, (AND p0 p1), (AND p1 p0), p1]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 893 steps with 28 reset in 25 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-02 finished in 62758 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' '!(F(p0))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Graph (trivial) has 218 edges and 267 vertex of which 66 / 267 are part of one of the 22 SCC in 3 ms
Free SCC test removed 44 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 129 place count 159 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 231 transitions
Redundant transition composition rules discarded 231 transitions
Iterating global reduction 0 with 231 rules applied. Total rules applied 360 place count 159 transition count 245
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 362 place count 159 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 363 place count 158 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 364 place count 158 transition count 244
Applied a total of 364 rules in 152 ms. Remains 158 /267 variables (removed 109) and now considering 244/794 (removed 550) transitions.
[2024-05-31 20:20:06] [INFO ] Flow matrix only has 202 transitions (discarded 42 similar events)
// Phase 1: matrix 202 rows 158 cols
[2024-05-31 20:20:06] [INFO ] Computed 24 invariants in 4 ms
[2024-05-31 20:20:06] [INFO ] Implicit Places using invariants in 116 ms returned [156]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/267 places, 244/794 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 157 transition count 222
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 135 transition count 222
Applied a total of 44 rules in 18 ms. Remains 135 /157 variables (removed 22) and now considering 222/244 (removed 22) transitions.
[2024-05-31 20:20:06] [INFO ] Flow matrix only has 180 transitions (discarded 42 similar events)
// Phase 1: matrix 180 rows 135 cols
[2024-05-31 20:20:06] [INFO ] Computed 23 invariants in 0 ms
[2024-05-31 20:20:06] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 20:20:06] [INFO ] Flow matrix only has 180 transitions (discarded 42 similar events)
[2024-05-31 20:20:06] [INFO ] Invariant cache hit.
[2024-05-31 20:20:07] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-31 20:20:07] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 135/267 places, 222/794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 870 ms. Remains : 135/267 places, 222/794 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-03 finished in 950 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' '!(((p0 U G((p1 U X(!p0))))||G(p2)))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 11 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 267 cols
[2024-05-31 20:20:07] [INFO ] Computed 24 invariants in 3 ms
[2024-05-31 20:20:07] [INFO ] Implicit Places using invariants in 277 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 512 ms :[(AND p0 (NOT p2)), p0, p0, (AND (NOT p2) p0), (AND p0 (NOT p2)), p0, p0, p0, p0, true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 324 steps with 103 reset in 14 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-04 finished in 879 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' '!(F(p0))'
Support contains 3 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Graph (trivial) has 215 edges and 267 vertex of which 60 / 267 are part of one of the 20 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 0 with 132 rules applied. Total rules applied 133 place count 161 transition count 517
Drop transitions (Redundant composition of simpler transitions.) removed 268 transitions
Redundant transition composition rules discarded 268 transitions
Iterating global reduction 0 with 268 rules applied. Total rules applied 401 place count 161 transition count 249
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 402 place count 161 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 403 place count 160 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 404 place count 160 transition count 248
Applied a total of 404 rules in 93 ms. Remains 160 /267 variables (removed 107) and now considering 248/794 (removed 546) transitions.
[2024-05-31 20:20:08] [INFO ] Flow matrix only has 207 transitions (discarded 41 similar events)
// Phase 1: matrix 207 rows 160 cols
[2024-05-31 20:20:08] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 20:20:09] [INFO ] Implicit Places using invariants in 543 ms returned [159]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/267 places, 248/794 transitions.
Graph (trivial) has 218 edges and 159 vertex of which 60 / 159 are part of one of the 20 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 119 transition count 146
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 97 transition count 146
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 45 place count 97 transition count 124
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 89 place count 75 transition count 124
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 137 place count 51 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 159 place count 51 transition count 78
Applied a total of 159 rules in 13 ms. Remains 51 /159 variables (removed 108) and now considering 78/248 (removed 170) transitions.
[2024-05-31 20:20:09] [INFO ] Flow matrix only has 55 transitions (discarded 23 similar events)
// Phase 1: matrix 55 rows 51 cols
[2024-05-31 20:20:09] [INFO ] Computed 23 invariants in 0 ms
[2024-05-31 20:20:09] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 20:20:09] [INFO ] Flow matrix only has 55 transitions (discarded 23 similar events)
[2024-05-31 20:20:09] [INFO ] Invariant cache hit.
[2024-05-31 20:20:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:20:09] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/267 places, 78/794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1073 ms. Remains : 51/267 places, 78/794 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-06 finished in 1118 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' '!((F(G(p0)) U (p0||G(p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Graph (trivial) has 217 edges and 267 vertex of which 63 / 267 are part of one of the 21 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 0 with 134 rules applied. Total rules applied 135 place count 158 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 251 transitions
Redundant transition composition rules discarded 251 transitions
Iterating global reduction 0 with 251 rules applied. Total rules applied 386 place count 158 transition count 244
Applied a total of 386 rules in 22 ms. Remains 158 /267 variables (removed 109) and now considering 244/794 (removed 550) transitions.
[2024-05-31 20:20:09] [INFO ] Flow matrix only has 202 transitions (discarded 42 similar events)
// Phase 1: matrix 202 rows 158 cols
[2024-05-31 20:20:09] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 20:20:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 20:20:09] [INFO ] Flow matrix only has 202 transitions (discarded 42 similar events)
[2024-05-31 20:20:09] [INFO ] Invariant cache hit.
[2024-05-31 20:20:09] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-31 20:20:09] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-31 20:20:09] [INFO ] Redundant transitions in 13 ms returned []
Running 243 sub problems to find dead transitions.
[2024-05-31 20:20:09] [INFO ] Flow matrix only has 202 transitions (discarded 42 similar events)
[2024-05-31 20:20:09] [INFO ] Invariant cache hit.
[2024-05-31 20:20:09] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 201/359 variables, 158/340 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 154/494 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 1/360 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 495 constraints, problems are : Problem set: 0 solved, 243 unsolved in 10234 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 158/158 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 201/359 variables, 158/340 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 154/494 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 243/737 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 1/360 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 738 constraints, problems are : Problem set: 0 solved, 243 unsolved in 8897 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 158/158 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
After SMT, in 19174ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 19179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 158/267 places, 244/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19655 ms. Remains : 158/267 places, 244/794 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-07 finished in 19792 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' '!(F(G(p0)))'
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Graph (trivial) has 218 edges and 267 vertex of which 66 / 267 are part of one of the 22 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 305 edges and 220 vertex of which 215 / 220 are part of one of the 23 SCC in 0 ms
Free SCC test removed 192 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 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 538
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 1 with 549 rules applied. Total rules applied 554 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 555 place count 5 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 556 place count 5 transition count 9
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 2 with 2 rules applied. Total rules applied 558 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 561 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 563 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 563 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 565 place count 2 transition count 3
Applied a total of 565 rules in 7 ms. Remains 2 /267 variables (removed 265) and now considering 3/794 (removed 791) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:20:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-31 20:20:29] [INFO ] Invariant cache hit.
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-31 20:20:29] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 20:20:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/267 places, 3/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 2/267 places, 3/794 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-08 finished in 190 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' '!(F(p0))'
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Graph (trivial) has 217 edges and 267 vertex of which 63 / 267 are part of one of the 21 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 307 edges and 222 vertex of which 215 / 222 are part of one of the 23 SCC in 1 ms
Free SCC test removed 192 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 0 with 4 rules applied. Total rules applied 5 place count 30 transition count 560
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Graph (trivial) has 10 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 570 rules applied. Total rules applied 575 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 577 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 578 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 579 place count 5 transition count 10
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 581 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 583 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 3 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 587 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 588 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 589 place count 2 transition count 3
Applied a total of 589 rules in 13 ms. Remains 2 /267 variables (removed 265) and now considering 3/794 (removed 791) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 20:20:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 20:20:29] [INFO ] Invariant cache hit.
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 20:20:29] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 20:20:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 47ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/267 places, 3/794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 2/267 places, 3/794 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-10 finished in 160 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(F(p0)))'
Support contains 3 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 7 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 267 cols
[2024-05-31 20:20:29] [INFO ] Computed 24 invariants in 2 ms
[2024-05-31 20:20:29] [INFO ] Implicit Places using invariants in 198 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-11
Product exploration explored 100000 steps with 2088 reset in 1061 ms.
Stack based approach found an accepted trace after 35 steps with 3 reset with depth 8 and stack size 8 in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-11 finished in 1369 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 U X(p2))))))'
Support contains 9 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 3 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-05-31 20:20:31] [INFO ] Invariant cache hit.
[2024-05-31 20:20:31] [INFO ] Implicit Places using invariants in 134 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 159 ms :[p2, p2, false, p2]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-14
Product exploration explored 100000 steps with 24188 reset in 1472 ms.
Stack based approach found an accepted trace after 13489 steps with 3286 reset with depth 4 and stack size 4 in 210 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-14 finished in 2013 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||G((X(((!p0 U (G(!p0)||(!p0&&G(!p2)))) U (!p3&&(!p0 U (G(!p0)||(!p0&&G(!p2)))))))||p1)))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 2 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-05-31 20:20:33] [INFO ] Invariant cache hit.
[2024-05-31 20:20:33] [INFO ] Implicit Places using invariants in 194 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR p3 p0), (OR (AND (NOT p1) p3) (AND p0 (NOT p1))), true, p0, (AND p0 p2), p2]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-15 finished in 557 ms.
All properties solved by simple procedures.
Total runtime 154414 ms.
ITS solved all properties within timeout
BK_STOP 1717186833657
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-22a"
export BK_EXAMINATION="LTLFireability"
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-22a, examination is LTLFireability"
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-171640602800148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22a.tgz
mv FlexibleBarrier-PT-22a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;